Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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.

The closed convex perspective is subadditive

Statement

Let f be a convex generator from Finite f-divergence with support conventions. Define its closed perspective on a,b≥0 by Πf(a,b):={bf(a/b),b>0, a>0,bf(0),b>0, a=0,af∞,b=0, a>0,0,a=b=0. For every finite family (ai,bi)∈[0,∞)2, Πf ⁣(∑iai,∑ibi)≤∑iΠf(ai,bi).

Facts & Assumptions

Given: A convex generator f with the extended boundary values f(0) and f∞ defined in Finite f-divergence with support conventions, and a finite family of nonnegative pairs (ai,bi).

[F1]

Finite f-divergence with support conventions: f is convex on (0,∞), f(1)=0, f(0)=lim⁡t↓0f(t), and f∞=lim⁡t→∞f(t)/t; the value at a positive first coordinate and zero second coordinate is the corresponding first coordinate times f∞.

[F2]

Finite Jensen inequality for convex functions on Rn: for a finite family of points in a convex domain and nonnegative weights summing to one, the convex function at their weighted average is at most the weighted sum of its values.

[F3]

Boundary limits of a normalized finite convex generator exist: every finite convex generator is continuous at every positive argument.

Proof

1.1F1givenalgebra

Put A=∑iai and B=∑ibi. If B=0, all bi=0. If A=0, every pair is (0,0) and both sides are zero. If A>0, both sides equal Af∞ by the definition of Πf, including the convention that a positive coefficient times +∞ is +∞.

1.2F1F2F3givenalgebra

Suppose B>0 and no index has bi=0<ai. If any bi>0=ai with f(0)=+∞, the right side is +∞ and the inequality holds. If f(0) is finite, extend f to the convex domain [0,∞) by that value. This extension is convex at the endpoint too: approximate a zero argument in any convexity inequality by positive arguments and pass to the limit using f(0)=lim⁡t↓0f(t) from [F1] and continuity at positive arguments from [F3]. If f(0)=+∞, the excluded case shows that every index with bi>0 has ai>0, so all ratios used below lie in the original convex domain (0,∞). For indices with bi>0, the weights bi/B sum to one and A/B=∑bi>0(bi/B)(ai/bi). Applying [F2] gives Bf(A/B)≤∑bi>0bif(ai/bi); terms (ai,bi)=(0,0) contribute zero. This is the asserted inequality.

2.1F1F2F3givenconstructalgebra∎

Suppose B>0 and J:={i:bi=0<ai} is nonempty. If f∞=+∞, the right side is +∞, so the inequality holds. If any bi>0=ai with f(0)=+∞, the right side is +∞ and the inequality holds. Otherwise, if f∞ is finite, replace each bi=0 with i∈J by bi(η)=η>0, leaving all other second coordinates unchanged. the finite Jensen inequality [F2] then gives (B+∣J∣η)f(A/(B+∣J∣η))≤∑bi>0bif(ai/bi)+∑i∈Jηf(ai/η). As η↓0, the left side tends to Bf(A/B) by [F3] at the positive number A/B, and each last summand tends to aif∞ by the definition of f∞. The resulting inequality is exactly Πf(A,B)≤∑iΠf(ai,bi).

Depends on

Used by

Dependency tree · two levels

13 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources