Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Elementary hull transfer for bounded cofinality strata

Statement

Assume AC. Let xYB, 1m<ω, and κ=m. Given finitely many set parameters, for every sufficiently large regular cardinal θ there are a set M(Vθ,) of size κ, containing those parameters and x as elements and containing every ordinal below κ, and a point x^XR(B) such that

x^(n)={x(n),cf(x(n))κ,sup(Mx(n)),cf(x(n))>κ.

In the second case cf(x^(n))=κ and x^(n)<x(n). For every ordinal function vPB with v<x^ pointwise, there is zMPB with v<z<x^ pointwise. If uMPB, ux pointwise, and cf(u(n))κ for every nB, then ux^ pointwise. No assertion that Vθ satisfies ZFC is required.

Facts & Assumptions

Given: The displayed hypotheses and finitely many parameters. All function inequalities below are pointwise.

[F1]

The ambient space has countably infinite coordinate set B; its points have uncountable coordinate cofinalities, and XR(B) imposes a uniform finite-aleph bound (The ambient Rudin box space).

[F2]

A set structure in a finite language with at least κ elements has an elementary substructure of size κ containing any specified subset of size at most κ, under AC (Downward Löwenheim–Skolem with parameters).

[F3]

A nonempty substructure is elementary exactly when every existential instance true in the larger structure with parameters from it has a witness in it (Tarski–Vaught witness test).

[F4]

Specified set-valued rules recurse along a well-order (Transfinite recursion).

[F5]

Membership in Vθ is equivalent to rank less than θ (Rank characterizes hierarchy membership).

[F6]

Vθ is transitive and contains exactly the ordinals below θ (Transitivity and growth of hierarchy stages).

[A1]

AC permits simultaneous choices from sets of nonempty witness sets (The Axiom of Choice).

Proof

1.1

Put Lr={nB:cf(x(n))=r} for 1rm and H={nB:cf(x(n))>κ}. They partition B: by F1 and F8 the cofinalities at issue are infinite cardinals greater than ω, and the cardinals in (ω,m] are precisely 1,,m. For nLr choose a strictly increasing cofinal function Cn:rx(n). To obtain this from the cofinal subset of F8, enumerate that subset and recursively choose increasing ordinals above the earlier choices and the next enumerated value; fewer than r earlier ordinals are bounded in x(n) by F8, and x(n) is a limit. A1 fixes the resulting family C. Empty Lr requires no choice.

F1F4F8A1
1.2

Choose an ordinal ρ>κ above the ranks of all specified parameters, x,B,PB,C,H, the finite tuple (Lr)1rm, and κ, with an additional ω of rank room. Fix any regular cardinal θ>ρ; all these objects belong to Vθ by F5. For any SVθ of size at most κ, regularity and κ<θ bound the at most κ ranks of its members below θ; their supremum plus one is still below the infinite cardinal θ. Hence SVθ by F5. Transitivity F6 makes bounded membership statements absolute: induction on formulas proves this, since a quantifier bounded by aVθ ranges over exactly the actual members of a, and equality and membership are restrictions of the actual relations. In particular function evaluation, ordinal comparison, ordinal successor, intersections, and unions agree with the actual operations whenever the resulting objects are in Vθ. Finite tuples and the ordinal functions used below have ranks bounded by the fixed parameters' ranks plus a finite ordinal, so they too are in Vθ. Thus the rest of the construction works for every regular θ above the single threshold ρ.

F5F6
2.1

The language {} is finite, and Vθ contains κ, so F2 applies. Choose M0Vθ of size κ containing the objects of step 1.2 and all ordinals below κ. At successors choose Mα+1Vθ of size κ containing Mα{Mα}. The latter is a subset of Vθ by step 1.2 and has size κ by F9. Fix such hull choices on the set of all size-at-most-κ subsets of Vθ before recursion, using F2 and A1. At a nonzero limit δκ put Mδ=α<δMα. Its size is κ: it contains M0, and A1 and F9 bound a union of at most κ size-κ sets by κ. It is elementary by F3. Indeed every finite tuple in this union lies in a single stage; an existential instance true in Vθ with that tuple has a witness at that elementary stage, hence in the union. There are no function or constant symbols to require further substructure closure. These rules and F4 construct the chain through κ. Put M=Mκ. Thus MVθ, M=κ, and κM.

step 1.2F2F3F4F9A1
3.1

For α<κ and nH set hα(n)=sup(Mαx(n)). Since Mα=κ<cf(x(n)), F8 gives hα(n)<x(n). The function hα is in Vθ by the rank bounds in step 1.2 and is uniquely defined there from Mα,x,H by intersection and union: hα(n)={ξx(n):ξMα}. Those parameters belong to Mα+1, so elementarity puts hα in Mα+1. Here and below uniqueness in Vθ makes its elementary witness the actual object, by the absoluteness established in step 1.2. Every nB is below κ and thus in every stage. Evaluation gives hα(n)Mα+1, and its successor is there as well. Because x(n) is a limit, hα(n)+1<x(n). Consequently hα+1(n)hα(n)+1>hα(n). The chain inclusions also give monotonicity between arbitrary stages.

step 1.2step 2.1F1F8
4.1

On H put x^(n)=sup(Mx(n))=supα<κhα(n). Its value is below x(n) by M=κ and F8. The strictly increasing sequence of step 3.1 is cofinal in x^(n), so its cofinality is at most κ. If a cofinal subset had size μ<κ, choose for each of its members a stage whose h value exceeds it. F7 bounds these μ stages below one β<κ; then hβ(n)<x^(n) bounds that supposedly cofinal subset, a contradiction. Thus the cofinality is exactly κ. On Lr define x^(n)=x(n). All its coordinate cofinalities now lie in {1,,m}, so x^XR(B) by F1 with the strict uniform bound m+1. This also proves hα(n)<x^(n) on H for every α<κ, since there is a later, larger value.

step 1.1step 2.1step 3.1F1F7F8A1
5.1

Let vPB and v<x^. On each nonempty Lr, cofinality of Cn gives a least ξn<r with v(n)<Cn(ξn). Regularity of uncountable r and countability of B give γr=supnLr(ξn+1)<r. Thus v(n)<Cn(γr)<x(n)=x^(n). Every γr is below κ and belongs to M, including when r=m. On nonempty H, cofinality of the hα(n) gives a least stage αn with v(n)<hαn(n). Similarly choose α<κ above all these countably many stages using F7 and F8. Define z(n)=Cn(γr) on Lr and z(n)=hα(n) on H. If H is empty omit the latter parameter; omit parameters for empty Lr as well. The finite tuple of chosen γr, the fixed finite partition and C belong to M, and hαM by step 3.1. Unique definition, elementarity, and the rank and absoluteness checks in step 1.2 give zM. The displayed inequalities and step 4.1 give v<z<x^x, so zPB. This proves the strict interpolation even when H or all the low strata are empty.

step 1.1step 1.2step 2.1step 3.1step 4.1F7F8
6.1

Suppose uMPB, ux, and all its coordinate cofinalities are at most κ. On Lr immediately u(n)x(n)=x^(n). On H, equality u(n)=x(n) would give both cf(u(n))κ and cf(x(n))>κ, so u(n)<x(n). Since u,nM, evaluation and successor put u(n) and u(n)+1 in M. The limit property of x(n) gives u(n)+1<x(n), hence u(n)<sup(Mx(n))=x^(n). Thus ux^ in every coordinate, including zero or successor values of u. QED.

step 1.1step 1.2step 2.1step 4.1F1

Depends on

Used by

Dependency tree · two levels

46 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