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.
Neighborhoods of Rudin initial-top slices contain tails
Statement
Assume AC. For put . If is open in and , there is such that
The inequality is pointwise. The conclusion includes every point of the Rudin space above , with its own finite uniform cofinality bound; it is not restricted to one cofinality stratum.
Facts & Assumptions
Given: The stated ; write and .
For and any prescribed finite list of parameters, the internal hull lemma gives and whose tail coordinates have cofinality and are below . Each has with . If and with , then (Internally increasing hulls dominate countable tail bounds).
At a point , the boxes with form a local base (Clopen boxes and the P-space property).
Under AC, the positive finite alephs 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).
A subset of an ordinal whose size is smaller than its cofinality is bounded in it (; 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).
is transitive (Transitivity and growth of hierarchy stages).
AC supplies the hull and the countable family of local lower bounds used below (The Axiom of Choice).
Proof
If , there are no with , so and . The zero function belongs to the displayed product, and its tail in is contained in . Suppose henceforth . Apply F1 and A1 with among the parameters. The resulting contains all these objects, and . For every finite define by replacing by on and leaving it unchanged elsewhere. This point remains in : it still has the prescribed initial tops, all unchanged coordinates have cofinality at most , and its finitely many new top cofinalities are the finite alephs for , by F3. A finite bound larger than and every member of bounds all these cofinalities strictly. Thus and hence .
There are countably many finite as in step 1.1: the map takes them injectively to the natural numbers. For distinct sets, let be the greatest member of their symmetric difference. The contribution to the difference of their sums exceeds the sum of all possible smaller contributions, since (the identity follows by induction from the zero empty sum). Thus the codes differ. By F2 and A1 choose, for every such , a function with . For put
The set in braces is nonempty, since qualifies, and is countable by the coding. Each term is below , because whenever . Every has uncountable cofinality: on the tail this follows from F1, and on the initial coordinates from F3. F4 therefore gives for every . In particular . Apply F1 to obtain with . Since , every , so is in the product required by the statement. [step 1.1, F1, F2, F3, F4, A1]
Let satisfy . Set . The defining Rudin condition gives a finite with every coordinate cofinality of below . If , F3 gives , so . Hence is finite. For tail coordinates outside , and F1 yields . For coordinates in , . At initial coordinates . Thus . If , step 2.1 gives ; if , . Therefore . This treats every internal Rudin point above , including those attaining some tail tops.
Suppose there were an external with . The assertion that such a exists is true in : belong to it, every member of is in it by F5, and the conditions , and for all use only membership and bounded function-coordinate comparisons. Transitivity makes these conditions absolute, as bounded quantifiers range over all actual members of their bounds and function values are the actual entries. All their parameters belong to , by steps 1.1–2.1. Elementarity F1 therefore gives a witness in with the same actual properties, contradicting step 3.1. There is no such witness, which proves the full pointwise tail inclusion. QED.
Depends on
- Internally increasing hulls dominate countable tail bounds
- Clopen boxes and the P-space property
- $\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
- $\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
- Transitivity and growth of hierarchy stages
Used by
- A concrete Rudin slice Example
- Rudin shrinking obstruction Theorem
Dependency tree · two levels
38 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.