Alphabeta Math
Pipeline-generated
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.

Bregman distances and variational source rates — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

A unit VSC coefficient need not force Bregman convergence

Statement refuted

For X=Y=R with the usual norm and pairing, D(F)=R, F(x)=0, R(x)=max⁡{0,−x}, x†=0, y=0, ξ†=−1∈∂R(0), R0=1, p=2, and ψ(t)=t, the boundary source inequality with coefficient β1=1

−ξ†(x−x†)≤DRξ†(x,x†)+ψ ⁣(∣F(x)−F(x†)∣2)(R(x)≤R0),

holds for every x with R(x)≤R0, where DRξ†(x,0):=R(x)−R(0)−ξ†x. For every δ∈(0,1], set yδ=0, α(δ)=δ, and Jδ(x):=12∣F(x)−yδ∣2+α(δ)R(x). A global minimizer means a point xδ with Jδ(xδ)≤Jδ(z) for every z∈R. The false claim is that every family of such global minimizers satisfies DRξ†(xδ,0)=O(δ) as δ↓0, meaning DRξ†(xδ,0)≤Cδ for some fixed C and all sufficiently small δ>0.

Facts & Assumptions

Given: The scalar model and source inequality in the Statement.

[F1]

Banach-space convex subgradients and dual pairings: ξ∈∂R(x) exactly when R(z)≥R(x)+⟨ξ,z−x⟩ for every z.

[F2]

Bregman distances for convex regularizers: DRξ(x,x†)=R(x)−R(x†)−⟨ξ,x−x†⟩.

[F3]

Variational source conditions on a regularizer sublevel: the rate theorem's VSC requires a coefficient strictly below one; this item tests the same source inequality at its excluded boundary value one.

Counterexample

1.1givenF1F2F3algebra

The function R is finite and nonnegative, hence proper. For u,v∈R and t∈[0,1], R((1−t)u+tv)=max⁡{(1−t)0+t0,(1−t)(−u)+t(−v)}≤(1−t)max⁡{0,−u}+tmax⁡{0,−v}, so R is convex. For every z∈R, R(z)≥−z=R(0)+(−1)(z−0), so [F1] gives ξ†=−1∈∂R(0). By [F2], DR−1(x,0)=R(x)+x, which equals x for x≥0 and 0 for x<0. Since F is zero, the source inequality has left side x and right side DR−1(x,0); it holds for all x, hence on R(x)≤1, with boundary coefficient β1=1.

2.1givenstep 1.1algebra∎

For every δ>0, Jδ(x)=δR(x)≥0, and it equals zero for every x≥0. Thus xδ=1 is a global minimizer for every δ, but DR−1(1,0)=1. No fixed constant bounds 1 by Cδ for all sufficiently small δ, so the claimed rate fails.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Power index functions give polynomial Bregman rates

Example

Let X,Y be real Banach spaces, D(F)⊆X, F:D(F)→Y, and let R:X→(−∞,+∞] be proper and convex. Fix x†∈D(F)∩dom⁡R, y=F(x†), ξ†∈∂R(x†), 1≤p<∞, A>0, 0<μ<1, 0≤β<1, and R0>R(x†). Write DRξ†(x,x†):=R(x)−R(x†)−⟨ξ†,x−x†⟩X∗,X, and suppose

−⟨ξ†,x−x†⟩X∗,X≤βDRξ†(x,x†)+A∥F(x)−F(x†)∥Ypμ(x∈D(F), R(x)≤R0).

For data yδ with ∥yδ−y∥Y≤δ, suppose 0≤εδ≤Cεδp and xαδ,ε∈D(F) satisfies Jαδ(xαδ,ε)≤inf⁡z∈D(F)Jαδ(z)+εδ, where Jαδ(x):=p−1∥F(x)−yδ∥Yp+αR(x). Set cp=21−p/p, H(q):=sup⁡s≥0(Asμ−qs), and choose α(δ)≍δp(1−μ). Then H(cp/α)≍δpμ and αH(cp/α)≍δp. The fixed-scale conjugate and penalty-index conditions hold. Hence DRξ†(xαδ,ε,x†)=O(δpμ) and ∥F(xαδ,ε)−yδ∥Y=O(δ); if DRξ†(x,x†)≥cR∥x−x†∥Xs on LR0 for constants cR,s>0, then ∥xαδ,ε−x†∥X=O(δpμ/s).

Facts & Assumptions

Given: The conditions in the Example hold, with α(δ)≍δp(1−μ).

[F1]

Variational source conditions yield nonlinear regularization rates: under the VSC, approximate-minimizer tolerance, and conjugate parameter coupling, the Bregman distance is O(H(cp/α)) and the residual is O(δ).

[F2]

A conjugate bound for residual and Bregman errors: H(q)=sup⁡s≥0(ψ(s)−qs) is the conjugate term in the residual/Bregman bound.

[A1]

A>0, 0<μ<1, and p≥1 are fixed, independent of δ.

Verification

1.1A1algebra

For q>0, the function s↦Asμ−qs has derivative Aμsμ−1−q, which decreases from +∞ to −q and vanishes only at sq=(Aμ/q)1/(1−μ). The function is increasing before sq and decreasing after it, with value 0 at s=0 and limit −∞ as s→∞, so this point is its global maximizer. Substitution gives H(q)=(1−μ)A1/(1−μ)μμ/(1−μ)q−μ/(1−μ).

2.1A1F1F2step 1.1algebra∎

With q=cp/α this gives H(cp/α)=Cp,A,μαμ/(1−μ), so the chosen α yields H(cp/α)≍δpμ and αH(cp/α)≍δp. Also H(cp/(2α))=2μ/(1−μ)H(cp/α), while ψ(C0δp)=AC0μδpμ=O(H(cp/α)) for every fixed C0>0. Thus the parameter and penalty conditions in [F1] hold, and [F1] gives the stated Bregman and residual rates. Under the additional lower bound with cR,s>0, division by cR gives ∥xαδ,ε−x†∥Xs=O(δpμ); taking the positive s-th root gives the norm rate.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Logarithmic index functions give log-rate Bregman convergence

Example

Let X,Y be real Banach spaces, D(F)⊆X, F:D(F)→Y, and let R:X→(−∞,+∞] be proper and convex. Choose x†∈D(F)∩dom⁡R, set y=F(x†), and choose ξ†∈∂R(x†). Fix 1≤p<∞, ν>0, 0<t0<e−(ν+1), 0≤β<1, and R0>R(x†). Define ψ(0)=0, ψ(t)=(−log⁡t)−ν for 0<t<t0, and ψ(t)=(−log⁡t0)−ν for t≥t0. Suppose

−⟨ξ†,x−x†⟩X∗,X≤βDRξ†(x,x†)+ψ ⁣(∥F(x)−F(x†)∥Yp)(x∈LR0:={x∈D(F):R(x)≤R0}),

where DRξ†(x,x†):=R(x)−R(x†)−⟨ξ†,x−x†⟩X∗,X. For data yδ∈Y with ∥yδ−y∥Y≤δ, let 0≤εδ≤Cεδp and suppose xαδ,ε∈D(F) satisfies

Jαδ(xαδ,ε)≤inf⁡z∈D(F)Jαδ(z)+εδ,Jαδ(x):=p−1∥F(x)−yδ∥Yp+αR(x).

Choose α(δ)=δp(log⁡(1/δ))ν for sufficiently small 0<δ<1, and write cp=21−p/p. For H(q):=sup⁡s≥0(ψ(s)−qs), one has H(q)∼(log⁡q)−ν as q→∞, so ρδ:=H(cp/α(δ))≍(log⁡(1/δ))−ν and α(δ)ρδ≍δp. The variational source rate theorem therefore gives

DRξ†(xαδ,ε,x†)=O((log⁡(1/δ))−ν),∥F(xαδ,ε)−yδ∥Y=O(δ),∣R(xαδ,ε)−R(x†)∣=O((log⁡(1/δ))−ν).

If also DRξ†(x,x†)≥cR∥x−x†∥Xs on LR0 for constants cR,s>0, then ∥xαδ,ε−x†∥X=O((log⁡(1/δ))−ν/s). The parameter coupling here is derived from αH(cp/α)≍δp.

Facts & Assumptions

Given: The conditions in the Example hold for sufficiently small 0<δ<1.

[F1]

Variational source conditions on a regularizer sublevel: the VSC uses a continuous, nondecreasing, concave index function vanishing at zero and a coefficient 0≤β<1 on the stated regularizer sublevel.

[F2]

A conjugate bound for residual and Bregman errors: H(q)=sup⁡s≥0(ψ(s)−qs) is the conjugate quantity used to bound Bregman and residual errors.

[F3]

Variational source conditions yield nonlinear regularization rates: if αH(cp/α)≍δp and H(cp/(2α))=O(H(cp/α)), then the theorem yields Bregman error O(H(cp/α)) and noisy-data residual O(δ); it also yields the penalty rate when ψ(C0δp)=O(H(cp/α)).

[A1]

ν>0 and 0<t0<e−(ν+1) are fixed, and α(δ)=δp(log⁡(1/δ))ν.

Verification

1.1A1F1algebra

For 0<t<t0, put L=−log⁡t. Differentiation gives ψ′(t)=ν/(tLν+1) and ψ′′(t)=ν((ν+1)−L)/(t2Lν+2)<0, since L≥−log⁡t0>ν+1. Thus ψ′ decreases on (0,t0) and has positive left limit at t0; after t0 the function is constant, so its derivative drops to zero and remains nonincreasing. Also ψ(t)→0 as t↓0. Therefore its continuous extension at zero is nondecreasing, concave on [0,∞), vanishes at zero and is positive for t>0, as required by [F1].

2.1A1step 1.1algebra

For q>ψ′(t0−), the derivative of s↦ψ(s)−qs decreases from +∞ to a negative value on (0,t0) and is −q<0 for s>t0. Hence the unique global maximizer is sq∈(0,t0) satisfying q=ν/(sqLqν+1), where Lq=−log⁡sq. This equation gives log⁡q=Lq−(ν+1)log⁡Lq+log⁡ν, so Lq→∞ and Lq/log⁡q→1. At the maximizer, qsq=νLq−ν−1; consequently H(q)=Lq−ν(1−ν/Lq)∼(log⁡q)−ν.

3.1A1F2F3step 2.1algebra∎

Set ℓδ=log⁡(1/δ). Then α(δ)→0 and qδ=cp/α(δ)→∞, while log⁡qδ=pℓδ−νlog⁡ℓδ+log⁡cp∼pℓδ. By step 2.1, ρδ=H(qδ)≍ℓδ−ν and αρδ≍δp. Replacing qδ by qδ/2 changes its logarithm by only −log⁡2, so H(cp/(2α))≍ρδ. For any fixed C0>0, eventually C0δp<t0, and ψ(C0δp)=(−log⁡(C0δp))−ν≍ℓδ−ν≍ρδ. Thus all coupling and penalty-index hypotheses in [F3] hold; applying [F3] gives the three asserted rates. If the additional Bregman lower bound holds, its combination with the Bregman rate gives ∥xαδ,ε−x†∥Xs=O(ℓδ−ν), and taking the positive s-th root proves the stated norm rate.

Sources