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

The minimal-walk functions are coherent and finite-to-one

Statement

For every β<ω1, the function eβ:β→ω is finite-to-one. If β≤β′<ω1, then

{α<β:eβ(α)≠eβ′(α)}

is finite. Thus ⟨eβ:β<ω1⟩ is coherent on the common domains of its members.

Facts & Assumptions

Given: Ordinals β≤β′<ω1 and the fixed minimal-walk data.

[F1]

Minimal-walk weights, labelled lower traces, and the functions e-beta identifies eβ(α) with the maximum of the finite local weights ∣Cζ∩α∣ over ζ∈Tr⁡(α,β).

[F2]

Concatenation and limit control for minimal-walk traces proves trace concatenation once the finite initial intersections above the splice have stabilized.

Proof

technique · direct
1.1given

Fix n<ω and set D={α<β:eβ(α)≤n or eβ(α)≠eβ′(α)}. We prove that D has no limit point at or below β.

1.2F1given

Let 0<δ≤β be a limit ordinal. The two traces Tr⁡(δ,β) and Tr⁡(δ,β′) are finite. Local finiteness makes each Cζ∩δ finite for a trace node ζ>δ. Choose δ0<δ above every member of all these intersections, and let N be the maximum of n and their finitely many cardinalities. Cofinality of Cδ permits enlarging δ0 so that ∣Cδ∩α∣>N whenever δ0<α<δ.

2.1F1F2step 1.2

For δ0<α<δ, no trace node above δ has a C-point in [α,δ). Hence the walks toward α first follow the walks toward δ and then the walk from δ to α; this is the same splice calculation as [F2]. Moreover, every local weight on either upper segment is its stabilized value ∣Cζ∩δ∣≤N, whereas the lower segment contains the weight ∣Cδ∩α∣>N.

3.1F1step 2.1

Taking the maxima in [F1] therefore gives eβ(α)=eδ(α)=eβ′(α)>n for every δ0<α<δ. Such α is not in D, so δ is not a limit point of D. Zero and successor ordinals are not limit points from below, so D has no limit point at or below β.

4.1step 1.1step 3.1

If D were infinite, its well-order would recursively give a strictly increasing ω-sequence from D. Its supremum is a nonzero limit ordinal δ≤β and every final segment below δ meets D, contradicting step 3.1. Hence D is finite.

5.1step 1.1step 4.1

The set {α<β:eβ(α)=n} lies in D, so every fiber of eβ is finite. Taking, for example, n=0, the disagreement set between eβ and eβ′↾β also lies in D and is finite.

6.1step 5.1∎

Step 5.1 proves finite-to-one behavior and coherence simultaneously. It also covers β=0, where the domain and disagreement set are empty, and β=β′, where disagreement is empty.

Depends on

Used by

Dependency tree · two levels

6 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