This tag is for set theory topics typically studied at the advanced undergraduate or graduate level. These include cofinality, axioms of ZFC, axiom of choice, forcing, set-theoretic independence, large cardinals, models of set theory, ultrafilters, ultrapowers, constructible universe, inner model ...

learn more… | top users | synonyms

0
votes
0answers
20 views

If A and B are subsets of the universal set S thendo we know that A intersection (not B) is a subset of A

If $A$ and $B$ are subsets of the universal set $S$ then do we know that $A$ intersection (not $B$) is a subset of $A$? Well, if $S = \{1,2,3,4,5\}$ and $A = B = \{1,2\}$ then not $B = \{3,4,5\}$ and ...
0
votes
1answer
18 views

Induction proof involving sets

Suppose $A_1,A_2,...A_n$ are sets in some universal set $U$, and $n\geq2$. Prove that $\overline{A_1 \cup A_2 \cup ... \cup A_n}$ = $\overline{A_1} \cap \overline{A_2} \cap ... \cap \overline{A_n}$
3
votes
1answer
72 views

What would provable existence of a non-standard natural number imply about ZFC?

Assume that in ZFC we can define a set $x$ in some way and that the following are provable: $x$ is a finite ordinal, (i.e. $x\in\omega$) $x\neq0$ $x\neq1$ $x\neq2$ etc. So to say that the ...
3
votes
1answer
32 views

What are $\in$-well orderable classes?

$V$ is not $\in$-well ordered but $Ord$ is. Is $Ord$ the unique proper class of the universe which is $\in$-well ordered?
-2
votes
0answers
52 views

Is the structure with sets and the ZFC axioms a model of the first order logic?

Wikipedia says ZFC is a one-sorted theory in first-order logic. The signature has equality and a single primitive binary relation, set membership, which is usually denoted ∈. The formula a ∈ b ...
2
votes
0answers
49 views

Expository Papers on Extenders

Extenders are discussed in many set theory text books. Here I am looking for some expository "papers" which are focused on this subject and its connection with forcing and large cardinals. More ...
1
vote
0answers
27 views

Is infinitary Levy hierarchy well-defined?

The well-known Levy hierarchy of formulas consist of two $\omega$-sequences of sets of formulas of different complexity $\langle\langle \Sigma_n:n\in \omega\rangle,\langle \Pi_n:n\in ...
0
votes
0answers
42 views

Similarity of the Universe $V$ and its $\kappa$-Fragments

Intuitively, if a cardinal $\kappa$ is "large" then the $\kappa$-fragment of the universe $V_{\kappa}$ is so "similar" to the entire universe $V$. For example if $\kappa$ is supercompact then ...
1
vote
0answers
30 views

Filters on a set of filters, are they equivalent to just filters?

Let $F(X)$ be the set of all filters (including the improper filter) on a poset $X$, ordered reversely to set-theoretic inclusion of filters. Let $U$ be a set. Is $F(F(\mathscr{P}U))$ order ...
1
vote
0answers
50 views

Existence of a generic ultrafilter over constructible universe

I am referring to the Jech's "Set Theory" book. He wants to show that, if $(P,<)$ is the notion of forcing defined as: $p \in P$ iff $p$ is a finite sequence of ordinals less than $\omega_{1}^{L}$ ...
1
vote
1answer
50 views

infinite Cartesian products

Quote from Wikipedia, infinite set: The Cartesian product of an infinite number of sets each containing at least two elements is either empty or infinite. I know that this is the regime where we ...
1
vote
0answers
55 views

Zuckerman's “Sets and Transfinite Numbers”

I am beginning a study in set theory and I found an old book in my school's library by Martin Zuckeman called Sets and Transfinite Numbers which was published in the 1970's. Has anyone used this text ...
0
votes
0answers
32 views

Flaw in the proof that a set is countable [duplicate]

Q: Let S be the set containing all sequences of 0's and 1's. i.e $S = \{(a_1,a_2,a_3,a_4,\ldots) : a_i = 0 \text{ or } 1\}$ Show that S is countable. Proof(Flawed) : Let $A_i$ be the ...
0
votes
0answers
60 views

Algebraic constructions to add a real to a sub-group of $\langle \mathbb{R}^+,.\rangle$

Consider the group $\langle \mathbb{R}^+,.\rangle$ and let $r$ be a real number (e.g. $r=\sqrt{2}$). I would like to know about all known algebraic constructions to build a sub-group of $\langle ...
4
votes
1answer
43 views

Exact $\Delta$ - System Lemma

The well-known $\Delta$-system lemma states: Each uncountable family of finite sets has an uncountable sub-family with a root. Precisely: $$\forall F~~~(|F|>\aleph_0~\wedge~\forall X\in ...
4
votes
2answers
244 views

Is the pseudomenon a statement?

I'm asking this because I'm teaching a class on paradoxes for kids, and I realized I have no idea what the answer to this question is. It is a research question in the pedagogical sense, I suppose. ...
1
vote
1answer
78 views

difference of infinities [closed]

So I haven't studied this subject In a while, and when i get home, I'm going to consult my book on the Theory of computation to reinforce my understanding, but here is my question. So I understand ...
3
votes
1answer
74 views

$\aleph_\omega$ and large ordinals?

Assuming the GCH, each time you take the powerset of an aleph number, the subscript increases by one. So there is $\aleph_0, \aleph_1, \aleph_2\ldots \aleph_\omega\ldots \aleph_{\epsilon_0}\ldots$ and ...
1
vote
1answer
49 views

A question about $cov(I)$

Given a set $X$ and an ideal $I \subseteq \mathcal P(X)$, $cov(I) := \min \{ |\mathcal A| | \mathcal A \subseteq I (\bigcup \mathcal A = X)\}$. My question is: isn't it possible that for each ...
1
vote
0answers
76 views

A Question Regarding Consistent Fragments of Naive (Ideal) Set Theory

It is well known that Naive (to some, otherwise known as Ideal) set theory, that is, the set theory generated by the axioms: (EXT) (x)(x $\in$ A iff x $\in$ B) iff A=B (COMP) ($\exists$y)(x)(x ...
1
vote
1answer
52 views

Could induction give us an infinite sequence of sets $X_1 \subseteq X_2 \subseteq \cdots$ or do we need the axiom of choice?

Suppose at each step $n$ of a proof by induction, we have a set $X_n$. Also, $X_{n} \subseteq X_{n+1}$. Is induction enough to give us $\bigcup_{n \in \mathbb{N}} X_n$? Or rather, when is it enough? ...
0
votes
2answers
107 views

Is it true that $\omega=\{0,1,2,3,\ldots\}$ in ZFC?

This is a bit of a philosophical question. According to "Set Theory" by Jech, the set $\omega$ of natural numbers is defined as the least nonzero limit ordinal. After thinking about this definition ...
10
votes
1answer
106 views

Partitions of the Cantor space into parities

Call a partition of $2^\mathbb{N} = A\cup B$ a parity partition if, for any $n\in\mathbb{N}$, flipping the $n$th bit of any element of $A$ results in an element of $B$, and vice-versa. Given a choice ...
0
votes
1answer
30 views

What is the meaning of the notation $cf(add(\mathcal I))$?

I am trying to prover the following claim: Assume that $\mathcal I$ is an ideal over some infinite set $X$. Then, $cf(add(\mathcal I))=add(\mathcal I)$. Doe anyone know what is the meaning of the ...
1
vote
0answers
54 views

Other Types of Order Types

Consider following fundamental fact of ZFC. Fact ‎‎$‎‎‎\forall ‎‎~\text{well-ordering}~\langle ‎A,<‎\rangle~~~‎\exists ‎!\alpha~~~‎‎‎‎‎\langle A,<‎‎\rangle‎\cong‎\langle‎\alpha‎,\in‎‎\rangle‎$‎ ...
3
votes
0answers
47 views

Exercise on preservation of cardinals

I'm trying to solve exercise 12.1 in Prof. Monk's lectures on set theory which asks me to show that $Fn(\omega_1, 2, \omega_1)$ preserves cardinals larger than $\omega_2$. Now, the only method in the ...
7
votes
1answer
101 views

Constructing a Banach space of cardinality $\beth_{\omega+1}$

This is related to yesterday's question Constructing a vector space of dimension $\beth_\omega$; it's the next exercise (I.13.35 (a)) in Kunen's Set Theory. Let $B_0 = \ell^1$ and let $B_{n+1} = ...
3
votes
2answers
98 views

Constructing a vector space of dimension $\beth_\omega$

I'm trying to solve Exercise I.13.34 of Kunen's Set Theory, which goes as follows (paraphrased): Let $F$ be a field with $|F| < \beth_\omega$, and $W_0$ a vector space over $F$ with $\aleph_0 ...
0
votes
1answer
35 views

Model of a system of set theory

I was trying to understand Easton's theorem's proof. But I am not able to understand a few terms- model of a system of set theory, ranked variables, free variables, abstraction term, set constant, ...
-1
votes
1answer
38 views

Functions with cardinals as domain

How do we actually define a function with cardinals as domain? For example, take domain of the function as $\aleph_1$. Do we define it for all cardinal numbers strictly less than $\aleph_1$?
2
votes
0answers
36 views

The notations $ M[X] $ and $ V[A] $ and intermediate models

I am confused about Jech's notations $ M[X] $ and $ V[A] $. Let us begin with exercise 13.34 (see [Jec02, p. 199]). Let $ \mathbf{M} $ be a transitive model of $ \mathsf{ZF} $ containing all ...
0
votes
1answer
28 views

Cardinal Arithmetic, Regular Cardinals, and Exponentiation

I cannot solve a simple cardinal exponentiation/regularity exercise. Let $\kappa$ be a regular cardinal. Why is the cardinal $\kappa^{\lt \kappa}=\sum_{\alpha<\kappa}\kappa^\alpha$ regular as ...
0
votes
1answer
23 views

Union of Dedekind-finite sets

$F$ is Dedekind-finite if for every $A\varsubsetneq F$ we have $A<_cF$. Need help to prove that if $F,G$ are Dedekind-finite sets, $F\cap G=\emptyset$ then $F\cup G$ is also Dedekind-finite. ...
2
votes
1answer
57 views

In $\sf{ZF}$, is every finite set also hereditarily finite?

The following is an excerpt from Wikipedia's Hereditarily finite set page: A recursive definition of well-founded hereditarily finite sets goes as follows: Base case: The empty set is a ...
4
votes
1answer
114 views

cov(meager) strictly between $\aleph_1$ and $2^{\aleph_0}$

Is is consistent that $\aleph_1 < \text{cov(meager)} < 2^{\aleph_0}$? I can only seem to find references for results that assert it is consistent that it (or other cardinal characteristics) is ...
1
vote
1answer
27 views

Is “constructible from” a transitive relation?

In Jech's Set Theory, exercise 13.27, it is hinted that $X \in L[Y]$ and $Y \in L[X]$ together imply $L[X]=L[Y]$. I tried to prove this fact without success, although I suspect the proof is simple. ...
6
votes
1answer
77 views

Construction of Ultrafilters

I've been doing a lot of work with ultrapowers and saturation recently. In particular, I am reading chapter 6 of Chang and Keisler as well as Keisler's paper on "Ultraproducts which are not ...
1
vote
0answers
46 views

Banach Tarski paradox in Minkowski space

The Banach - Tarski paradox states: 'A three-dimensional Euclidean ball is equidecomposable with two copies of itself.' My simple question is: Does this paradox hold his validity also in the Minkowski ...
1
vote
0answers
32 views

Can one talk about equivalences classes in a class(which might not be a set). [duplicate]

equivalence relation on a set breaks it into disjoint sets. does 'disjointness' make sense in classes. specifically, given a category, isomorphism classes of objects makes sense or not. can it be so ...
-1
votes
0answers
26 views

Does there exist a cardinal $\kappa$ such that $\aleph_{\kappa} = \kappa$? [duplicate]

Does there exist a cardinal $\kappa$ such that $\aleph_{\kappa} = \kappa$ ? Moreover is there one that is regular? Thanks in advance!
2
votes
1answer
48 views

Why is $\alpha \mapsto L_{\alpha}[A]$ $\Delta_{1}$?

On page 187 of Jech's Set Theory, there is a proof sketch of the fact that $\alpha \mapsto L_{\alpha}$ is $\Delta_{1}$. As far as I can tell, Jech's argument only shows that this operation is ...
0
votes
0answers
37 views

Sets Constructible Relative To A Unary Predicate

The class $L$ of constructible sets is defined by recursion using the operation def$(M)=\{x \subset M: x$ is definable over $(M, \in) \}$. By adding a unary predicate, $P$, to our language, we can ...
0
votes
0answers
31 views

Tarski's theorem follows from choice [duplicate]

It is known that Tarski's theorem and axiom of choice are equivalent. Implication $\Rightarrow$ follows from considering bijection $(A+\aleph(A))^2\rightarrow(A+\aleph(A))$. Implication $\Leftarrow$ ...
3
votes
2answers
85 views

Distinguishing sets according to more fine-grained notions than cardinality.

I'm interested in distinguishing sets according to more fine-grained notions than cardinality. Now I don't know a thing about computability theory, but it seems to me that considering sets up to ...
-1
votes
1answer
129 views

Can't prove Continuum Hypothesis

My teacher said (and I checked on Wikipedia too), that there is a theory, the Continuum hypothesis, that can neither be proved nor disproved. However, the theory states that: There is no set ...
0
votes
2answers
113 views

Is the “Most Important Property a Set S has” Necessary and Sufficient to Define a Paradox-Free Notion of Set?

About a year and a half ago, while I was looking on the Web for papers regarding the Russell paradox, I chanced to find an interesting concept. This concept was contained in what (for want of a ...
8
votes
5answers
570 views

Do we need Axiom of Choice to make infinite choices from a set?

According to the answers to this question, we do not need choice to pick from a finite product of nonempty sets, even if each of the sets is infinite. The axiom of choice is required to ensure that a ...
3
votes
2answers
146 views

What is the meaning/purpose of finding the “foundations of mathematics”?

I've read in a lot of places how there was a "foundational crisis" in defining the "foundations of mathematics" in the 20th century. Now, I understand that mathematics was very different then, I ...
1
vote
1answer
67 views

Reference request, Descriptive set theory

I was wondering what a good text would be to learn descriptive set theory out of? Hopefully something more in the spirit of Kunen's text on the introduction to independence proofs.
2
votes
1answer
45 views

Cardinal Arithmetic 2: $\beth_{\omega_1}$

This is question is simple to write but (I think) hard to solve. Does the following equality hold? $$\bigcup_{{\beta}<\beth_{\omega_1}}\beth_{\omega+1}(|\beta+\omega|) =\beth_{\omega_1} $$ Where ...