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.
Regressive injections on nonreflecting sets of cardinals
Statement
In ZFC let A be a set of infinite cardinals. Suppose that for every uncountable regular cardinal rho there is a club in rho disjoint from A intersect rho. Then there is an injective ordinal-valued function g on A such that for every alpha in A. The ordinal omega is allowed in A; it needs no stationarity hypothesis at omega.
Facts & Assumptions
Given: ZFC. Supremum induction with a fully proved cardinal-preserving ordinal pairing handles successor, singular and regular-limit cases; endpoint indices use a separate pairing coordinate and interval shifts preserve cardinal regressiveness.
Cofinality , and regular and singular cardinals: A singular cardinal has a cofinal sequence of length strictly below it; regularity bounds shorter sequences.
Closed unbounded subsets of ordinals: Club closure includes nonzero limit accumulation points, and unboundedness supplies gap endpoints.
Transfinite recursion: Transfinite recursion and induction organize cofinal sequences and the supremum induction.
The Axiom of Choice: AC chooses the set family of interval injections supplied by induction and cardinal enumerations.
Proof
We need an ordinal pairing that preserves every infinite cardinal. Order all ordinal pairs by their maximum coordinate, then lexicographically, and let p(a,b) be the order type of the predecessors of (a,b). Each predecessor collection is a set and this is a well-order, so p is definable and injective. For every infinite cardinal lambda and a,b<lambda, p(a,b)<lambda. To verify the size bound, induct on infinite cardinals theta: each proper initial segment of this order on theta squared is contained in (gamma+1) squared for some gamma<theta. By induction at the smaller cardinal |gamma+1|, or finite counting, that segment has cardinality below theta. Thus its order type is below theta, and the whole order has type at most theta (otherwise its first theta elements form a proper segment of size theta). The diagonal gives the reverse cardinal bound. This simultaneously proves the square bound and the asserted preservation for p. We will use b=0 or 1.
Induct on the cardinal . Every subset used below inherits the disjoint-club hypothesis. If A is empty, use the empty function. If gamma=omega, A={omega} and g(omega)=0 works. If gamma is a successor cardinal lambda-plus, then gamma belongs to A and A without gamma has supremum at most lambda. Apply induction there; all its values are below lambda, even if lambda belongs to A. Extend by assigning gamma the value lambda. This remains injective and regressive.
Suppose gamma is a singular limit cardinal and put delta=cf(gamma)<gamma. Choose a strictly increasing continuous cofinal sequence of infinite cardinals in gamma with mu_0>delta. Such a sequence is obtained from a cofinal sequence by choosing larger cardinals at successors and taking suprema at nonzero limits; at fewer than delta stages the supremum is below gamma by the definition of cofinality. The cardinals in A below mu_0, and those in each open interval (mu_xi,mu_(xi+1)), have supremum below gamma, so induction and F4 supply regressive injections on each piece. For the bottom piece use its injection unchanged. On an interval with lower endpoint mu_xi replace its injection f by . This is injective because ordinal addition is strictly increasing in its right argument, has values at least mu_xi, and is still below alpha: both summands have cardinality below the infinite cardinal alpha, and their finite sum does too by step 1.1. Distinct pieces now have disjoint ranges. Call their combined injection h.
The remaining elements of A in the singular case are sequence endpoints mu_xi and possibly gamma. Give an endpoint mu_xi its index xi, and gamma, if present, index delta. These indices are distinct and below mu_0, hence below their respective arguments. Map endpoints to p(index,0), and every nonendpoint alpha to p(h(alpha),1). Step 1.1 makes each value below its infinite-cardinal argument, and injectivity of p separates endpoints from gaps as well as separating within each part. Continuity of the sequence ensures this partition exhausts A: if alpha is neither an endpoint nor below mu_0, the least sequence value above alpha cannot have a limit index.
Finally suppose gamma is an uncountable regular limit cardinal. The hypothesis gives a club C in gamma disjoint from A intersect gamma. Enumerate C continuously in its increasing order, of length gamma; a shorter cofinal enumeration would contradict regularity. Partition A intersect gamma into the portion below min(C) and the open gaps between successive C elements. Closure ensures no other elements of A remain at limit accumulation points. Each piece has supremum below gamma, so induction and F4 give local injections. Shift an interval injection by its lower endpoint exactly as in step 3.1; leave the bottom injection unchanged. Their disjoint ranges yield a regressive injection h on A intersect gamma. Map these alpha to p(h(alpha),1), and, if gamma belongs to A, map gamma to p(0,0). Step 1.1 proves regressiveness and injectivity, including separation of the possible top endpoint. These cases exhaust infinite cardinals gamma and complete the induction.
Depends on
Used by
Dependency tree · two levels
14 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
- Monk Lemma 17.25 p.362 (standard reference, not scraped)