How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Ideal Tukey morphisms control additivity and cofinality
Statement
Let be a set and let be proper ideals: each contains , is closed under taking subsets, and does not contain . Let and be defined for a family of subsets of by the minimum clauses of Add, cov, non and cof for null and meagre ideals, and . Assume these minima exist for both and ; equivalently for additivity, each family has a subfamily whose union lies outside it. Suppose and are functions satisfying
Then and . The same two inequalities hold in the weaker form in which and are inclusion-cofinal subfamilies (every member of is contained in a member of , and similarly for ) and the morphism is given only between and , with the Axiom of Choice available to extend it.
The relevant instances are on the real line and their coded cofinal subfamilies on Cantor space; the inequalities are used below in exactly the direction displayed, with no reversal.
Facts & Assumptions
Given: A set , proper ideals , functions and with the displayed property, and the attained and minima for both families as assumed in the Statement.
For a family of subsets of , is the least cardinality of a subfamily of whose union is not in , and is the least cardinality of an inclusion-cofinal subfamily of ; for and the two minima exist and are attained. (Add, cov, non and cof for null and meagre ideals)
The Axiom of Choice supplies a choice function for every family of nonempty sets, and under it every set has a cardinality and cardinalities are cardinals. (The Axiom of Choice, A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used, Cardinal (initial ordinal) and cardinality)
Proof
If and is a family of members of , then : otherwise that subfamily would be a subfamily of of cardinality at most whose union is not in , and its cardinality would be a candidate in the minimum defining strictly below that minimum.
: let be inclusion-cofinal in with . For every , cofinality of gives some with , and the displayed morphism property gives . Thus the image is inclusion-cofinal without simultaneously selecting a witness for each , and .
: let and let be a family of members of ; by step 1.1 the set is a member of , and gives for every by the displayed property, so ; since and is closed under subsets, . Hence no subfamily of of size below has its union outside , and the minimum clause for gives .
The cofinal-subfamily form: assume and are inclusion-cofinal and that , satisfy the displayed property there. By [F2] choose for every a member with and for every a member with , and put and ; if for , , then with and , so the cofinal-subfamily property gives and hence ; thus and satisfy the hypotheses of steps 2.1 and 1.2, which give and .
Steps 2.1 and 1.2 prove the two inequalities for a morphism defined on the full ideals without a simultaneous witness selection, and step 3.1 transfers them to morphisms defined only on inclusion-cofinal subfamilies, with the Axiom of Choice used for the two selections in step 3.1; the cardinal minima themselves are interpreted in ZFC. This is the statement. ∎
Depends on
- Add, cov, non and cof for null and meagre ideals
- The Axiom of Choice
- Cardinal (initial ordinal) and cardinality
- A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used
- Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation $\kappa^{\lambda}$, and why they are written apart from the ordinal operations
Used by
Dependency tree · two levels
36 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Tomek Bartoszynski, Invariants of Measure and Category, Lemma 2.2 and the surrounding Tukey discussion, printed pp.2-3 (standard reference, not scraped)