Stability (learning theory): Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Tdh1950
mNo edit summary
 
en>FrescoBot
m Bot: standard sections headers and minor changes
Line 1: Line 1:
Hi, everybody! <br>I'm Turkish male ;=). <br>I really love Australian Football League!<br><br>Also visit my web site :: [https://www.youtube.com/watch?v=P4D2qfNSSaQ profit in 60 seconds download]
In the mathematical discipline of [[set theory]], a '''cardinal characteristic of the continuum''' is an infinite [[cardinal number]] that may consistently lie strictly between [[Aleph null|<math>\aleph_0</math>]] (the [[cardinality]] of the set of [[natural number]]s), and the [[cardinality of the continuum]], that is, the cardinality of the set <math>\mathbb R</math> of all [[real number]]s.  The latter cardinal is denoted <math>2^{\aleph_0}</math> or <math>\mathfrak c</math>. A variety of such cardinal characteristics arise naturally, and much work has been done in determining what relations between them are provable, and constructing models of set theory for various [[consistency|consistent]] configurations of them.
 
== Background ==
 
[[Cantor's diagonal argument]] shows that <math>\mathfrak c</math> is strictly greater than <math>\aleph_0</math>, but it does not specify whether it is the ''least'' cardinal greater than <math>\aleph_0</math> (that is, <math>\aleph_1</math>). Indeed the assumption that <math>\mathfrak c=\aleph_1</math> is the well-known [[Continuum Hypothesis]], which was shown to be independent of the standard [[Zermelo–Fraenkel set theory|ZFC]] axioms for set theory by [[Paul Cohen (mathematician)|Paul Cohen]].  If the Continuum Hypothesis fails and so <math>\mathfrak c</math> is at least <math>\aleph_2</math>, natural questions arise about the cardinals strictly between <math>\aleph_0</math> and <math>\mathfrak c</math>, for example regarding Lebesgue measurability.  By considering the least cardinal with some property, one may get a definition for an uncountable cardinal that is consistently less than <math>\mathfrak c</math>.  Generally one only considers definitions for cardinals that  are provably greater than <math>\aleph_0</math> and at most <math>\mathfrak c</math> as cardinal characteristics of the continuum, so if the Continuum Hypothesis holds they are all equal to <math>\aleph_1</math>.
 
== Examples ==
 
As is standard, we denote by <math>\omega</math> the least infinite [[Ordinal number|ordinal]], which has cardinality <math>\aleph_0</math> and may be identified with the set of all natural numbers.
 
A number of cardinal characteristics naturally arise as [[Cardinal function|cardinal invariants]] for [[Ideal (set theory)|ideals]] which are closely connected with the structure of the reals, such as the ideal of [[Null set#Lebesgue measure|Lebesgue null sets]] and the ideal of [[meagre set]]s.
 
=== non(N) ===
 
The cardinal characteristic non(<math>\mathcal N</math>) is the least cardinality of a [[non-measurable set]]; equivalently, it is the least cardinality of a set that is not a [[Null set#Lebesgue measure|Lebesgue null set]].
 
===Bounding number <math>\mathfrak b</math> and dominating number <math>\mathfrak d</math>===
 
We denote by <math>\omega^\omega</math> the set of functions from <math>\omega</math> to <math>\omega</math>. For any two functions <math>f:\omega\to\omega</math> and <math>g:\omega\to\omega</math> we denote by <math>f\leq^*g</math> the statement that for all but finitely many <math>n\in\omega, f(n)\leq g(n)</math>. The bounding number <math>\mathfrak b</math> is the least cardinality of an unbounded set in this relation, that is, <math>\mathfrak b = \min(\{|F| : F\subseteq\omega^\omega\land\forall f:\omega\to\omega\exists g\in F(g\nleq^*f)\}).</math>
 
The dominating number <math>\mathfrak d</math> is the least cardinality of a set of functions from <math>\omega</math> to <math>\omega</math> such that every such function is dominated by (that is, <math>\leq^*</math>) a member of that set, that is,
<math>\mathfrak d = \min(\{|F| : F\subseteq\omega^\omega\land\forall f:\omega\to\omega\exists g\in F(f\leq^*g)\}).</math>
 
Clearly any such dominating set <math>F</math> is unbounded, so <math>\mathfrak b</math> is at most <math>\mathfrak d</math>, and a diagonalisation argument shows that <math>\mathfrak b>\aleph_0</math>. Of course if <math>\mathfrak c=\aleph_1</math> this implies that <math>\mathfrak b=\mathfrak d=\aleph_1</math>, but Hechler<ref>Stephen Hechler. On the existence of certain cofinal subsets of <math>{}^\omega\omega</math>. In T. Jech (ed), ''Axiomatic Set Theory, Part II.'' Volume 13(2) of ''Proc. Symp. Pure Math.'', pp&nbsp;155–173. American Mathematical Society, 1974</ref> has shown that it is also consistent to have <math>\mathfrak b</math> strictly less than <math>\mathfrak d</math>.
 
=== Splitting number <math>\mathfrak s</math> and reaping number <math>\mathfrak r</math> ===
 
We denote by <math>[\omega]^\omega</math> the set of all infinite subsets of <math>\omega</math>. For any <math>a,b\in[\omega]^\omega</math>, we say that <math>a</math> ''splits'' <math>b</math> if both <math>b\cap a</math> and <math>b\setminus a</math> are infinite. The ''splitting number'' <math>\mathfrak s</math> is the least cardinality of a subset <math>S</math> of <math>[\omega]^\omega</math> such that for all <math>b\in[\omega]^\omega</math>, there is some <math>a\in S</math> such that <math>a</math> splits <math>b</math>.  That is, <math>\mathfrak s = \min(\{|S| : S\subseteq[\omega]^\omega\land\forall b\in[\omega]^\omega\exists a\in S(|b\cap a|=\aleph_0\land |b\setminus a|=\aleph_0)\}).</math>
 
The ''reaping number'' <math>\mathfrak r</math> is the least cardinality of a subset <math>R</math> of <math>[\omega]^\omega</math> such that no element <math>a</math> of <math>[\omega]^\omega</math> splits every element of <math>R</math>. That is, <math>\mathfrak r = \min(\{|R| : R\subseteq[\omega]^\omega\land\forall a\in[\omega]^\omega\exists b\in R(|b\cap a|<\aleph_0\lor|b\setminus a|<\aleph_0)\}).</math>
 
===Ultrafilter number <math>\mathfrak u</math>===
 
The ultrafilter number <math>\mathfrak u</math> is defined to be the least cardinality of a [[Filter base#Filter on a set|filter base]] of an [[ultrafilter]] on <math>\omega</math>. Kunen<ref>[[Kenneth Kunen]]. ''Set Theory An Introduction to Independence Proofs''. Studies in Logic and the Foundations of Mathematics vol. 102, Elsevier, 1980</ref> gave a model of set theory
in which <math>\mathfrak u=\aleph_1</math> but <math>\mathfrak c=\aleph_{\aleph_1}</math>, and using a [[countable support iteration]] of [[List of forcing notions#Sacks forcing|Sacks forcings]], Baumgartner and Laver<ref>[[James Earl Baumgartner]] and [[Richard Laver]]. Iterated perfect-set forcing. ''Annals of Mathematical Logic'' '''17''' (1979) pp 271–288.</ref>
demonstrated a model in which <math>\mathfrak u=\aleph_1</math> and <math>\mathfrak c=\aleph_2</math>.
 
===Almost disjointness number <math>\mathfrak{a}</math>===
 
Two subsets <math>A</math> and <math>B</math> of <math>\omega</math> are said to be ''almost disjoint'' if <math>|A\cap B|</math> is finite, and a family of subsets of <math>\omega</math> is said to be almost disjoint if its members are pairwise almost disjoint.  A ''maximal almost disjoint'' (mad) family of subsets of <math>\omega</math> is thus an almost disjoint family <math>\mathcal{A}</math>
such that for every subset <math>X</math> of <math>\omega</math>, there is a set <math>A\in\mathcal{A}</math> such that <math>A</math> and <math>X</math> are not almost disjoint
(that is, their intersection is infinite).  The almost disjointness number <math>\mathfrak{a}</math> is the least cardinality of an infinite maximal almost disjoint family.
A basic result<ref>[[Eric van Douwen]]. The Integers and Topology. In K. Kunen and J.E. Vaughan (eds) ''Handbook of Set-Theoretic Topology.  North-Holland, Amsterdam, 1984.</ref> is that
<math>\mathfrak{b}\leq\mathfrak{a}</math>; Shelah<ref>[[Saharon Shelah]]. On cardinal invariants of the continuum. In J. Baumgartner, D. Martin and S. Shelah (eds) ''Axiomatic Set Theory'', Contemporary Mathematics 31, American Mathematical Society, 1984, pp 183-207.</ref> showed that it is consistent to have the strict inequality <math>\mathfrak{b}<\mathfrak{a}</math>.
 
== Cichoń's diagram ==
 
A well known diagram of cardinal characteristics is [[Cichoń's diagram]], showing all relations provable in [[Zermelo–Fraenkel set theory|ZFC]] between 10 cardinal characteristics.
 
== References ==
{{Reflist}}
 
== Further reading ==
* [[Tomek Bartoszyński]] and Haim Judah.  ''Set Theory On the Structure of the Real Line''.  A K Peters, 1995.
*{{cite book | last = Vaughan | first = Jerry E. | chapter = Chapter 11: Small uncountable cardinals and topology | editor1-last = van Mill | editor1-first = Jan | editor2-last = Reed | editor2-first = George M. | title = Open Problems in Topology | pages = 196–218 | year = 1990 | publisher = [[North-Holland Publishing Company]] | location = Amsterdam | isbn = 0-444-88768-7 | url = http://www.uncg.edu/~vaughanj/Publications/smallcd.pdf | format = PDF | accessdate = December 5, 2011}}
*{{cite book | last = Blass | first = Andreas | authorlink = Andreas Blass | chapter = Chapter 6 : Combinatorial Cardinal Characteristics of the Continuum | editor1-last = Foreman | editor1-first = Matthew | editor1-link = Matthew Foreman | editor2-last = Kanamori | editor2-first = Akihiro | editor2-link = Akihiro Kanamori | title = Handbook of Set Theory | volume = 1 | pages = 395–490 | date = January 12, 2010 | publisher = [[Springer Science+Business Media|Springer]] | isbn = 1-4020-4843-2 | url = http://www.math.lsa.umich.edu/~ablass/hbk.pdf | format = PDF | accessdate = December 5, 2011}}
*{{cite book | last = Bartoszyński | first = Tomek | chapter = Chapter 7 : Invariants of Measure and Category | editor1-last = Foreman | editor1-first = Matthew | editor2-last = Kanamori | editor2-first = Akihiro | title = Handbook of Set Theory | volume = 1 | pages = 491–556 | date = January 12, 2010 | publisher = Springer | isbn = 1-4020-4843-2 | arxiv = math.LO/9910015}}
 
[[Category:Cardinal numbers]]

Revision as of 14:40, 26 February 2013

In the mathematical discipline of set theory, a cardinal characteristic of the continuum is an infinite cardinal number that may consistently lie strictly between 0 (the cardinality of the set of natural numbers), and the cardinality of the continuum, that is, the cardinality of the set of all real numbers. The latter cardinal is denoted 20 or c. A variety of such cardinal characteristics arise naturally, and much work has been done in determining what relations between them are provable, and constructing models of set theory for various consistent configurations of them.

Background

Cantor's diagonal argument shows that c is strictly greater than 0, but it does not specify whether it is the least cardinal greater than 0 (that is, 1). Indeed the assumption that c=1 is the well-known Continuum Hypothesis, which was shown to be independent of the standard ZFC axioms for set theory by Paul Cohen. If the Continuum Hypothesis fails and so c is at least 2, natural questions arise about the cardinals strictly between 0 and c, for example regarding Lebesgue measurability. By considering the least cardinal with some property, one may get a definition for an uncountable cardinal that is consistently less than c. Generally one only considers definitions for cardinals that are provably greater than 0 and at most c as cardinal characteristics of the continuum, so if the Continuum Hypothesis holds they are all equal to 1.

Examples

As is standard, we denote by ω the least infinite ordinal, which has cardinality 0 and may be identified with the set of all natural numbers.

A number of cardinal characteristics naturally arise as cardinal invariants for ideals which are closely connected with the structure of the reals, such as the ideal of Lebesgue null sets and the ideal of meagre sets.

non(N)

The cardinal characteristic non(𝒩) is the least cardinality of a non-measurable set; equivalently, it is the least cardinality of a set that is not a Lebesgue null set.

Bounding number b and dominating number d

We denote by ωω the set of functions from ω to ω. For any two functions f:ωω and g:ωω we denote by f*g the statement that for all but finitely many nω,f(n)g(n). The bounding number b is the least cardinality of an unbounded set in this relation, that is, b=min({|F|:Fωωf:ωωgF(g*f)}).

The dominating number d is the least cardinality of a set of functions from ω to ω such that every such function is dominated by (that is, *) a member of that set, that is, d=min({|F|:Fωωf:ωωgF(f*g)}).

Clearly any such dominating set F is unbounded, so b is at most d, and a diagonalisation argument shows that b>0. Of course if c=1 this implies that b=d=1, but Hechler[1] has shown that it is also consistent to have b strictly less than d.

Splitting number s and reaping number r

We denote by [ω]ω the set of all infinite subsets of ω. For any a,b[ω]ω, we say that a splits b if both ba and ba are infinite. The splitting number s is the least cardinality of a subset S of [ω]ω such that for all b[ω]ω, there is some aS such that a splits b. That is, s=min({|S|:S[ω]ωb[ω]ωaS(|ba|=0|ba|=0)}).

The reaping number r is the least cardinality of a subset R of [ω]ω such that no element a of [ω]ω splits every element of R. That is, r=min({|R|:R[ω]ωa[ω]ωbR(|ba|<0|ba|<0)}).

Ultrafilter number u

The ultrafilter number u is defined to be the least cardinality of a filter base of an ultrafilter on ω. Kunen[2] gave a model of set theory in which u=1 but c=1, and using a countable support iteration of Sacks forcings, Baumgartner and Laver[3] demonstrated a model in which u=1 and c=2.

Almost disjointness number a

Two subsets A and B of ω are said to be almost disjoint if |AB| is finite, and a family of subsets of ω is said to be almost disjoint if its members are pairwise almost disjoint. A maximal almost disjoint (mad) family of subsets of ω is thus an almost disjoint family 𝒜 such that for every subset X of ω, there is a set A𝒜 such that A and X are not almost disjoint (that is, their intersection is infinite). The almost disjointness number a is the least cardinality of an infinite maximal almost disjoint family. A basic result[4] is that ba; Shelah[5] showed that it is consistent to have the strict inequality b<a.

Cichoń's diagram

A well known diagram of cardinal characteristics is Cichoń's diagram, showing all relations provable in ZFC between 10 cardinal characteristics.

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

Further reading

  • Tomek Bartoszyński and Haim Judah. Set Theory On the Structure of the Real Line. A K Peters, 1995.
  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  • 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  1. Stephen Hechler. On the existence of certain cofinal subsets of ωω. In T. Jech (ed), Axiomatic Set Theory, Part II. Volume 13(2) of Proc. Symp. Pure Math., pp 155–173. American Mathematical Society, 1974
  2. Kenneth Kunen. Set Theory An Introduction to Independence Proofs. Studies in Logic and the Foundations of Mathematics vol. 102, Elsevier, 1980
  3. James Earl Baumgartner and Richard Laver. Iterated perfect-set forcing. Annals of Mathematical Logic 17 (1979) pp 271–288.
  4. Eric van Douwen. The Integers and Topology. In K. Kunen and J.E. Vaughan (eds) Handbook of Set-Theoretic Topology. North-Holland, Amsterdam, 1984.
  5. Saharon Shelah. On cardinal invariants of the continuum. In J. Baumgartner, D. Martin and S. Shelah (eds) Axiomatic Set Theory, Contemporary Mathematics 31, American Mathematical Society, 1984, pp 183-207.