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.
Bounding projections produce an exact upper bound with large coordinate cofinalities
Statement
Assume AC. Let be a proper ideal on an infinite set , , and a regular cardinal. A strictly increasing sequence with the bounding-projection property has an exact upper bound , unique modulo . It has a representative with every a nonzero limit ordinal. If the sequence also has the bounding-projection property for a regular with , then
Exactness restricts to every -positive support and passes to every larger proper ideal. In particular, for countably infinite and the finite ideal, a regular length and the projection property give a unique eventual exact upper bound, with the stated cofinality bound holding outside a finite set.
Every exact bound is also a least upper bound among ordinal-valued functions modulo .
Facts & Assumptions
Given: The sequence, ideal, cardinals, AC and bounding-projection properties of the statement. Upper bounds are taken among all ordinal-valued functions on .
Projections, strict and weak comparisons, the bounding-projection property and exact upper bounds are as in Strong increase and bounding projections in countable ordinal products.
A subset of a regular cardinal with smaller cardinality is bounded; limit ordinals have cofinal subsets of cardinality their cofinality (; 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, clauses (c)–(d)).
Successor cardinals, in particular , are regular under AC ( is regular in ZF; assuming the Axiom of Choice every successor aleph is regular; , so is singular, and under choice it is the least singular infinite cardinal, clause (b)).
A specified transfinite recursion on a well-order determines a function (Transfinite recursion).
AC supplies simultaneous witnesses and choice functions on nonempty sets of witnesses (The Axiom of Choice).
Proof
Set , a pointwise strict bound. The ordinal functions form a set. Any weak upper bound strictly bounds every term: , since . If two functions are upper bounds, their pointwise minimum is also an upper bound, because outside the union of the two small exceptional sets it dominates each fixed . Thus, if an upper bound is not minimal in the weak quotient order, there is an upper bound pointwise with positive: take its minimum with a smaller quotient bound.
Suppose there were no minimal upper bound below . For recursively form increasing nonempty sets , starting with , taking unions at limits, and adjoining one value at each successor as follows. Every has size at most and contains , so its supremum is and the projection property applies. Let be the least index whose projection strictly bounds the sequence. For , its projection onto the same equals modulo : outside a small set, , and is the least value at least , so it is also the least value at least . By step 1.1 choose an upper bound pointwise, strictly smaller on a positive set, and put . AC fixes a choice function on the nonempty witness subsets of the set of functions below ; F4 then implements the recursion.
Every exact bound is a least bound. Its zero coordinates are small by . If another bound failed , the set would be positive. Define on and elsewhere. Then , the only possible failures being zero coordinates of . Exactness gives for some , while . Outside the union of those two small exception sets, a point of positive would satisfy , impossible. Hence for every bound . Two exact bounds are mutually weakly below one another and thus equal.
Regularity of and give a single above all . Put . These functions decrease pointwise because the sets of eligible projection values increase, and always remains eligible. Step 2.1 gives . Also : outside a small set the old ceiling is and by step 1.1; the only new eligible value below the old ceiling is . Thus is positive for every . AC selects a coordinate of strict decrease for each . Some coordinate is selected unboundedly often: otherwise each fiber is bounded, and the fiber bounds have bounded supremum by F2–F3, contradicting that all stages have a selected coordinate. Taking an increasing countable sequence of these stages gives an infinite strictly descending sequence of ordinals at that coordinate, since all intervening comparisons are weakly decreasing. This is impossible: the set of values of such a sequence would have a least member followed by a smaller one. Hence a minimal upper bound exists.
This is a least upper bound among all ordinal bounds. For any other bound , the minimum is a bound below by step 1.1; minimality forces it equal to modulo , hence . The zero coordinates of form a small set, since . If the successor-valued coordinates formed a positive set, replacing by its predecessor on those coordinates would give a strictly smaller bound: each by step 1.1, so there is at most that predecessor outside a small set. This contradicts minimality. Change to on its small set of zero or successor coordinates. It remains the old least bound and is now positive and limit-valued everywhere.
Given , reset to zero on its small set of coordinates with . This preserves its class and makes pointwise. The sets have size at most two, hence less than , and their supremum is . The bounding-projection property gives a projection of some that bounds the sequence. It satisfies pointwise, including any fallback, so leastness of gives . Outside the small sets where that equality fails or , the least eligible element of is ; thus there. Therefore , proving exactness.
Suppose the additional projection property holds and is positive. By F2 and AC, choose for each a cofinal subset of size less than ; off put . These sets are nonempty and have supremum , since is a nonzero limit. A bounding projection is at most everywhere and strictly less at every coordinate of , since its values, including its fallback, lie in . This contradicts leastness of . Thus . Modifying a representative on a small set does not change this conclusion.
Let be positive and let . Reset to zero on its small failure set, then extend it by zero off . The resulting function is pointwise below positive , so exactness from step 5.1 yields after extension, and restriction gives the desired comparison modulo . Upper-boundedness restricts directly, proving restricted exactness. If is a larger proper ideal and , reset to zero on the -small failure set. The reset function is everywhere below , so it is some ; restoring changes it only on a -small set, giving . Upper-boundedness also passes to , proving exactness there. With and the finite ideal, all small sets in these conclusions are finite and , giving the stated specialization. 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
- $\aleph_0$ is regular in ZF; assuming the Axiom of Choice every successor aleph $\aleph_{\alpha+1}$ is regular; $\operatorname{cf}(\aleph_\omega) = \aleph_0$, so $\aleph_\omega$ is singular, and under choice it is the least singular infinite cardinal
- 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 cofinality ideals have single generators Theorem
- Pcf has no holes for progressive intervals Theorem
- Pcf ideal directedness and ultrafilter cofinality cutoffs Theorem
Dependency tree · two levels
35 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.