Alphabeta Math
TheoremStatement: 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.

Reference-strip gluing proves comparison for scaled copies

Statement

Assume Forward-sector hypotheses for a simple state domain and T1–T4 of Thermal joins and conditional contact hypotheses for every finite join. For any one simple type Γi, every two finite compounds of its scaled copies with the same total coefficient mass are comparable. Thus CH holds on all multiple scaled products of that type. No entropy across different material types is asserted here.

Facts & Assumptions

Given: The stated forward-sector and thermal-contact hypotheses; every thermal join remains a simple domain with these hypotheses.

[A1]

Forward-sector hypotheses for a simple state domain: A1–A7, S1–S3, and the tagged finite-compound conventions hold, without an assumed CH.

[A2]

Thermal joins and conditional contact hypotheses: T1–T4 provide simple thermal joins, reversible equilibrium splits, thermal scaling, and a thermal endpoint pair surrounding each state.

[F1]

A unique reference coordinate inside a thermal strip: every state in a strip with strict thermally equivalent endpoints is equivalent to a unique reference mixture with parameter in (0,1).

[F2]

Nesting and comparison of simple-system states: one-copy comparisons hold on each finite join domain; strict comparison is interior membership, and forward sectors are nested.

[F3]

Signed comparison for forward-sector relations and Spectator cancellation without comparison completeness: signed comparison is defined from positive/negative parts; it is translation invariant, additive, and cancellable under A1–A6.

[F4]

Forward orientation and the Lipschitz boundary graph: each simple domain has one constant fixed-work energy orientation; arbitrarily close states on a vertical segment are strictly ordered in that orientation.

Proof

1.1A1A2F2

By T4, the open strips Σ(a,b):={x:a≺≺x≺≺b} with a≺≺b and a∼Tb cover Γi. They are open: by [F2], a≺≺x is x∈int⁡Aa, and x≺≺b is x∉Ab; the latter set is open because Ab is relatively closed.

1.2A1F1F2F3F4construct

Let Σ(a,b) and Σ(c,d) overlap. Their intersection is open. Choose two states e≺≺f in a small vertical segment contained in the overlap, using [F4]. Let se,sf be their coordinates in the first strip and te,tf in the second, supplied by [F1]. If sf<se, the signed difference Rse−Rsf=(se−sf)(J(b)−J(a)) and positive scaling and signed compatibility [A1, F3] give Rsf≺Rse, so f≺e by the two reference equivalences; if sf=se, those references coincide and give f∼e. Both contradict e≺≺f. Hence sf>se, and the same argument gives tf>te.

2.1F1F3step 1.2algebra

The four reference equivalences give, in signed comparison, f−e∼s(sf−se)(b−a),f−e∼s(tf−te)(d−c). Put r=(sf−se)/(tf−te)>0. Additivity and positive scaling in [F3] give d−c∼sr(b−a). Applying the same algebra to the equivalences for e gives c∼sa+(se−rte)(b−a). Consequently a state in the second strip with coordinate t has first-chart coordinate se+r(t−te). The change of chart is affine with strictly positive slope.

3.1F3step 2.1algebra

The same calculation covers a finite chain of overlapping strips: after each overlap, express the new strip's endpoint states as signed-equivalent affine maps in the existing reference pair. The local strip lemma gives every state z of the added strip a coordinate sz∈R with J(z)∼s(1−sz)J(a)+szJ(b) in the existing chart. Signed addition, positive scaling, translation, and equivalence under negative scaling are valid by [F3]; hence induction along a finite overlap chain gives one such common chart for every state in the union.

4.1A1F5step 1.1step 3.1construct

Take any finite list of target states in Γi and join them in order by finitely many straight segments, which lie in Γi by convexity. The resulting connected path is a finite union of closed bounded segments, hence compact by [F5]. The open strips from step 1.1 cover it, so compactness gives a finite subcover. The intersection graph of those strips meeting the path is connected: otherwise their unions would partition the connected path into two disjoint nonempty relatively open sets. Order a spanning tree from one root strip; each later strip overlaps an earlier one in an open set and can be glued by step 3.1. Thus every target state has a common signed chart J(z)∼s(1−sz)J(a)+szJ(b) with a≺≺b.

5.1A1F3step 4.1algebra∎

Write the arbitrary scaled-copy compounds as A=∑jαjJrjΓi(rjxj),B=∑kβkJhkΓi(hkyk), with rj,hk>0 and nonnegative coefficients, omitting zero terms. The declared reversible transport in [A1] gives JrjΓi(rjxj)∼rjJΓi(xj) and similarly on the other side; ordinary positive scaling and composition therefore reduce them to the unscaled base-type states with effective amounts aj=αjrj and bk=βkhk. Their masses are respectively rjwΓi and hkwΓi before this transport, so equal total mass M implies L=M/wΓi=∑jaj=∑kbk. If M=0, both maps are empty and reflexivity applies. Otherwise use step 4.1 for the finite list of base states xj,yk, with common-chart coordinates sj,tk. Signed addition and splitting [F3] make the transported compounds equivalent to RqA=(L−qA)J(a)+qAJ(b) and RqB=(L−qB)J(a)+qBJ(b), where qA=∑jajsj and qB=∑kbktk. If qA<qB, their signed difference has positive part (qB−qA)J(b) and negative part (qB−qA)J(a), so a≺b and positive scaling compare them; equality gives reflexivity, and qB<qA gives the reverse comparison. Transitivity transfers this order through the reversible transports to the original distinct scaled tags. Hence CH holds for every allowed scaled-copy pair, without identifying those tags or dropping their scale factors.

Depends on

Dependency tree · 2 levels

Sources