Alphabeta Math
LemmaStatement: AI-generatedProof: AI-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.

Inward comparison and small-shift limits of entropy roots

Statement

Under 0<ε<1 and 1+ε<γ<1+ε−2, put u=1/γ, t=(1+ε)/γ, c±(γ)=a±(u)−1, c−(γ,ε)=a−(t)−1+ε, and c+(γ,ε)=a+(t)−1−ε. Then −1<c−(γ)<c−(γ,ε)<0<c+(γ,ε)<c+(γ). For each fixed γ>1, c±(γ,ε)→c±(γ) as ε↓0 within the admissible range.

Facts & Assumptions

Given: The variables and hypotheses of the Statement.

[F1]

Logarithmic tangent bound and a quadratic entropy envelope gives −log⁡x>I(x) for 0<x<1 and log⁡y>I(y) for 1<y<e.

[F2]

Entropy endpoint limits and the two monotone branches gives the strict branch order and I(e)=1, where log⁡e=1.

[F3]

Differentiable entropy inverse branches and shifted contracts gives the continuous inverse functions a± and the shifted solution formulas.

[F4]

Parameter bounds giving the signs of shifted entropy roots gives the signs and admissibility of the two shifted solutions.

Proof

Goal: Establish the full Statement.

1.1F1F2F5algebra

Put x=a−(u)∈(0,1). If x≤ε, then a−(t)+ε>ε≥x. If x>ε, on [x−ε,x] the derivative of I(z)−zlog⁡x is log⁡z−log⁡x≤0. Thus I(x−ε)≥I(x)−εlog⁡x>(1+ε)I(x)=t. Since I strictly decreases on its lower branch, x−ε<a−(t), again giving x<a−(t)+ε. Therefore c−(γ)<c−(γ,ε).

2.1F1F2F4F5step 1.1algebra

Put y=a+(u). Since u<1=I(e), 1<y<e. On [y,y+ε] the derivative of I(z)−zlog⁡y is log⁡z−log⁡y≥0. Therefore I(y+ε)≥I(y)+εlog⁡y>(1+ε)I(y)=t. Strict increase on the upper branch gives a+(t)<y+ε, hence c+(γ,ε)<c+(γ). Together with F4 and x>0 this is the entire strict comparison.

3.1F3algebra∎

For fixed γ>1, all sufficiently small positive ε obey the hypotheses: take ε<min⁡{1,γ−1,(γ−1)−1/2}. Then t→u∈(0,1), and continuity of both inverses gives a±(t)→a±(u). The additive shifts tend to zero, proving both limits.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.