Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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 conjugate bound for residual and Bregman errors

Statement

Let ψ:[0,∞)→[0,∞) be continuous, nondecreasing, concave, and satisfy ψ(0)=0. Extend g=−ψ to R by g(s)=+∞ for s<0, and define H(q):=g∗(−q)=sup⁡s≥0(ψ(s)−qs) for q>0, assuming the displayed suprema below are finite. For c1,c2,C3,α>0 and d,r,e≥0, if

c1r+c2αe≤d+αψ(C3r),

then

e≤1c2(dα+H ⁣(c1C3α)),r≤2c1(d+αH ⁣(c12C3α)).

Facts & Assumptions

Given: ψ, H, c1,c2,C3,α,d,r,e satisfy the hypotheses and inequality in the Statement.

[A1]

The two values H(c1/(C3α)) and H(c1/(2C3α)) are finite.

Proof

1.1givenA1algebra

Put t=C3r. Rearranging the given inequality and dividing by c2α gives e≤dc2α+1c2(ψ(t)−c1C3αt). The parenthesized expression is bounded above by the defining supremum H(c1/(C3α)), proving the first bound.

2.1givenA1step 1.1algebra∎

Subtracting c1r/2 from the given inequality and using c2αe≥0 gives c1r2≤d+α(ψ(t)−c12C3αt)≤d+αH ⁣(c12C3α). Multiplication by 2/c1 proves the second bound.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources