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.
Cofinality and size of the scale subspace
Statement
Assume AC. For every there is with pointwise. Moreover . No assertion that every normalized-scale class meets the Rudin space is required.
Facts & Assumptions
Given: The normalized scale defining . Put , , and .
The normalized scale is strictly increasing and cofinal in the eventual order on , and consists of its eventual-equality classes intersected with (Kojman-Shelah scale subspace).
A strictly pointwise increasing -sequence of product representatives of strictly increasing scale indices has, on , a supremum below each factor of cofinality , eventually equal to for (Tail suprema and normalized scales, ).
Sets of ordinals of size less than a cofinality are bounded in that 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).
Under AC , , and every finite positive aleph are regular ( 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).
Injections give cardinal inequalities for well-orderable sets (Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and if and only if injects into , (a)).
Infinite cardinal sums and nonzero products absorb smaller cardinals (Absorption: for cardinals with infinite and , , and when ).
Specified rules recurse on ordinals (Transfinite recursion).
AC is assumed for cardinal regularity and for cardinal bounds on unions of the finite-modification classes (The Axiom of Choice).
Proof
Fix . Recursively for construct indices and functions . Given the earlier choices, put . All entries in this supremum are below , since that cardinal is a limit and the earlier functions are in . The set is countable, so F3–F4 give and . The countably many earlier indices are bounded in regular by F3–F4. By F1 there is an index above them all with : first obtain eventual domination by cofinality, and if necessary pass to a larger scale index, whose strict eventual increase preserves domination. Choose the least such index and set . It belongs to , is eventually equal to , and is strictly above and every earlier at every coordinate. The exceptional modification set is contained in the finite set where . These are specified rules with proved witnesses, so F7 constructs them throughout . The initial stage uses only and has no earlier-index obligation.
Fix . Every point eventually equal to is determined by a finite exceptional set and its values in . There are countably many finite , using their binary codes . For nonempty let ; each inclusive ordinal factor has cardinality , since its extra top can be sent to zero, the finite ordinals shifted by one and the other values fixed. F6 bounds the finite product by ; for empty the product has one member. Thus the countable union of these possibilities has size at most by A1 and F6. Every class intersected with has size at most , including empty classes. There are possible indices, so again A1 and F6 give .
Apply F2 to . The indices strictly increase, the functions are actual members of , and they strictly increase pointwise by step 1.1. Since , the tail is all of . F2 gives , at every coordinate, and for some . Thus with uniform strict bound , and F1 gives . Since and , also . This proves pointwise cofinality and in particular nonemptiness.
Every has a unique scale index . Existence is F1; two different indices would force the same function to be eventually strictly less than itself outside finitely many coordinates, impossible on infinite . Suppose . By F3–F4 choose strictly above all its indices; the empty case is already excluded by step 2.1. Then for every , by F1 and each eventual equality. But step 2.1 applied to gives with pointwise, contradicting . Hence by F5 and A1.
The lower bound of step 3.1 and upper bound of step 1.2 give . Step 2.1 establishes the asserted strict pointwise cofinality. The argument only used nonempty classes when a constructed point or an already given point provided a member. QED.
Depends on
- Kojman-Shelah scale subspace
- Tail suprema and normalized scales
- $\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
- The Axiom of Choice
- $\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
- 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$
- Transfinite recursion
Used by
Dependency tree · two levels
39 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.