April | 2009 | A kind of library

580 -Partition calculus (6)

April 24, 2009

1. The ${\mbox{Erd\H os}}$ -Rado theorem

Large homogeneous sets (of size ${\omega_1}$ or larger) can be ensured, at the cost of starting with a larger domain. The following famous result was originally shown by ${\mbox{Erd\H os}}$ and Rado using tree arguments (with ${\kappa+1}$ lowered to ${\kappa}$ in the conclusion). We give instead an elementary substructures argument due to Baumgartner, Hajnal and ${\mbox{Todor\v cevi\'c},}$ which proves the stronger version. For ${\kappa}$ a cardinal let ${2^{<\kappa}=\sup_{\lambda<\kappa}2^\lambda.}$

Theorem 1 ( ${\mbox{Erd\H os}}$ -Rado) Let ${\kappa}$ be a regular cardinal and let ${\lambda=(2^{<\kappa})^+.}$ Then

$\displaystyle \lambda\rightarrow(\kappa+1)^2_\mu$

for all ${\mu<\kappa.}$

Read the rest of this entry »

305 -Homework set 8

April 24, 2009

This set is due May 1 at the beginning of lecture. Details of the homework policy can be found on the syllabus and here.

1. Solve exercises 11, 14, and 24 from Chapter 14 of the textbook.

2. Solve exercises 1, 9, and 17 from Chapter 15 of the textbook.

Leave a Comment » | 305: Abstract Algebra I | Permalink
Posted by andrescaicedo

305 -9. Groups

April 24, 2009

We want to define the notion of group that will be fundamental to determine which polynomials are solvable by radicals. This notion is very important and appears in every area of mathematics.

We motivate the definition through the example that most concerns us: automorphisms of fields. They are particular class of isomorphisms, so we begin with them.

Some of the arguments below have been discussed in previous lectures.

Read the rest of this entry »

Leave a Comment » | 305: Abstract Algebra I | Tagged: automorphism, isomorphism | Permalink
Posted by andrescaicedo

580 -Partition calculus (5)

April 21, 2009

1. Larger cardinalities

We have seen that ${\omega\rightarrow(\omega)^n_m}$ (Ramsey) and ${\omega\rightarrow[\omega]^n_\omega}$ ( ${\mbox{Erd\H os}}$ -Rado) for any ${n,m<\omega.}$ On the other hand, we also have that ${2^\kappa\not\rightarrow(3)^2_\kappa}$ ( ${\mbox{Sierpi\'nski}}$ ) and ${2^\kappa\not\rightarrow(\kappa^+)^2}$ ( ${\mbox{Erd\H os}}$ -Kakutani) for any infinite ${\kappa.}$

Positive results can be obtained for larger cardinals than ${\omega}$ if we relax the requirements in some of the colors. A different extension, the ${\mbox{Erd\H os}}$ -Rado theorem, will be discussed later.

Theorem 1 ( ${\mbox{Erd\H os}}$ -Dushnik-Miller) For all infinite cardinals ${\lambda,}$ ${\lambda\rightarrow(\lambda,\omega)^2.}$

This was originally shown by Dushnik and Miller in 1941 for ${\lambda}$ regular, with ${\mbox{Erd\H os}}$ providing the singular case. For ${\lambda}$ regular one can in fact show something stronger:

Theorem 2 ( ${\mbox{Erd\H os}}$ -Rado) Suppose ${\kappa}$ is regular and uncountable. Then
$\displaystyle \kappa\rightarrow_{top}(\mbox{Stationary},\omega+1)^2,$ which means: If ${f:[\kappa]^2\rightarrow2}$ then either there is a stationary ${H\subseteq\kappa}$ that is ${0}$ -homogeneous for ${f}$ , or else there is a closed subset of ${\kappa}$ of order type ${\omega+1}$ that is ${1}$ -homogeneous for ${f}$ .

(Above, top stands for “topological.”)

Read the rest of this entry »

6 Comments | 580: Topics in set theory | Tagged: elementary embedding, Grigor Sargsyan, Jan Tryba, Jonsson cardinal, measurable cardinal, Ramsey cardinal, Reinhardt cardinal, Rowbottom cardinal, W. Hugh Woodin, weakly compact cardinal | Permalink
Posted by andrescaicedo

305 -8. Irreducibility

April 20, 2009

In this lecture I want to present a couple of short results that are nevertheless very useful in practice when trying to show that a given polynomial in ${{\mathbb Q}[x]}$ is irreducible. Of course, we may assume that the polynomial actually has integer coefficients. In this case, it turns out that analyzing whether the polynomial factors over ${{\mathbb Z}[x]}$ suffices.

Read the rest of this entry »

Leave a Comment » | 305: Abstract Algebra I | Tagged: Eisenstein criterion, Gauss lemma, irreducible polynomial | Permalink
Posted by andrescaicedo

580 -Cardinal Arithmetic

April 20, 2009

Here is a pdf file with the contents of the lectures on cardinal arithmetic. As with the previous chapter, it follows closely the style of the notes. There are fewer typos than in the posts, and once again I made a minuscule tidying up. Please let me know of comments, corrections, and suggestions.

Leave a Comment » | 580: Topics in set theory | Permalink
Posted by andrescaicedo

580 -Some choiceless results

April 16, 2009

I reformatted the posts for the lectures on choiceless results. Here they are as a pdf file. It follows closely the style of the notes. I fixed a couple of typos, and made a minuscule tidying up. Please let me know of comments, corrections, and suggestions.

Update (Dec. 3, 2009). The pdf file still contains an error that was pointed out to me recently. In the third lecture on choiceless results, the correct argument is given.

Leave a Comment » | 580: Topics in set theory | Permalink
Posted by andrescaicedo

Categories

Mathoverflow

Answer by Andrés E. Caicedo for "Inner Regularity" of probability measure on totally ordered sets October 7, 2019

Consider a subset $\Omega$ of $\mathbb R$ of size $\aleph_1$ and ordered in type $\omega_1$. (This uses the axiom of choice.) Let $\mathcal F$ be the $\sigma$-algebra generated by the initial segments of $\Omega$ under the well-ordering (so all sets in $\mathcal F$ are countable or co-countable), with the measure that assigns $0$ to the countable sets and $1 […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Question about Jech's proof of V = L implies GCH June 3, 2019

You assume $\omega_\alpha\subseteq M$ and $X\in M$ so that $X$ belongs to the transitive collapse of $M$ (because if $\pi$ is the collapsing map, $\pi(X)=\pi[X]=X$. You assume $|M|=\aleph_\alpha$ so that the transitive collapse of $M$ has size $\aleph_\alpha$. Since you also have that this transitive collapse is of the form $L_\beta$ for some $\beta$, it fol […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Smallest $\beta$ such that it is provable that $2^{\aleph_\beta} > 2^{\aleph_0}$ January 16, 2019

Perhaps the following may clarify the comments: for any ordinal $\delta$, there is a Boolean-valued extension of the universe of sets where $2^{\aleph_0}>\aleph_\delta$ holds. If you rather talk of models than Boolean-valued extensions, what this says is that we can force while preserving all ordinals, and in fact all initial ordinals, and make the contin […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Arguments against large cardinals October 29, 2010

I do not know of any active set theorists who think large cardinals are inconsistent. At least, within the realm of cardinals we have seriously studied. [Reinhardt suggested an ultimate axiom of the form "there is a non-trivial elementary embedding $j:V\to V$". Though some serious set theorists found it of possible interest immediately following it […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Nonessential use of large cardinals December 10, 2010

There is a fantastic (and not too well-known) result of Shelah stating that $L({\mathcal P}(\lambda))$ is a model of choice whenever $\lambda$ is a singular strong limit of uncountable cofinality. This is a consequence of a more general theorem that can be found in 4.6/6.7 of "Set Theory without choice: not everything on cofinality is possible", Ar […]

Andrés E. Caicedo

Math.StackExchange

Answer by Andrés E. Caicedo for Can we find a set $B⊂ℕ$ such that an equivalence holds true October 9, 2019

Let $B=\{n\mid \forall m\in A\,(n>m)\}$. That is, $B$ is the collection of natural numbers that are larger than all elements of $A$. If $A$ is infinite, $B$ is empty. If $A$ is finite, $B$ is not only infinite, but in fact it is a tail of the natural numbers; more precisely, it is the set of all natural numbers strictly larger than the maximum of $A$.

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Exists infinitely many as a numerical-quantifier October 6, 2019

The standard notation in logic would be $\exists^\infty$. The exclamation mark ! is used to indicate uniqueness, $\exists^{!n} x\,\phi(x)$ being "there are exactly $n$ distinct elements $x$ such that $\phi(x)$". So, the standard reading of $\exists^{!\infty}x\,\phi(x)$ would be "there are exactly infinitely many $x$ such that..." which is […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Does there exist a sequence that has countably infinite convergent subsequences? August 21, 2019

Take $a_n=p$, where $p$ is the smallest prime dividing $n$. If a subsequence converges, it converges to a prime $p$, in which case except for finitely many initial terms, the sequence is eventually constant with value $p$. But the number of initial terms is arbitrary.

Andrés E. Caicedo

Answer by Andrés E. Caicedo for What is the consistency strength of generalized failure of the continuum hypothesis. April 14, 2019

The precise consistency strength of the global failure of the generalized continuum hypothesis is somewhat technical to state. As far as I know, it has not been published, but I think we have a decent understanding of what the correct statement should be. The most relevant paper towards this result is MR2224051 (2007d:03082). Gitik, Moti Merimovich, Carmi. P […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Is "integrability" equivalent to "having antiderivative"? March 9, 2014

There are integrable functions that are not derivatives: Any function that is continuous except at a single point, where it has a jump discontinuity, is an example. (Derivatives have the intermediate value property.) More interestingly, we can ask whether the existence of an antiderivative ensures integrability. The answer depends on what integral you are co […]

Andrés E. Caicedo

	Anthea M. on No durians
	580 -Some choiceless… on 580 -Some choiceless results…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…
	Set theory seminar -… on Set theory seminar -Forcing ax…

A kind of library

580 -Partition calculus (6)

305 -Homework set 8

305 -9. Groups

580 -Partition calculus (5)

305 -8. Irreducibility

580 -Cardinal Arithmetic

580 -Some choiceless results

Categories

Recent Comments

Mathematical links

My pages

Others

Mathoverflow

Math.StackExchange

Archives

April 2009
M	T	W	T	F	S	S
« Mar				May »
		1	2	3	4	5
6	7	8	9	10	11	12
13	14	15	16	17	18	19
20	21	22	23	24	25	26
27	28	29	30