Alphabeta Math
PropositionStatement: 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.

Entropy rates, inverse branches and shifted root contracts

Statement

For a>0, put I(a)=alog⁡a−a+1. Then I′(a)=log⁡a, I′′(a)=1/a>0, I(1)=0, I(a)→1 as a↓0, and I(a)→∞ as a→∞. Its lower inverse branch a−:(0,1)→(0,1) and upper inverse branch a+:(0,∞)→(1,∞) are smooth with a±′(t)=1/log⁡a±(t). In I(1+c+s)=t, require 1+c+s>0 and choose a branch, giving c=a±(t)−1−s. Under 0<ε<1 and 1+ε<γ<1+ε−2, define c±(γ)=a±(1/γ)−1 and c±(γ,ε)=a±((1+ε)/γ)−1∓ε. Then −1<c−(γ)<c−(γ,ε)<0<c+(γ,ε)<c+(γ). For fixed γ>1 the shifted roots tend to the unshifted roots as ε↓0. In particular 1+ε−2<(1+ε)/I(1−ε). Different parameters or branches cannot be ordered without the corresponding right-hand sides and shifts.

Facts & Assumptions

Given: The variables and hypotheses of the Statement.

[F1]

Logarithmic tangent bound and a quadratic entropy envelope proves the elementary logarithmic and entropy inequalities.

[F2]

Entropy endpoint limits and the two monotone branches proves the derivatives, endpoint limits, monotone ranges and unique branch roots.

[F3]

Differentiable entropy inverse branches and shifted contracts proves smooth inverse branches, their derivatives, and every shifted solution formula.

[F4]

Parameter bounds giving the signs of shifted entropy roots proves the parameter-specific admissibility, signs and displayed scalar bound.

[F5]

Inward comparison and small-shift limits of entropy roots proves the inward comparisons and the fixed-parameter small-shift limits.

Proof

Goal: Establish the full Statement.

1.1F1F2F3

The endpoint and derivative assertions are F2. F3 supplies the inverse-branch definitions, their smoothness, and the expression for all shifted roots, with the positive logarithm domain explicitly required. F1 supplies the inequalities underlying the parameter-specific estimates.

2.1F3F4F5step 1.1∎

For the stated γ,ε, F4 proves 0<(1+ε)/γ<1, both shifted signs and the scalar bound. Substitute s=−ε on the lower branch and s=ε on the upper branch in F3. F5 then supplies the full strict ordering and both limits. No ordering for an unchosen branch or unrelated right-hand side has been assumed.

Depends on

Used by · 8

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.