Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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 unique reference coordinate inside a thermal strip

Statement

Let a simple domain and its finite thermal joins satisfy Forward-sector hypotheses for a simple state domain and Thermal joins and conditional contact hypotheses. Let x0≺≺x1 with x0∼Tx1, and let x satisfy x0≺≺x≺≺x1. For 0≤λ≤1, write Rλ for the compound state ((1−λ)x0,λx1), omitting a zero coefficient at the endpoints. Then there is a unique λ∈(0,1) with Rλ∼x in the common accessibility relation.

Facts & Assumptions

Given: The compound axioms A1–A6, thermal-join axioms T1–T3 with the equal-state split, strict strip endpoints, and join closure.

[A1]

Forward-sector hypotheses for a simple state domain: compounds have the preorder, consistency, positive scaling, splitting, and stability assumptions; CH is not part of this definition.

[F1]

Thermal joins and conditional contact hypotheses and Scaling invariance of thermal equivalence: an equal-state split is reversible, thermal equivalence is transitive, and scaling either member of a thermal-equilibrium pair preserves thermal equivalence.

[F2]

Signed comparison for forward-sector relations and Spectator cancellation without comparison completeness: equal-total signed maps compare by their positive and negative parts; cancellation is valid under A1–A6 without CH.

[F3]

Nesting and comparison of simple-system states: every pair of states in each finite join domain is comparable.

Proof

Given: [A1], [F1]–[F3], and x0≺≺x≺≺x1.

1.1A1F2algebra

For 0≤λ<μ≤1, the signed difference Rμ−Rλ=(μ−λ)(J(x1)−J(x0)) has positive part (μ−λ)J(x1) and negative part (μ−λ)J(x0). Since x0≺x1, positive scaling and [F2] give Rλ≺Rμ. A reverse comparison would, by [F2] and inverse positive scaling, give x1≺x0, contrary to strictness. Thus the reference states are strictly ordered by parameter.

1.2F1F3given

For 0<λ<1, [F1] makes (1−λ)x0 and λx1 thermally equivalent. By the definition of thermal equivalence, their compound is reversible with its join state. The equal-state split makes ((1−λ)x,λx) reversible with its join state and with x. Both join states belong to the join of two scaled copies of the same simple domain, so [F3] compares them. The endpoint cases use R0=x0 and R1=x1 directly. Hence Rλ and x are comparable for every λ∈[0,1].

2.1A1F2step 1.1choose

Let L={λ∈[0,1]:Rλ≺x}. The strict endpoint comparison x0≺x puts 0 in L. Step 1.1 and transitivity make L downward closed. Let s=sup⁡L. If s>0, then s−1/n∈L for every sufficiently large n. Since Rs−1/n+(1/n)x1=Rs+(1/n)x0, consistency yields Rs+(1/n)x0≺x+(1/n)x1. Stability with bases Rs,x and fixed spectators x0,x1 gives Rs≺x. If s=0, this comparison is the given x0≺x.

3.1A1F2step 1.2step 2.1

If s<1, then s+1/n∉L for every sufficiently large n. Step 1.2 gives comparability and the definition of L excludes Rs+1/n≺x, so x≺Rs+1/n. The identity Rs+1/n+(1/n)x0=Rs+(1/n)x1 and stability yield x≺Rs. If s=1, the strict strip gives x≺R1; together with step 2.1 this would imply x1≺x, contrary to x≺≺x1. Thus s<1, and step 2.1 and the preceding stability comparison give Rs∼x.

4.1F2step 1.1step 3.1algebra∎

The equivalence Rs∼x also excludes s=0, because R0=x0 and x0≁x, and excludes s=1 by strictness of x≺≺x1. If Rt∼x for another t, transitivity gives Rs∼Rt; step 1.1 then forces s=t. Hence the parameter is unique and lies in (0,1).

Depends on

Dependency tree · 2 levels

Sources