Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Two-state reference order

Example

Let a,b be distinct state tags and X={a,b}. For equal-mass nonnegative compounds c,d, define c⪯d exactly when c(b)≤d(b). For signed unit-mass reference maps Rλ=(1−λ)ea+λeb, the order is strict from a to b and gives the full real-parameter reference ordering.

Facts & Assumptions

[A1]

The example's comparison rule: on equal-mass compounds, c⪯d iff the coefficient of b in c is at most that in d.

[F1]

Comparison and stability for compounds: the required comparison axioms are the preorder, consistency, positive scaling, splitting, stability and CH listed in its Definition.

[F2]

Ordering the two-state reference mixtures: a strict reference pair orders every real-parameter signed reference map by its parameter.

Verification

Given: [A1] and a,b as distinct tags.

1.1A1F1

Reflexivity and transitivity follow from those properties of ≤ on the b coefficient, and CH follows because ≤ is total. Adding a common compound adds the same b coefficient to each side, so consistency holds. Multiplying both coefficients by t>0 preserves the inequality. Splitting a state coefficient into two positive parts preserves the total coefficient of b, so splitting/recombination gives equivalence. Finally ea⪯eb because 0≤1, while eb⋠ea because 1≰0.

1.2A1F1

For stability, suppose A+ϵnZ0⪯B+ϵnZ1 for every n, with ϵn→0 and fixed positive Z0,Z1. If A(b)>B(b), let δ=A(b)−B(b)>0 and q:=∣Z0(b)−Z1(b)∣. If q=0, every perturbed difference remains δ>0; if q>0, choose n with ϵnq<δ. In either case some perturbed b-coefficient difference is positive, contradicting the assumed comparison. Thus A(b)≤B(b), which is A⪯B.

2.1F2step 1.1∎

The reference pair x0=a,x1=b is strict by step 1.1. Therefore [F2] applies and yields Rλ⪯sRμ iff λ≤μ for all real λ,μ, including parameters outside [0,1]. The signed parameters are handled by the signed comparison definition, not by treating Rλ as a nonnegative compound.

Depends on

Dependency tree · 2 levels

Sources