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.
Directed progressive products have club continuous chains
Statement
Assume AC. Let be a set of infinite regular cardinals, a proper ideal on , and an infinite regular cardinal such that is -directed: every family of fewer than elements has a weak upper bound. For any prescribed in there is a strictly increasing in such that for every and .
For every uncountable regular satisfying and , this same chain has . If is infinite and , it has the corresponding bounding-projection property. More generally, whenever its projection property holds and , it has a unique exact upper bound modulo , with the coordinate-cofinality bounds of the exact-bound lemma for each additional eligible . These latter conclusions apply, in particular, whenever an eligible exists.
Facts & Assumptions
Given: The product, proper ideal, regular , directedness and prescribed family in the statement. Coordinate values in are strictly below their indexing cardinal.
Reduced-product comparisons compose, including mixed weak/strict comparisons, and coordinate cofinal enumerations preserve true cofinality (Progressive products and true cofinality transfers).
Club continuity at cofinality gives for an arbitrary proper ideal on an infinite set (Club continuity produces strongly increasing subsequences).
For infinite and regular , implies the bounding-projection property (Strongly increasing subsequences force a bounding projection).
For infinite , regular and the projection property give a unique exact bound; additional regular projection properties give (Bounding projections produce an exact upper bound with large coordinate cofinalities).
A subset of a limit ordinal smaller than its cofinality is bounded, and a cofinal subset of size its cofinality exists (; 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, (c)–(d)).
A specified transfinite rule recurses on a well-order (Transfinite recursion).
AC fixes choices from nonempty witness sets (The Axiom of Choice).
Proof
Properness implies , and the product is nonempty because it contains the zero function. Every is a limit ordinal, so for . If weakly bounds a family, strictly bounds it, by the coordinate inequality and F1. AC fixes a choice function on the nonempty subsets of the set , hence specifies one bound whenever directedness supplies a nonempty bound set. For every nonzero limit also fix a club of order type : continuously enumerate a cofinal subset from F5, keeping successor values increasing and taking suprema at limits, as authorized by F6. Intermediate suprema stay below by F5; its continuous range is the required club. AC selects the initial cofinal enumerations simultaneously.
Define by recursion. Set . At every , the earlier family has size at most ; directedness and step 1.1 provide a specified weak bound . At a successor set . At a limit whose cofinality is for an eligible uncountable regular , set
At other nonzero limits put . The special rule is unambiguous because distinct cardinals have distinct double successors. For its large coordinates , so F5 gives . The other coordinates have value zero. Thus each rule gives a member of , and the choices in step 1.1 make it a specified F6 recursion. [step 1.1, F5, F6]
For every , ; hence F1 gives . At successors the explicit maximum gives at every coordinate, not just modulo . Fix any eligible . At every of cofinality the special rule was used, and for all . The possible failures lie in the assumed -small set of remaining coordinates. This proves precisely the club-continuity premise, with the bound index equal to . If is infinite, F2 gives . If is finite, let be the union of all sets in ; this finite union belongs to , and . Every strict comparison holds at every . Thus the entire chain is strongly increasing with the constant witness , and every unbounded subset of regular has an order-type- subset by choosing successive least larger indices, using F5–F6 at limits. Hence also holds in the finite case.
Suppose is infinite and put . For each eligible , step 3.1 and F3 give the projection property. If the projection property holds and , F4 gives the stated exact bound and all its coordinate-cofinality conclusions. In particular, if an eligible exists, restrict each strong order-type- subsequence supplied in step 3.1 to its first terms. This proves ; is regular by F7, so F3 gives its projection property. Also . Thus every hypothesis of F4 holds. The strict chain and prescribed domination were already proved in step 3.1, with no eligible needed for that construction. QED.
Depends on
- Progressive products and true cofinality transfers
- Club continuity produces strongly increasing subsequences
- Strongly increasing subsequences force a bounding projection
- Bounding projections produce an exact upper bound with large coordinate cofinalities
- The Axiom of Choice
- $\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
- Commutativity, associativity, distributivity and monotonicity of $\oplus$ and $\otimes$, the unit laws, the two exponent laws, and $\kappa \le \lambda$ if and only if $\kappa$ injects into $\lambda$
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
Used by
Dependency tree · two levels
47 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, Theorem 2.21 pp. 23–24; Lemma 2.19 pp. 21–23; Theorem 2.15 pp. 18–20 (standard reference, not scraped)