Alphabeta Math
CorollaryStatement: AI-generatedProof: AI-generatedPipeline-generatedprecheck passverified 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.

Conditional finite-mixture envelope for an additive ordered representation

Statement

Assume the strict-reference representation conclusion of the draft supplier Additive extensive representation of compound comparison for its nonempty state set X and stated comparison hypotheses. Let d≥1 and m≥1 be integers, and take a finite list of distinct states s1,…,sm∈X. Let q1,…,qm∈Rd and set ai:=S(si) for 1≤i≤m. Let es be the unit-state compound defined in Tagged scalable compounds; it is a mass-one point mass by Compound mass is well-defined and additive. For θ∈Δm, put Mθ=∑iθiesi and set V(θ):=∑iθiS(si). Suppose a map χ:{Mθ:θ∈Δm}→Rd satisfies χ(Mθ)=∑iθiqi for every θ∈Δm. For each x∈Rd, define the value to be +∞ if no θ∈Δm has coordinate x. Then the minimum represented value among those finite mixtures, with that empty-feasible-set convention, is exactly the finite-mixture envelope fmix(x) of Finite-mixture convex envelope and its supporting-face condition, with all its attainment, convexity, lower-semicontinuity, biconjugation, and supporting-face conclusions. This is the complete conditional transfer under the representation conclusion and affine coordinate assignment; the supplier definition and mass-one fact are provided locally.

Facts & Assumptions

Given: A finite family of states and coordinate data as in the Statement.

[L1]

Additive extensive representation of compound comparison: under its strict-reference hypotheses the normalized S:X→R assigns each compound ∑iaiexi the finite additive value ∑iaiS(xi) and represents all equal-mass comparisons. Its normalized reference values are 0 and 1. The supplier remains draft; this use records no independent proof acceptance.

[A1]

Conditional premise: assume the strict-reference representation conclusion [L1] for the chosen state set and its listed comparison hypotheses.

[A3]

The coordinate assignment χ is affine on the finite mixtures of the fixed states, exactly as specified in the Statement.

[L2]

Tagged scalable compounds defines es(x)=1 when x=s and 0 otherwise, nonnegative pointwise scaling with 0es=0, and finite pointwise composition. Compound mass is well-defined and additive proves m(es)=1, finite mass additivity and homogeneity for every nonnegative scalar, and m(C)=0 exactly for the empty compound.

[L3]

Finite-mixture convex envelope and its supporting-face condition: for finite data (qi,ai) the minimized weighted value is the proper closed convex envelope with the stated dual and support properties.

Proof

technique · direct
1.1A1A3L1L2L3algebra

By [A1] and [L1], each ai=S(si) is finite. For any θ∈Δm, [L2] gives m(Mθ)=∑iθim(esi)=∑iθi=1. If θi=0, its term is the empty compound and contributes zero; equivalently omit such terms, leaving only positive coefficients and never applying a positive-scaling comparison axiom at zero. The representation assigns Mθ the value V(θ)=∑iθiai. By [A3], its coordinate is ∑iθiqi. Since the states are distinct, the coefficient of si in Mθ is exactly θi, so this parametrization is injective. Hence mixtures in this fixed family with coordinate x correspond exactly to θ∈Θx from [L3].

2.1A1A3L3step 1.1∎

The minimum of V(θ) over those mixtures is therefore min⁡θ∈Θx∑iθiai=fmix(x) by [L3], with +∞ when Θx is empty. Every further conclusion in the Statement follows by applying the corresponding conclusion of [L3] to the same finite data. The point-mass and zero-coefficient cases are supplied by [L2]; the transfer remains conditional on [A1] and [A3] and records no independent acceptance of the draft representation.

Depends on

Dependency tree · 2 levels