These exercises (due September 28) are mostly meant to test your understanding of compactness.

Let be a nonstandard model of Show:

(Overspill) Suppose that is definable (with parameters) and that Show that is finite.

(Underspill) Suppose that is definable and that Show that there is some infinite such that all the elements of are larger than

Let be a nonstandard model of Here, is treated as a relation, and in we may have placed whatever functions and relations we may have need to reference in what follows; moreover, we assume that in our language we have a constant symbol for each real number. (Of course, this means that we are lifting the restriction that languages are countable.) To ease notation, let’s write for The convention is that we identify actual reals in with their copies in so we write rather than etc.

Show that is a nonstandard model of the theory of problem 1. (In particular, check that the indicated restrictions of and have range contained in )

A (nonstandard) real is finite iff there is some (finite) natural number such that Otherwise, it is infinite. A (nonstandard) real is infinitesimal iff but for all positive (finite) natural numbers one has that We write to mean that either is infinitesimal, or else it is Show that infinite and infinitesimal numbers exist. The monad of a real is the set of all such that which we may also write as and say that and are infinitesimally close. Show that the relation is an equivalence relation. Show that if a monad contains an actual real number, then this number is unique. Show that this is the case precisely if it is the monad of a finite number. In this case, write to indicate that the (actual) real is in the monad of We also say that is the standard part of

Show that a function is continuous at a real iff for all infinitesimal numbers

Suppose that is continuous on the closed interval Argue as follows to show that attains its maximum: For each positive integer there is some integer with such that Conclude that the same holds if is some infinite natural number, i.e., there is some (perhaps infinite) “natural number” with such that Let and argue that the maximum of is attained at

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Saturday, September 19th, 2009 at 12:46 pm and is filed under 502: Logic and set theory. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

Given a language and an -structure a set is definable iff there is a formula with (distinct) free variables and there are elements such that, letting be the set of assignments such that for then for all with

In human: is definable if it is the set of elements of that satisfy some formula. We allow said formula to use parameters, i.e., to refer to some fixed elements of

Now my concern is: if 0 is not an infinitesimal, then is reflexive. Namely, if then . That is, for all positive . But . So, cannot be infinitesimal. What am I missing here?

Type ‘latex’ immediately following the dollar sign, leave a space, and then the math text as you’d do in latex usually. See this announcement for more info.

The wordpress people tweak with the way latex is compiled every now and then, so sometimes strange errors that were not there before appear; but it works pretty decently, and it is getting better. (There seem to be a few silly things still: you want to write {} right before a [ if this is the first symbol in a math display, for example.)

Luca Trevisan devised a nice program, LaTeX2WP, to make the use of in WordPress pleasant rather than traumatic; I use it whenever I have a long post.

I thought about this question a while ago, while teaching a topics course. Since one can easily check that $${}|{\mathbb R}|=|{\mathcal P}({\mathbb N})|$$ by a direct construction that does not involve diagonalization, the question can be restated as: Is there a proof of Cantor's theorem that ${}|X|

First of all, note (as Monroe does in his question) that if $\mathbb P,\mathbb Q$ are ccc, then $\mathbb P\times\mathbb Q$ is $\mathfrak c^+$-cc, as an immediate consequence of the Erdős-Rado theorem $(2^{\aleph_0})^+\to(\aleph_1)^2_2$. (This is to say, if $\mathbb P$ and $\mathbb Q$ do not admit uncountable antichains, then any antichain in their product ha […]

The technique of almost disjoint forcing was introduced in MR0289291 (44 #6482). Jensen, R. B.; Solovay, R. M. Some applications of almost disjoint sets. In Mathematical Logic and Foundations of Set Theory (Proc. Internat. Colloq., Jerusalem, 1968), pp. 84–104, North-Holland, Amsterdam, 1970. Fix an almost disjoint family $X=(x_\alpha:\alpha

At the moment most of those decisions come from me, at least for computer science papers (those with a 68 class as primary). The practice of having proceedings and final versions of papers is not exclusive to computer science, but this is where it is most common. I've found more often than not that the journal version is significantly different from the […]

The answer is no in general. For instance, by what is essentially an argument of Sierpiński, if $(X,\Sigma,\nu)$ is a $\sigma$-finite continuous measure space, then no non-null subset of $X$ admits a $\nu\times\nu$-measurable well-ordering. The proof is almost verbatim the one here. It is consistent (assuming large cardinals) that there is an extension of Le […]

R. Solovay proved that the provably $\mathbf\Delta^1_2$ sets are Lebesgue measurable (and have the property of Baire). A set $A$ is provably $\mathbf\Delta^1_2$ iff there is a real $a$, a $\Sigma^1_2$ formula $\phi(x,y)$ and a $\Pi^1_2$ formula $\psi(x,y)$ such that $$A=\{t\mid \phi(t,a)\}=\{t\mid\psi(t,a)\},$$ and $\mathsf{ZFC}$ proves that $\phi$ and $\psi […]

A notion now considered standard of primitive recursive set function is introduced in MR0281602 (43 #7317). Jensen, Ronald B.; Karp, Carol. Primitive recursive set functions. In 1971 Axiomatic Set Thoory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967) pp. 143–176 Amer. Math. Soc., Providence, R.I. The concept is use […]

The power of a set is its cardinality. (As opposed to its power set, which is something else.) As you noticed in the comments, Kurepa trees are supposed to have countable levels, although just saying that a tree has size and height $\omega_1$ is not enough to conclude this, so the definition you quoted is incomplete as stated. Usually the convention is that […]

The key problem in the absence of the axiom of replacement is that there may be well-ordered sets $S$ that are too large in the sense that they are longer than any ordinal. In that case, the collection of ordinals isomorphic to an initial segment of $S$ would be the class of all ordinals, which is not a set. For example, with $\omega$ denoting as usual the f […]

What was the precise definition of “definable” again. I can’t find it in the book anywhere.

Given a language and an -structure a set is

definableiff there is a formula with (distinct) free variables and there are elements such that, letting be the set of assignments such that for then for all withIn human: is definable if it is the set of elements of that satisfy some formula. We allow said formula to use parameters, i.e., to refer to some fixed elements of

Thanks.

Is 0 considered an infinitesimal? By the definition above, 0 would be, but I always thought it was otherwise.

Ah, you are right! I’ve modified the text accordingly.

Making infinitesimals different from 0 now forces us to change slightly the definition of so I’ve done that as well.

Now my concern is: if 0 is not an infinitesimal, then is reflexive. Namely, if then . That is, for all positive . But . So, cannot be infinitesimal. What am I missing here?

[Addressed by the revised definition. -A.]Thank you. It’s clear now.

Also, how do you get LaTex to work on your blog? I noticed that you got the approximation symbol to show, but when I tried \approx it didn’t work

Type ‘latex’ immediately following the dollar sign, leave a space, and then the math text as you’d do in latex usually. See this announcement for more info.

The wordpress people tweak with the way latex is compiled every now and then, so sometimes strange errors that were not there before appear; but it works pretty decently, and it is getting better. (There seem to be a few silly things still: you want to write {} right before a [ if this is the first symbol in a math display, for example.)

Luca Trevisan devised a nice program, LaTeX2WP, to make the use of in WordPress pleasant rather than traumatic; I use it whenever I have a long post.