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.
Strongly increasing subsequences force a bounding projection
Statement
Assume AC. Let be a proper ideal on an infinite set of cardinality . Let and be regular cardinals with , and let be strictly increasing modulo . If it has , it has the bounding-projection property. In particular this applies to countably infinite , the finite ideal, and every uncountable regular .
Facts & Assumptions
Given: The sequence, ideal, cardinals, AC and of the statement; nonempty ordinal sets of size less than such that every , where .
Strong increase, , projections and the bounding-projection property have the explicit meanings in Strong increase and bounding projections in countable ordinal products.
A subset of a regular cardinal with smaller cardinality is bounded, by the cofinality lower bound (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained, clause (d)).
A fixed rule on a well-order yields a function by transfinite recursion (Transfinite recursion).
AC gives choices from nonempty witness sets (The Axiom of Choice).
Proof
Write for the projection of . It suffices to rule out the assumption that none strictly bounds the sequence. Under that assumption, for each let be the least index for which is -positive, since fails. Take to be the least index greater than and . Outside the small failure set for , the set witnesses , so remains positive. Removing a small set cannot destroy positivity: otherwise its union with the removed set would put in . Every later index has the same positive comparison, by composition with another strict comparison and the same finite-union argument. No completeness of is used.
Recursively choose strictly increasing indices for so that whenever . At each stage the earlier indices and witness indices form a set of cardinality less than , so F2 bounds them below ; choose the least larger index. F3 gives the sequence. Its range is unbounded, because a bounded subset of the cardinal has cardinality less than and cannot contain a strictly increasing sequence of length . By step 1.1, is positive for all in . Apply to obtain indices in and strong-increase witnesses .
Put . For each , the positive set remains positive after removing . Here because is infinite regular. In particular the remaining set is nonempty; AC selects a coordinate in it. Some fixed is selected for many indices. Indeed, if every fiber had size less than , it would be bounded in by F2; there are such bounds, so F2 would bound their union, contradicting that the fibers cover .
Let have size . For in , the chosen coordinate gives . If the next comparison is equality; otherwise strong increase gives , since . Finally , so the genuine ceiling rule gives . Also . Hence is a strictly increasing injection of into , contradicting . The assumption in step 1.1 is impossible. For every admitted family some projection therefore strictly bounds the sequence, exactly the asserted property. The finite-ideal countable case satisfies all these hypotheses with . QED.
Depends on
- Strong increase and bounding projections in countable ordinal products
- $\operatorname{cf}(\alpha) \le \alpha$; $\operatorname{cf}(0) = 0$ and $\operatorname{cf}(\alpha + 1) = 1$; for a limit ordinal $\lambda$ the value $\operatorname{cf}(\lambda)$ is an infinite cardinal with $\operatorname{cf}(\operatorname{cf}(\lambda)) = \operatorname{cf}(\lambda)$, so it is regular; and every cofinal subset of $\lambda$ has cardinality at least $\operatorname{cf}(\lambda)$, a value that is attained
- Transfinite recursion
- The Axiom of Choice
Used by
- Directed progressive products have club continuous chains Lemma
- Universal pcf sequences have strong increase and exact bounds Lemma
- An aleph omega plus one scale on an infinite set of successor alephs Theorem
- Pcf has no holes for progressive intervals Theorem
- Pcf ideal directedness and ultrafilter cofinality cutoffs Theorem
Dependency tree · two levels
27 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
- Abraham and Magidor, Cardinal Arithmetic, Lemma 2.12 and complete proof, p. 16 (standard reference, not scraped)