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.
A scale used in the Dowker subspace
Example
Assume AC and fix the normalized scale on its infinite coordinate set . Starting above the concrete bound , the recursion below produces an actual point with at every coordinate. The same calculation works for any prescribed upon replacing the initial value by .
Facts & Assumptions
Given: and the normalized scale ; initially .
The scale is strictly eventually increasing and cofinal, and Rudin points eventually equal to its terms form (Kojman-Shelah scale subspace).
Strictly increasing -long product representatives with increasing scale indices have a coordinate supremum in the product, of cofinality at each coordinate and eventually equal to a scale term (Tail suprema and normalized scales, ).
Sets smaller than a cofinality are bounded in the ordinal (; 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).
, the factors for , and 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).
Specified rules admit transfinite recursion (Transfinite recursion).
AC is assumed for regularity and the normalized-scale construction (The Axiom of Choice).
Verification
Given the earlier for , define . By F3–F4 each countable supremum is below ; thus is in the strict product. The earlier indices are countable and bounded below by F3–F4. F1 supplies a scale term strictly eventually above with index above all earlier indices, by cofinality followed by a later scale term if necessary. Let be the least eligible index and put . This is in the product, is eventually equal to , and is above every earlier pointwise. F5 now supplies the sequence by the specified rule. At stage zero, and . At stage one, and . These are the first two calculations of the instance.
Set and . The sequence in step 1.1 satisfies every hypothesis of F2, and for every , so its tail is the entire coordinate set. Therefore , , , and . The cofinalities have uniform strict bound , so is a Rudin point and F1 gives . The calculation verifies strict domination of the chosen zero bound.
For a prescribed replace in step 1.1 by . This value is below the limit cardinal , so the same countable-supremum and least-index arguments still apply. Then and the resulting supremum satisfies for every . Thus the example exhibits the actual representative construction behind pointwise cofinality, with no choice of a member from a possibly empty scale class. QED.
Depends on
- 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
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
32 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.