Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Freiling's axiom of symmetry
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Axiom in set theory}} '''Freiling's axiom of symmetry (<math>\texttt{AX}</math>)''' is a [[set theory|set-theoretic]] axiom proposed by [[Chris Freiling]]. It is based on intuition of Stuart Davidson but the mathematics behind it goes back to [[Wacław Sierpiński]]. Let <math>A\subseteq\mathcal{P}([0,1])^{[0,1]}</math> denote the set of all functions from <math>[0,1]</math> to countable subsets of <math>[0,1]</math>. (In other words, <math> A = \left(\big[[0,1]\big]^{\leq\omega}\right)^{[0,1]} </math> where <math> [X]^{\leq\kappa} </math> is the collection of subsets of <math> X </math> of cardinality at most <math> \kappa </math>.) The axiom <math>\texttt{AX}</math> then states: :For every <math>f\in A</math>, there exist <math>x,y\in[0, 1]</math> such that <math>x\not\in f(y)</math> and <math>y\not\in f(x)</math>. A theorem of Sierpiński says that under the assumptions of ZFC set theory, <math>\texttt{AX}</math> is equivalent to the negation of the [[continuum hypothesis]] (CH). Sierpiński's theorem answered a question of [[Hugo Steinhaus]] and was proved long before the independence of CH had been established by [[Kurt Gödel]] and [[Paul Cohen (mathematician)|Paul Cohen]]. Freiling claims that probabilistic intuition strongly supports this proposition while others disagree. There are several versions of the axiom, some of which are discussed below. ==Freiling's argument== Fix a function ''f'' in ''A''. We will consider a thought experiment that involves throwing two darts at the unit interval. We are not able to physically determine with infinite accuracy the actual values of the numbers ''x'' and ''y'' that are hit. Likewise, the question of whether "''y'' is in ''f''(''x'')" cannot actually be physically computed. Nevertheless, if ''f'' really ''is'' a function, then this question is a meaningful one and will have a definite "yes" or "no" answer. Now wait until after the first dart, ''x'', is thrown and then assess the chances that the second dart ''y'' will be in ''f''(''x''). Since ''x'' is now fixed, ''f''(''x'') is a fixed countable set and has [[Lebesgue measure]] zero. Therefore, this event, with ''x'' fixed, has probability zero. Freiling now makes two generalizations: * Since we can predict with virtual certainty that "''y'' is not in ''f''(''x'')" after the first dart is thrown, and since this prediction is valid no matter what the first dart does, we should be able to make this prediction before the first dart is thrown. This is not to say that we still have a measurable event, rather it is an intuition about the nature of being predictable. * Since "''y'' is not in ''f''(''x'')" is predictably true, by the symmetry of the order in which the darts were thrown (hence the name "axiom of symmetry") we should also be able to predict with virtual certainty that "''x'' is not in ''f''(''y'')". The axiom <math>\texttt{AX}</math> is now justified based on the principle that what will predictably happen every time this experiment is performed, should at the very least be possible. Hence there should exist two real numbers ''x'', ''y'' such that ''x'' is not in ''f''(''y'') and ''y'' is not in ''f''(''x''). ==Relation to the (Generalised) Continuum Hypothesis== Fix <math>\kappa\,</math> an infinite cardinal (''e.g.'' <math>\aleph_{0}\,</math>). Let <math>\texttt{AX}_{\kappa}</math> be the statement: ''there is no map <math>f:\mathcal{P}(\kappa)\to[\mathcal{P}(\kappa)]^{\leq\kappa}\,</math> from sets to <math>\leq\kappa</math>-sized collections of sets such that for any <math>{x,y\in\mathcal{P}(\kappa)}\,</math> either <math>x\in f(y)\,</math> or <math>y\in f(x)\,</math>.'' '''Claim:''' <math>\texttt{ZFC}\vdash 2^{\kappa}=\kappa^{+}\leftrightarrow\neg\texttt{AX}_{\kappa}\,</math>. '''Proof:''' ''Part I'' (<math>\Rightarrow\,</math>): Suppose <math>2^{\kappa}=\kappa^{+}\,</math>. Then there exists a bijection <math>\sigma:\kappa^{+}\to\mathcal{P}(\kappa)\,</math>. We will exploit the well-ordering of <math>\kappa^+</math> to build an ascending chain in <math>[\mathcal P(\kappa)]^{\leq\kappa}</math>. Define a function <math>f:\mathcal{P}(\kappa)\to[\mathcal{P}(\kappa)]^{\leq\kappa}\,</math> by <math>\sigma(\alpha) \mapsto \{\sigma(\beta) : \beta \leq \alpha\}\,</math>. Given this function, it is straightforward to see that this demonstrates the failure of Freiling's axiom. The map <math>\sigma</math> induces a well-ordering <math>\preceq</math> on <math>\mathcal P(\kappa)</math> (sometimes called the ''pushforward'' of the standard ordering on <math>\kappa</math>). Picking any two <math>x,y \in \mathcal P(\kappa)</math>, we can state without loss of generality that <math>x \preceq y</math>. But then, noting the definition of <math>f</math>, we see that this implies <math>x \in f(y) = \{t \in \mathcal P(\kappa) : t \preceq y \}</math>. Thus we have found a function <math>f</math> witnessing <math>\neg\texttt{AX}_\kappa</math>. ''Part II'' (<math>\Leftarrow\,</math>): Suppose that Freiling's axiom fails. Then fix some <math>f\,</math> to verify this fact. Define an order relation on <math>\mathcal{P}(\kappa)\,</math> by <math>A\leq_{f} B</math> iff <math>A\in f(B)</math>. This relation is total and every point has <math>\leq\kappa</math> many predecessors. Define now a strictly increasing chain <math>(A_{\alpha}\in\mathcal{P}(\kappa))_{\alpha<\kappa^{+}}</math> as follows: at each stage choose <math>A_{\alpha}\in\mathcal{P}(\kappa)\setminus\bigcup_{\xi<\alpha}f(A_{\xi})</math>. This process can be carried out since for every ordinal <math>\alpha<\kappa^{+}\,</math>, <math>\bigcup_{\xi<\alpha}f(A_{\xi})\,</math> is a union of <math>\leq\kappa\,</math> many sets of size <math>\leq\kappa\,</math>; thus is of size <math>\leq\kappa<2^{\kappa}\,</math> and so is a strict subset of <math>\mathcal{P}(\kappa)\,</math>. We also have that this sequence is ''cofinal'' in the order defined, ''i.e.'' every member of <math>\mathcal{P}(\kappa)\,</math> is <math>\leq_{f}\,</math> some <math>A_{\alpha}\,</math>. (For otherwise if <math>B\in\mathcal{P}(\kappa)\,</math> is not <math>\leq_{f}\,</math> some <math>A_{\alpha}</math>, then since the order is total <math>(\forall{\alpha<\kappa^{+}})A_{\alpha}\leq_{f} B\,</math>; implying <math>B\,</math> has <math>\geq\kappa^{+}>\kappa\,</math> many predecessors; a contradiction.) Thus we may well-define a map <math>g:\mathcal{P}(\kappa)\to\kappa^{+}\,</math> by <math>B\mapsto\operatorname{min}\{\alpha<\kappa^{+}:B\in f(A_{\alpha})\}</math>. So <math>\mathcal{P}(\kappa)=\bigcup_{\alpha<\kappa^{+}}g^{-1}\{\alpha\}=\bigcup_{\alpha<\kappa^{+}}f(A_{\alpha})\,</math> which is union of <math>\kappa^{+}\,</math> many sets each of size <math>\leq\kappa\,</math>. Hence <math>2^{\kappa}\leq\kappa^{+}\cdot\kappa=\kappa^{+}\,</math>. {{NumBlk|1=|2=|3=<math>\blacksquare</math> (Claim)|RawN=.}} Note that <math>|[0,1]|=|\mathcal{P}(\aleph_{0})|\,</math> so we can easily rearrange things to obtain that <math>\neg\texttt{CH}\Leftrightarrow\,</math> the above-mentioned form of Freiling's axiom. The above can be made more precise: <math>\texttt{ZF}\vdash(\texttt{AC}_{\mathcal{P}(\kappa)}+\neg\texttt{AX}_{\kappa})\leftrightarrow \texttt{CH}_{\kappa}\,</math>. This shows (together with the fact that the continuum hypothesis is independent of choice) a precise way in which the (generalised) continuum hypothesis is an extension of the axiom of choice. ==Objections to Freiling's argument== Freiling's argument is not widely accepted because of the following two problems with it (which Freiling was well aware of and discussed in his paper). * The naive probabilistic intuition used by Freiling [[tacit assumption|tacitly assumes]] that there is a well-behaved way to associate a probability to any subset of the reals. But the mathematical formalization of the notion of ''[[probability]]'' uses the notion of [[Measure (mathematics)|measure]], yet the axiom of choice implies the existence of non-measurable subsets, even of the unit interval. Some examples of this are the [[Banach–Tarski paradox]] and the existence of [[Vitali set]]s. *A minor variation of his argument gives a contradiction with the axiom of choice whether or not one accepts the continuum hypothesis, if one replaces countable additivity of probability by additivity for cardinals less than the continuum. (Freiling used a similar argument to claim that [[Martin's axiom]] is false.) It is not clear why Freiling's intuition should be any less applicable in this instance, if it applies at all. {{harv|Maddy|1988|p=500}} So Freiling's argument seems to be more an argument against the possibility of well ordering the reals than against the continuum hypothesis. ==Connection to graph theory== Using the fact that in ZFC, we have <math>2^{\kappa}=\kappa^{+}\Leftrightarrow\neg\texttt{AX}_{\kappa}\,</math> (see [[Freiling's axiom of symmetry#Relation to the (Generalised) Continuum Hypothesis|above]]), it is not hard to see that the ''failure'' of the axiom of symmetry — and thus the success of <math>2^{\kappa}=\kappa^{+}\,</math> — is equivalent to the following combinatorial principle for graphs: :* The [[complete graph]] on <math>\mathcal{P}(\kappa)\,</math> can be so directed, that every node leads to at most <math>\kappa\,</math>-many nodes. In the case of <math>\kappa=\aleph_{0}\,</math>, this translates to: :* The complete graph on the unit circle (or any set of the same size as the reals) can be so directed, that every node has a path to at most countably-many nodes. Thus in the context of ZFC, the failure of a Freiling axiom is equivalent to the existence of a specific kind of choice function. ==References== {{refbegin}} *{{citation | last = Freiling | first = Chris | author-link = Chris Freiling | doi = 10.2307/2273955 | issue = 1 | journal = [[Journal of Symbolic Logic]] | jstor = 2273955 | mr = 830085 | pages = 190–200 | title = Axioms of symmetry: throwing darts at the real number line | volume = 51 | year = 1986}} *{{citation | last = Maddy | first = Penelope | author-link = Penelope Maddy | doi = 10.2307/2274520 | issue = 2 | journal = [[Journal of Symbolic Logic]] | jstor = 2274520 | mr = 947855 | pages = 481–511 | title = Believing the axioms. I | volume = 53 | year = 1988}} *{{citation | last = Mumford | first = David | author-link = David Mumford | editor1-last = V. Arnold | editor1-first = P. Lax | editor2-last = B. Mazur | editor2-first = M. Atiyah | contribution = The dawning of the age of stochasticity | location = Providence, Rhode Island | mr = 1754778 | pages = 197–218 | publisher = American Mathematical Society | title = Mathematics: Frontiers and Perspectives | year = 2000}} *{{citation | last = Sierpiński | first = Wacław | author-link = Wacław Sierpiński | location = New York, N. Y. | mr = 0090558 | publisher = Chelsea Publishing Company | title = Hypothèse du continu | year = 1956 | orig-year = 1934}} *{{citation | last = Simms | first = John C. | doi = 10.1007/BF00274068 | issue = 3 | journal = [[Journal of Philosophical Logic]] | mr = 1008850 | pages = 275–314 | title = Traditional Cavalieri principles applied to the modern notion of area | volume = 18 | year = 1989}} {{refend}} [[Category:Axioms of set theory]] [[Category:Thought experiments]]
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Templates used on this page:
Template:Citation
(
edit
)
Template:Harv
(
edit
)
Template:NumBlk
(
edit
)
Template:Refbegin
(
edit
)
Template:Refend
(
edit
)
Template:Short description
(
edit
)
Search
Search
Editing
Freiling's axiom of symmetry
Add topic