Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Measurable cardinal
(section)
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!
=== Weak inaccessibility of real-valued measurable cardinals === Say that a cardinal number ''α'' is an ''Ulam number'' if<ref>{{harvnb|Federer|1996|loc=Section 2.1.6}}</ref><ref group=nb>The notion in the article [[Ulam number]] is different.</ref> whenever {{NumBlk|*| ''μ'' is an [[outer measure]] on a set ''X'',|{{EquationRef|1}}}} {{NumBlk|*| ''μ''(''X'') < ∞,|{{EquationRef|2}}}} {{NumBlk|*| ''μ''({''x''}) {{=}} 0 for every ''x'' ∈ ''X,''|{{EquationRef|3}}}} {{NumBlk|*| all ''A '' ⊂ ''X'' are [[Carathéodory-measurable set|''μ''-measurable]],|{{EquationRef|4}}}} then ::if |''X''| ≤ ''α'' then ''μ''(''X'') = 0. Equivalently, a cardinal number ''α'' is an Ulam number if whenever # ''ν'' is an outer measure on a set ''Y,'' and ''F'' a set of pairwise disjoint subsets of ''Y,'' # ''ν''(⋃''F'') < ∞, # ''ν''(''A'') = 0 for ''A'' ∈ ''F,'' # ⋃''G'' is ''ν''-measurable for every ''G'' ⊂ ''F,'' then ::if |''F''| ≤ ''α'' then ''ν''(⋃''F'') = 0. The smallest infinite cardinal [[Aleph-zero|ℵ<sub>0</sub>]] is an Ulam number. The class of Ulam numbers is closed under the [[successor cardinal|cardinal successor]] operation.<ref>{{harvnb|Federer|1996|loc=Second part of theorem in section 2.1.6.}}</ref> If an infinite cardinal ''β'' has an immediate predecessor ''α'' that is an Ulam number, assume ''μ'' satisfies properties ({{EquationNote|1}})–({{EquationNote|4}}) with ''X'' = ''β.'' In the [[Ordinal number#Von Neumann definition of ordinals|von Neumann model]] of ordinals and cardinals, for each ''x'' ∈ ''β'', choose an [[injective function]] :''f''<sub>''x''</sub>: ''x'' → ''α'' and define the sets :''U''(''b, a'') = { ''x'' ∈ ''β'' | ''f''<sub>''x''</sub>(''b'') = ''a'' } Since the ''f''<sub>''x''</sub> are one-to-one, the sets :{ ''U''(''b, a'') | ''b'' ∈ ''β'' } with ''a'' ∈ ''α'' fixed :{ ''U''(''b, a'') | ''a'' ∈ ''α'' } with ''b'' ∈ ''β'' fixed are pairwise disjoint. By property ({{EquationNote|2}}) of ''μ,'' the set :{ ''b'' ∈ ''β'' | ''μ''(''U''(''b, a'')) > 0 } is [[countable set|countable]], and hence :|{ (''b, a'') ∈ ''β'' × ''α'' | ''μ''(''U''(''b, a'')) > 0 }| ≤ ℵ<sub>0</sub>⋅''α.'' Thus there is a ''b''<sub>0</sub> such that :''μ''(''U''(''b''<sub>0</sub>, ''a'')) = 0 for every ''a'' ∈ ''α'' implying, since ''α'' is an Ulam number and using the second definition (with ''ν'' = ''μ'' and conditions ({{EquationNote|1}})–({{EquationNote|4}}) fulfilled), :''μ''(⋃<sub>''a''∈''α''</sub> ''U''(''b''<sub>0</sub>, ''a'')) = 0. If ''b''<sub>0</sub> < ''x'' < ''β'' and ''f''<sub>x</sub>(''b''<sub>0</sub>) = ''a''<sub>''x''</sub> then ''x'' ∈ ''U''(''b''<sub>0</sub>, ''a''<sub>''x''</sub>). Thus :''β'' = b<sub>0</sub> ∪ {b<sub>0</sub>} ∪ ⋃<sub>''a''∈''α''</sub> ''U''(''b''<sub>0</sub>, ''a'') By property ({{EquationNote|2}}), ''μ''({''b''<sub>0</sub>}) = 0, and since |''b''<sub>0</sub>| ≤ ''α'', by ({{EquationNote|4}}), ({{EquationNote|2}}) and ({{EquationNote|3}}), ''μ''(''b''<sub>0</sub>) = 0. It follows that ''μ''(''β'') = 0. The conclusion is that ''β'' is an Ulam number. There is a similar proof<ref>{{harvnb|Federer|1996|loc=First part of theorem in section 2.1.6.}}</ref> that the supremum of a set ''S'' of Ulam numbers with |''S''| an Ulam number is again a Ulam number. Together with the previous result, this implies that a cardinal that is not an Ulam number is [[inaccessible cardinal|weakly inaccessible]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)