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

Monotonicity, endpoints, and asymmetry of the rate roots

PDF p. 32: Analysis following (6.3); Figure 3

Statement

Let h(c)=(1+c)log⁡(1+c)−c for c>−1, and let c−(γ) and c+(γ) be the negative and positive roots of h(c)=1/γ for γ>1, with the endpoint assignments in Degree large-deviation rate function and roots. Then h strictly decreases from the limit 1 to 0 on (−1,0] and strictly increases from 0 to infinity on [0,∞). For each γ>1 there are exactly two roots, and both root functions are smooth: c− strictly increases and c+ strictly decreases. Both tend to 0 as γ→∞; at γ=1, c−(1)=−1 and c+(1)=e−1. Finally, c+(γ)>−c−(γ) for every γ>1.

Facts & Assumptions

[F1]

Degree large-deviation rate function and roots defines the natural logarithm, e, h, the two designated roots and their endpoint assignments. It identifies h(c)=I(1+c), where I(a)=alog⁡a−a+1.

[F2]

Entropy endpoint limits and the two monotone branches gives I(1)=0, I′(a)=log⁡a, the endpoint limits I(a)→1 as a↓0 and I(a)→∞ as a→∞, and strict decrease on (0,1) and increase on (1,∞) with respective ranges (0,1) and (0,∞).

[F3]

Differentiable entropy inverse branches and shifted contracts gives smooth inverse branches a−:(0,1)→(0,1) and a+:(0,∞)→(1,∞), with a−′(t)<0<a+′(t). Taking s=0 and t=1/γ∈(0,1) in its solution formula and using the designated roots in Degree large-deviation rate function and roots gives c±(γ)=a±(1/γ)−1 for every γ>1.

[F5]

Sum, product, quotient, and chain rules from difference quotients supplies the sum, product, quotient and chain rules for real functions differentiable at the indicated points, with nonzero denominators for quotients and compositions defined near those points. It also gives the positive-integer power rule and differentiability implies continuity. Constant functions have derivative zero directly from their zero difference quotients.

[F6]

By Cᵏ Euclidean maps and diffeomorphisms and Cᵏ maps and multi-index derivative notation in Euclidean space, a scalar function on an open real interval is smooth when its derivatives of every finite order exist and are continuous.

Proof

Given: Real γ>1, with h and the root branches as in the Statement.

Goal: Prove the stated branch geometry, root properties, endpoint values and strict asymmetry.

1.1F1F2

Substitute a=1+c in F2. This gives the stated monotonicity and ranges of h, with 1 the limit at the excluded endpoint c=−1. Since 0<1/γ<1, the two ranges and strict monotonicity give exactly one root in each of (−1,0) and (0,∞) and no others.

1.2F1F2F4F5

For −1<x<1 set D(x)=h(x)−h(−x)=I(1+x)−I(1−x). The affine inner maps have derivatives 1 and −1 by F5. Thus F2 and F5 make D differentiable, hence continuous, on (−1,1), with D′(x)=log⁡(1+x)+log⁡(1−x)=log⁡(1−x2)<0 for 0<x<1. Here both logarithm arguments are positive and 0<1−x2<1, so F4 applies. Also D(0)=0. On every segment [0,x] with 0<x<1, F4 therefore gives D(x)<D(0), or h(x)<h(−x).

1.3F3F5F6

Put r(γ)=1/γ on (1,∞). F5 gives r′(γ)=−1/γ2, and induction using its quotient and positive-integer power rules gives r(k)(γ)=(−1)kk!/γk+1 for every integer k≥0. Every denominator is nonzero; each displayed derivative is itself differentiable by the same rules, hence continuous. Thus r is smooth by F6, and r((1,∞))=(0,1) lies in the domains of both inverse branches in F3.

2.1F1F3F5F6step 1.3

Fix either smooth branch a=a±. For each integer j≥0, F3 and F5 give (a(j)∘r)′=(a(j+1)∘r)r′. Every factor a(j)∘r is therefore differentiable, as is every derivative r(ℓ). Starting with a∘r, induction using F5 expresses every iterated derivative as a finite sum of constant multiples of finite products of these factors: differentiating a factor of the first type replaces it by (a(j+1)∘r)r′, and differentiating a factor of the second type replaces it by r(ℓ+1). Such sums and products remain differentiable and hence continuous by F5. Consequently a∘r and a∘r−1 are smooth by F6. F1 and F3 identify the latter functions with c±.

2.2F1F2F3step 1.1

Since 1/γ strictly decreases, the decreasing lower inverse makes c− strictly increase, while the increasing upper inverse makes c+ strictly decrease. For any 0<δ<1, F2 gives I(1−δ)>0 and I(1+δ)>0. Once 1/γ is smaller than both values, branch monotonicity places 1−δ<a−(1/γ)<1<a+(1/γ)<1+δ. Hence both roots tend to 0. The assigned values at γ=1 are −1 and e−1; the definition's justification establishes their continuity as endpoint extensions.

3.1F1step 1.1step 1.2∎

Put x=−c−(γ)∈(0,1). Then h(x)<h(−x)=1/γ=h(c+(γ)). Strict increase of h on [0,∞) implies x<c+(γ), proving the asymmetry and completing the proof.

Source attribution

The notation and the original assertions are attributed to the article, PDF page 32, equation (6.3), its following analysis and Figure 3. The article is not used as a proof premise.

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.

Sources