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.

Ordering the two-state reference mixtures

Statement

Let x0,x1∈X satisfy x0⪯x1 and not x1⪯x0. For every real λ, define the signed unit-mass reference map Rλ:=(1−λ)ex0+λex1. For all λ,μ∈R,

Rλ⪯sRμ⟺λ≤μ.

The parameters need not lie in [0,1]; outside that interval Rλ is signed notation, not a compound.

Facts & Assumptions

[A1]

Comparison and stability for compounds: the relation is reflexive, positively scale-invariant, and the reference states have the stated one-way comparison.

[F1]

Signed comparison of finite coefficient maps: signed comparison is determined by the positive and negative parts of the coefficient difference.

[F2]

Spectator cancellation and signed-order algebra: on positive maps the signed relation agrees with the compound relation, and its definition is well-defined for equal-total signed maps.

Proof

Given: [A1], [F1], and [F2].

1.1F1F2algebra

Put δ:=μ−λ. The coefficient difference is Rμ−Rλ=δ(ex1−ex0) and has total zero. If δ>0, its negative and positive parts are δex0 and δex1; if δ<0, they are (−δ)ex1 and (−δ)ex0; if δ=0, both are zero.

1.2A1F1algebra

If δ=0, reflexivity gives Rλ⪯sRμ. If δ>0, [F1] reduces this comparison to δex0⪯δex1, which follows by positive scaling of x0⪯x1 by δ. Hence λ<μ implies Rλ⪯sRμ.

2.1A1F1step 1.1step 1.2algebra∎

If δ<0 and Rλ⪯sRμ, [F1] gives cex1⪯cex0 for c:=−δ>0. In the ordered real field, c−1>0: c−1≠0, and if −c−1>0 then closure of the positive cone under multiplication gives c(−c−1)=−1>0. But 1>0: since 1≠0, trichotomy gives either 1>0 or −1>0; the latter would, by positive-product closure, also give (−1)2=1>0, contradicting trichotomy. Thus −1>0 is impossible, and so c−1>0. Positive scaling by c−1 therefore implies x1⪯x0, contrary to [A1]. Thus this comparison fails when λ>μ. The three cases prove the equivalence.

Depends on

Dependency tree · 2 levels

Sources