Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

Negative entropy gives normalized multiplicative weights

Example

Let n≥2, let Kn be the probability simplex represented by independent coordinates q1,…,qn−1 with pi=qi for 1≤i<n and pn=1−∑i=1n−1qi. Probability labels are one-based; for any independent-coordinate vector v∈Rn−1, write vi:=v(i−1) for 1≤i<n in the library's function-space convention. Set

Un:={q∈Rn−1:qi>0 for all 1≤i<n, ∑i=1n−1qi<1}.

Use Un as the mirror domain and define R(q)=∑i=1npilog⁡pi on Kn, with 0log⁡0:=0. Initialize at the uniform distribution. At each round use the linear loss ft(p)=∑i=1npiℓt,i for a full-information vector ℓt∈[0,1]n and a fixed step size η>0. In full probability coordinates, agile mirror descent updates

pt+1,i=pt,iexp⁡(−ηℓt,i)∑j=1npt,jexp⁡(−ηℓt,j),i=1,…,n.

Consequently its distribution sequence equals the normalized weight distributions of Hedge initialized at unit weights and using learning rate ϵ=η. Hedge then samples an expert from each shared distribution; mirror descent outputs the distributions themselves.

Example references

Agile online mirror descent: defines the agile gradient update and Bregman projection.

Compactness makes the Bregman projection well-defined: establishes existence, uniqueness, and the Pythagorean property of the Bregman projection.

Negative entropy on the simplex is strongly convex and has range log n: proves continuity, strong convexity, and the entropy range for this regularizer.

Mirror maps, Bregman divergence, and local Hessian norms: defines the Hessian geometry and Bregman divergence.

Interior, closure, boundary, limit point, isolated point and dense subset of a metric space: defines the interior and closure used for the simplex mirror domain.

Hedge: defines Hedge's unit initial weights, normalization, full-information loss update, and sampled expert.

The natural logarithm as the inverse of the exponential function: defines the natural logarithm and supplies the positive range of exp⁡ and its inverse relation with log⁡.

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: supplies logarithm quotient and product laws.

The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: supplies the derivative of log⁡ used to differentiate entropy.

The real exponential function and the number e by a power series: defines the real exponential function used in both updates.

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: gradients in the independent coordinates use the standard Euclidean pairing.

Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0: supplies the product rule used to differentiate pilog⁡pi.

The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c): differentiates the affine coordinate substitutions in the entropy summands.

Facts & Assumptions

Given: The simplex, negative entropy, uniform initialization, positive step size, and finite loss vectors in the Example.

[F1]

Agile online mirror descent: the unconstrained point satisfies ∇R(yt+1)=∇R(xt)−ηgt, followed by Bregman projection onto the simplex.

[F2]

Negative entropy on the simplex is strongly convex and has range log n: the negative entropy on the closed simplex is continuous and strongly convex, and its minimum is attained at the uniform distribution.

[F3]

Compactness makes the Bregman projection well-defined: a Bregman projection minimizer exists uniquely, and minimizes BR(⋅∥y) over the simplex.

[F4]

Positive Hessians make Bregman divergence nonnegative: for q∈Kn and y∈Un, BR(q∥y)≥12∥q−y∥22, with the norm taken in the independent coordinates.

[F5]

Hedge: Hedge starts from W1(i)=1, normalizes Wt to a distribution, and updates Wt+1(i)=Wt(i)exp⁡(−ϵℓt,i) after the full loss vector is revealed.

[F7]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: log⁡(ab)=log⁡a+log⁡b and log⁡(a/b)=log⁡a−log⁡b for positive a,b, and log⁡1=0.

[F8]

The natural logarithm as the inverse of the exponential function: exp⁡:R→(0,∞) is a bijection and log⁡ is its inverse, so exponentials are positive and exponentiating a logarithmic identity is valid.

[F10]

The coordinate inequalities make Kn nonempty, bounded, closed, and convex, and make Un open and convex; the strict inequalities show Un=int⁡(Kn). The uniform point e=(1/n,…,1/n) lies in Un. For every q∈Kn and 0<ϵ<1, (1−ϵ)q+ϵe∈Un and converges to q as ϵ↓0, so Kn⊆Un‾.

Verification

1.1givenF2F6F7F9F10algebra

On Un, differentiating R(q)=∑i<nqilog⁡qi+pnlog⁡pn using [F6, F7, F9] gives ∂iR=log⁡qi+1−(log⁡pn+1)=log⁡(qi/pn) and ∇2R(q)=diag⁡(1/q1,…,1/qn−1)+1pn11⊤. For every nonzero v, v⊤∇2R(q)v=∑i<nvi2/qi+(∑i<nvi)2/pn>0. Thus the Hessian is positive definite on Un; together with [F2] and [F10], this verifies the mirror-regularizer conditions for (Kn,Un) and the validity of the uniform initialization.

2.1givenF1step 1.1algebra

Fix an interior iterate pt and write rt+1 for the full probability coordinates of a prospective dual point yt+1∈Un. In independent coordinates the linear loss is ft(q)=ℓt,n+∑i<nqi(ℓt,i−ℓt,n), a differentiable convex function on all of Rn−1 with gradient gt,i=ℓt,i−ℓt,n. By step 1.1, the dual equation [F1] becomes log⁡(rt+1,i/rt+1,n)=log⁡(pt,i/pt,n)−η(ℓt,i−ℓt,n) for i<n.

3.1step 2.1F7F8algebraconstruct

By [F7, F8], exp⁡ is multiplicative: for real a,b, log⁡(exp⁡(a)exp⁡(b))=a+b=log⁡(exp⁡(a+b)), so injectivity of log⁡ gives exp⁡(a+b)=exp⁡(a)exp⁡(b). Also exp⁡(0)=1 by log⁡1=0 and [F8], hence exp⁡(−b)=1/exp⁡(b). Any positive normalized solution of step 2.1 therefore satisfies rt+1,i/rt+1,n=(pt,i/pt,n)exp⁡(−ηℓt,i)/exp⁡(−ηℓt,n). Its coordinates must have the form ctpt,iexp⁡(−ηℓt,i) for a common ct>0, and normalization forces ct=(∑jpt,jexp⁡(−ηℓt,j))−1. Conversely, define rt+1,i=ctpt,iexp⁡(−ηℓt,i) by this formula. The denominator is a finite sum of positive finite terms by [F8], so rt+1 is positive and normalized. Its first n−1 coordinates define yt+1∈Un, and [F7, F8] verify the dual equation in step 2.1. Thus this dual point exists uniquely.

4.1step 1.1step 3.1F3F4inductionalgebra

For the interior dual point yt+1 constructed in step 3.1, [F4] gives BR(q∥yt+1)≥12∥q−yt+1∥22 for every q∈Kn, and the defining Bregman formula gives zero at q=yt+1. Hence its unique projection [F3] is xt+1=yt+1. In full probability coordinates this says pt+1=rt+1, proving the displayed update. Starting from the interior uniform point in step 1.1, this construction applies inductively at every round and keeps all iterates in Un.

5.1givenF2F5F10step 4.1inductionalgebra∎

At initialization, [F2] and [F10] make the uniform distribution a minimizer of R in Un, so it is a valid OMD initial point. If pt(i)=Wt(i)/∑jWt(j) and ϵ=η, then [F5] gives Wt+1(i)=Wt(i)exp⁡(−ηℓt,i), whose normalization is exactly the update proved in step 4.1. Induction from W1(i)=1 proves equality of the OMD and Hedge distributions at every round.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

74 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