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

A scale used in the Dowker subspace

Example

Assume AC and fix the normalized scale on its infinite coordinate set B. Starting above the concrete bound b(n)=0, the recursion below produces an actual point hX with cf(h(n))=ω1 at every coordinate. The same calculation works for any prescribed bnBn upon replacing the initial value 1 by b(n)+1.

Facts & Assumptions

Given: λ=ω+1 and the normalized scale (fα)α<λ; initially b(n)=0.

[F1]

The scale is strictly eventually increasing and cofinal, and Rudin points eventually equal to its terms form X (Kojman-Shelah scale subspace).

[F2]

Strictly increasing ω1-long product representatives with increasing scale indices have a coordinate supremum in the product, of cofinality ω1 at each coordinate and eventually equal to a scale term (Tail suprema and normalized scales, m=k=1).

[F5]

Specified rules admit transfinite recursion (Transfinite recursion).

[A1]

AC is assumed for regularity and the normalized-scale construction (The Axiom of Choice).

Verification

1.1

Given the earlier gη for η<ξ<ω1, define tξ(n)=sup({1}{gη(n)+1:η<ξ}). By F3–F4 each countable supremum is below n; thus tξ is in the strict product. The earlier indices are countable and bounded below λ by F3–F4. F1 supplies a scale term strictly eventually above tξ with index above all earlier indices, by cofinality followed by a later scale term if necessary. Let αξ be the least eligible index and put gξ(n)=max(tξ(n),fαξ(n)). This is in the product, is eventually equal to fαξ, and is above every earlier gη pointwise. F5 now supplies the sequence by the specified rule. At stage zero, t0(n)=1 and g0(n)=max(1,fα0(n))1>0. At stage one, t1(n)=g0(n)+1 and g1(n)g0(n)+1. These are the first two calculations of the instance.

F1F3F4F5A1
2.1

Set h(n)=supξ<ω1gξ(n) and δ=supξ<ω1αξ. The sequence in step 1.1 satisfies every hypothesis of F2, and n>1 for every nB, so its tail is the entire coordinate set. Therefore h(n)<n, cf(h(n))=ω1, δ<λ, and h=fδ. The cofinalities have uniform strict bound 2, so h is a Rudin point and F1 gives hX. The calculation h(n)g1(n)>g0(n)1>0 verifies strict domination of the chosen zero bound.

step 1.1F1F2
3.1

For a prescribed b replace 1 in step 1.1 by b(n)+1. This value is below the limit cardinal n, so the same countable-supremum and least-index arguments still apply. Then g0(n)b(n)+1>b(n) and the resulting supremum satisfies h(n)g0(n)>b(n) for every n. Thus the example exhibits the actual representative construction behind pointwise cofinality, with no choice of a member from a possibly empty scale class. QED.

step 1.1step 2.1F3F4

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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