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 Proofs of the uncountability of the reals. November 23, 2010

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|

Andrés E. Caicedo

Answer by Andrés E. Caicedo for chain condition of a product of posets August 27, 2017

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 […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Conflating reals and sets of countable ordinals "nicely" August 15, 2017

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

Andrés E. Caicedo

Answer by Andrés E. Caicedo for What is the need for MathSciNet reviewing again the journal versions of conference papers? August 6, 2017

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 […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for product of power sets July 13, 2017

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 […]

Andrés E. Caicedo

Math.StackExchange

Answer by Andrés E. Caicedo for Which sets are Lebesgue measurable in $ZFC$? August 20, 2017

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 […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Recursively enumerable sets in ZF September 11, 2017

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 […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for What is the cofinality of $\kappa^{ September 7, 2017

Suppose $\kappa$ is a singular cardinal. To analyze the size of $\kappa^{

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Definition for "power" of a tree? (Kurepa trees) August 21, 2017

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 […]

Andrés E. Caicedo

Answer by Andrés E. Caicedo for Why does this proof that Every Well-ordered Set is Isomorphic to a Unique Ordinal need to use the Axiom of Replacement August 21, 2017

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 […]

Andrés E. Caicedo

	Nosferatu \| A kind o… on The cabinet of Doctor Cal…
	Monica Agana –… on 414/514 The theorems of Rieman…
	The Dalek invasion o… on The Dalek invasion of Boi…
	andrescaicedo on Help!
	Asaf Karagila on On anti-foundation and coding…
	andrescaicedo on On anti-foundation and coding…
	Asaf Karagila on On anti-foundation and coding…
	On anti-foundation a… on Interpretations
	andrescaicedo on MSC2020
	andrescaicedo on MSC2020
	Asaf Karagila on Help!
	andrescaicedo on Help!
	Yizheng Zhu (@yizhen… on Help!
	andrescaicedo on Help!
	Joel David Hamkins on Help!

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