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.

Internally increasing hulls dominate countable tail bounds

Statement

Assume AC. Let 2≤k<ω, κ=ℵk, and let A be a finite set of parameters including B,PB,XR(B) and t:n↦ℵn on B. For every sufficiently large regular cardinal θ>κ there is M≺(Vθ,∈) with A⊆M, κ⊆M and ∣M∣=κ such that, on defining

x(n)={ℵn,n≤k,sup⁡(M∩ℵn),n>k,

one has cf⁡(x(n))=κ and x(n)<ℵn for every n>k in B. Moreover x∈Fk:={h∈XR(B):h(n)=ℵn for all n∈B with n≤k}. Every b∈PB with b<x has an interpolant z∈M∩PB with b<z<x. Finally, if u∈M∩PB, n∈B, n>k and u(n)<ℵn, then u(n)<x(n), without any bound on the cofinalities of u.

Facts & Assumptions

Given: The stated parameters and AC; all inequalities between functions are pointwise.

[F1]

PB uses inclusive top coordinates ℵn, and membership in XR(B) requires uncountable coordinate cofinalities below one finite aleph (Rudin ordinal box spaces on infinite index sets).

[F2]

YB imposes only uncountability of the coordinate cofinalities (The ambient Rudin box space).

[F4]

At any point of YB and cutoff ℵk, the bounded-cofinality hull construction gives M≺Vθ containing prescribed parameters and every ordinal below ℵk, with size ℵk. Its hull point keeps the low-cofinality coordinates and replaces each higher one by sup⁡(M∩t(n)), strictly below t(n) with cofinality ℵk. It also gives strict internal interpolation below that hull point (Elementary hull transfer for bounded cofinality strata).

[F5]
[A1]

AC is assumed for regularity and the hull construction (The Axiom of Choice).

Proof

1.1F2F3F4A1

The top function t belongs to YB: by F3 and A1, cf⁡(t(n))=ℵn>ω for every n∈B, so F2 applies. Its coordinates with cofinality at most κ are exactly those with n≤k, since the finite alephs strictly increase. Apply F4 at t, with cutoff ℵk and the parameters in A. It supplies M as stated; its hull point is exactly the displayed x. In particular every tail coordinate has cofinality κ and lies strictly below its top.

2.1step 1.1F1F3F4

At an initial coordinate n≤k the value x(n)=ℵn has uncountable cofinality at most ℵk by F3. On the tail the same upper cofinality bound follows from step 1.1. Therefore all coordinate cofinalities lie strictly between ω and ℵk+1, and F1 gives x∈XR(B). Its initial values give x∈Fk by the displayed definition. This includes the possibility that B has no coordinates at most k. The strict interpolation assertion follows from F4, applied to this very hull point: for each b∈PB with b<x, it returns z∈M∩PB with b<z<x.

3.1step 1.1F4F5

Fix u∈M∩PB and n>k in B with u(n)<ℵn. Since n<ω<κ and κ⊆M, n∈M. Elementarity puts the unique value u(n) and its ordinal successor in M. These operations agree with the actual operations in Vθ: their defining formulas are membership in the function and s=u(n)∪{u(n)}, and all the function entries and these finite-rank codes are in the sufficiently large rank level. The infinite cardinal ℵn is a limit ordinal, so u(n)+1<ℵn. Consequently u(n)+1∈M∩ℵn and u(n)<u(n)+1≤sup⁡(M∩ℵn)=x(n). Transitivity F5 ensures that the bounded membership formulas just used range over the actual function entries and ordinal members. This uses only the strict coordinate bound on u(n), and applies also to zero and successor values. QED.

Depends on

Used by

Dependency tree · two levels

37 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