Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 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.

Neighborhoods of Rudin initial-top slices contain tails

Statement

Assume AC. For k<ω put Fk={u∈XR(B):u(n)=ℵn for every n∈B with n≤k}. If U is open in XR(B) and Fk⊆U, there is z∈∏n∈Bℵn such that

{u∈XR(B):z<u}⊆U.

The inequality is pointwise. The conclusion includes every point of the Rudin space above z, with its own finite uniform cofinality bound; it is not restricted to one cofinality stratum.

Facts & Assumptions

Given: The stated k,U; write X=XR(B) and t(n)=ℵn.

[F1]

For k≥2 and any prescribed finite list of parameters, the internal hull lemma gives M≺Vθ and x∈Fk whose tail coordinates have cofinality ℵk and are below ℵn. Each b<x has z∈M∩PB with b<z<x. If u∈M∩PB and n>k with u(n)<ℵn, then u(n)<x(n) (Internally increasing hulls dominate countable tail bounds).

[F2]

At a point h∈X, the boxes (a,h]X with a<h form a local base (Clopen boxes and the P-space property).

[F5]
[A1]

AC supplies the hull and the countable family of local lower bounds used below (The Axiom of Choice).

Proof

1.1F1F3A1

If k<2, there are no n∈B with n≤k, so Fk=X and U=X. The zero function belongs to the displayed product, and its tail in X is contained in U. Suppose henceforth k≥2. Apply F1 and A1 with U,X,B,PB,t among the parameters. The resulting M contains all these objects, and x∈Fk. For every finite S⊆{n∈B:n>k} define xS by replacing x(n) by ℵn on S and leaving it unchanged elsewhere. This point remains in Fk: it still has the prescribed initial tops, all unchanged coordinates have cofinality at most ℵk, and its finitely many new top cofinalities are the finite alephs ℵn for n∈S, by F3. A finite bound larger than k and every member of S bounds all these cofinalities strictly. Thus xS∈X and hence xS∈U.

2.1

There are countably many finite S as in step 1.1: the map S↦∑n∈S2n takes them injectively to the natural numbers. For distinct sets, let d be the greatest member of their symmetric difference. The contribution 2d to the difference of their sums exceeds the sum of all possible smaller contributions, since ∑i<d2i=2d−1 (the identity follows by induction from the zero empty sum). Thus the codes differ. By F2 and A1 choose, for every such S, a function yS<xS with (yS,xS]X⊆U. For n∈B put

b(n)=sup⁡{yS(n):S finite as above and n∉S}.

The set in braces is nonempty, since S=∅ qualifies, and is countable by the coding. Each term is below x(n), because xS(n)=x(n) whenever n∉S. Every x(n) has uncountable cofinality: on the tail this follows from F1, and on the initial coordinates from F3. F4 therefore gives b(n)<x(n) for every n. In particular b∈PB. Apply F1 to obtain z∈M∩PB with b<z<x. Since x≤t, every z(n)<ℵn, so z is in the product required by the statement. [step 1.1, F1, F2, F3, F4, A1]

3.1step 1.1step 2.1F1F3

Let u∈M∩X satisfy z<u. Set S={n∈B:n>k and u(n)=ℵn}. The defining Rudin condition gives a finite q with every coordinate cofinality of u below ℵq. If n∈S, F3 gives ℵn=cf⁡(u(n))<ℵq, so n<q. Hence S is finite. For tail coordinates outside S, u(n)<ℵn and F1 yields u(n)<x(n)=xS(n). For coordinates in S, u(n)=xS(n)=ℵn. At initial coordinates u(n)≤ℵn=xS(n). Thus u≤xS. If n∉S, step 2.1 gives u(n)>z(n)>b(n)≥yS(n); if n∈S, u(n)=xS(n)>yS(n). Therefore u∈(yS,xS]X⊆U. This treats every internal Rudin point above z, including those attaining some tail tops.

4.1step 1.1step 2.1step 3.1F1F5

Suppose there were an external u∈X∖U with z<u. The assertion that such a u exists is true in Vθ: X,U,z,B belong to it, every member of X is in it by F5, and the conditions u∈X, u∉U and z(n)<u(n) for all n∈B 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 M, by steps 1.1–2.1. Elementarity F1 therefore gives a witness in M with the same actual properties, contradicting step 3.1. There is no such witness, which proves the full pointwise tail inclusion. QED.

Depends on

Used by

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.

Sources