Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Compact-space Laplace principle and exponential tilting

Statement

Let (K,dK) be a nonempty compact metric space and let (μn)n≥1 be Borel probability measures on K. Let I:K→[0,+∞] be lower semicontinuous, meaning that {x∈K:I(x)>a} is open for every real a, and not identically +∞. Assume the speed-n large-deviation bounds lim inf⁡n→∞1nln⁡μn(G)≥−inf⁡x∈GI(x)for every open G⊆K, lim sup⁡n→∞1nln⁡μn(C)≤−inf⁡x∈CI(x)for every closed C⊆K, with inf⁡∅=+∞ and ln⁡0=−∞. Let F:K→R be continuous and put Zn:=∫KenF(x) dμn(x),c:=sup⁡x∈K(F(x)−I(x)). For Borel B⊆K, define the normalized exponential tilt νnF(B):=Zn−1∫BenF(x) dμn(x). Here a good rate function is a lower semicontinuous map J:K→[0,+∞] whose sublevel sets {x:J(x)≤a} are compact for every real a. Then Zn is finite and positive, lim⁡n→∞1nln⁡Zn=c, and (νnF) satisfies a speed-n large-deviation principle with the good rate function IF(x):=I(x)−F(x)+c. Its zero set is precisely argmax⁡x∈K(F(x)−I(x)):={x∈K:F(x)−I(x)=c}, with F(x)−(+∞):=−∞.

Facts & Assumptions

Given: The compact metric space, measures, rate function, LDP bounds, and continuous tilt in the Statement.

[A1]

The LDP hypothesis is the open-set lower bound and closed-set upper bound written in the Statement, at speed n.

[A2]

K is nonempty compact metric, I is lower semicontinuous in the superlevel-set sense defined in the Statement with at least one finite value, and F is continuous. Here compactness means that every cover of K by sets open in its metric topology has a finite subcover. For an extended-real function f, upper semicontinuity means that {x:f(x)<a} is open for every real a.

Proof

1.1A2choose

For each integer m≥1, put Um:={x∈K:∣F(x)∣<m}. These sets are open by continuity of F: if x∈Um, continuity gives a neighborhood on which ∣F(y)−F(x)∣<m−∣F(x)∣, hence ∣F(y)∣<m. They cover K because every real ∣F(x)∣ is less than some positive integer. By the finite-open-cover meaning of compactness in [A2], finitely many Um1,…,Umk cover K, with k≥1 since K is nonempty. Let M:=max⁡{m1,…,mk}; then −M<F(x)<M for every x∈K. Thus F is bounded above and below. This uses the explicitly defined cover and a maximum of finitely many integers, without any simultaneous choice of pointwise neighborhoods. Since I is not identically +∞, choose x0∈K with I(x0)<+∞. Therefore F(x0)−I(x0)≤c≤sup⁡KF<+∞, so c is finite. The integrand enF is bounded above and bounded below by the positive constant eninf⁡KF, and μn is a probability measure, hence 0<Zn<+∞ and νnF is a probability measure.

1.2A1A2algebra

Let G⊆K be open, let x∈G with I(x)<+∞, and let ε>0. Continuity of F gives an open neighborhood U with x∈U⊆G and F(y)>F(x)−ε for every y∈U. Hence ∫GenF dμn≥en(F(x)−ε)μn(U). By [A1], the logarithm of this integral divided by n has liminf at least F(x)−ε−inf⁡UI≥F(x)−ε−I(x). Taking the supremum over finite-rate x∈G and then ε↓0 proves the open-set integral lower bound lim inf⁡nn−1ln⁡∫GenF dμn≥sup⁡x∈G(F(x)−I(x)).

1.3A1A2choosealgebra

Let C⊆K be closed and put cC:=sup⁡x∈C(F(x)−I(x)), with sup⁡∅=−∞. If C=∅, its integral is zero and the required bound is immediate. Since F is bounded and I≥0, either cC is finite or cC=−∞. Suppose first that cC is finite, and fix ε>0. For each x∈C with I(x)<+∞, lower semicontinuity of I and continuity of F give an open neighborhood Vx on which F≤F(x)+ε and I≥I(x)−ε. Choose a ball Ux centered at x with U‾x⊆Vx. For each x∈C with I(x)=+∞, choose M>sup⁡KF−cC+1; lower semicontinuity gives an open neighborhood Vx on which I>M, and choose such a ball Ux. Take the family of all centered balls satisfying these conditions; it covers C. A closed subset C of compact K is compact: adjoining K∖C to any relative open cover of C gives an open cover of K. Thus finitely many admissible balls suffice, and only finitely many centers and neighborhood witnesses are selected. Put Cj:=C∩U‾xj for the resulting centers. Each Cj is closed. At a finite-rate center, sup⁡CjF−inf⁡CjI≤F(xj)−I(xj)+2ε≤cC+2ε; at an infinite-rate center, sup⁡CjF−inf⁡CjI≤sup⁡KF−M<cC−1. The integral over C is bounded by the finite sum ∑jensup⁡CjFμn(Cj). Applying [A1] to each closed Cj and using that a finite sum has logarithmic limsup no greater than its largest summand gives lim sup⁡n1nln⁡∫CenF dμn≤cC+2ε. Letting ε↓0 proves the localized bound in this case. If cC=−∞, every point of C has infinite I. For any real M, lower semicontinuity gives, at each x∈C, an open neighborhood Vx with I>M; take all centered balls with closures in such neighborhoods and then a finite subcover of C. The corresponding closed pieces Cj then satisfy sup⁡CjF−inf⁡CjI≤sup⁡KF−M. The same finite-sum and LDP argument gives a logarithmic limsup at most sup⁡KF−M. Since M is arbitrary, this limsup is −∞=cC. Thus in all cases lim sup⁡n1nln⁡∫CenF dμn≤sup⁡x∈C(F(x)−I(x)).

2.1A2step 1.1step 1.2step 1.3algebra

Taking G=K in step 1.2 and C=K in step 1.3 gives lim inf⁡nn−1ln⁡Zn≥c and lim sup⁡nn−1ln⁡Zn≤c, proving the log-Laplace limit. The function IF=I−F+c is lower semicontinuous, is nonnegative by the definition of c, and has compact sublevel sets because those sets are closed in compact K. To prove attainment, set f:=F−I, which is upper semicontinuous and bounded above by sup⁡KF. For every integer k≥1, the set Ak:={x∈K:f(x)≥c−1/k} is closed and nonempty by the definition of c; these sets are nested. Compactness gives ⋂k≥1Ak≠∅: otherwise their open complements would cover K, and a finite subcover would contradict that a nested finite intersection is nonempty. Every point of this intersection has f(x)≥c−1/k for all k, hence f(x)≥c and therefore f(x)=c. Equality IF(x)=0 holds exactly when F(x)−I(x)=c, so its nonempty zero set is precisely the stated maximizing set.

3.1step 1.2step 2.1algebra

For open G⊆K, apply the open-set integral lower bound from step 1.2 and subtract the log-normalizer limit in step 2.1. Since sup⁡G(F−I)−c=−inf⁡GIF, this is the LDP lower bound for νnF.

4.1step 1.3step 2.1algebra∎

For closed C⊆K, apply the closed-set integral upper bound from step 1.3 and subtract the log-normalizer limit in step 2.1. Since sup⁡C(F−I)−c=−inf⁡CIF, this is the LDP upper bound for νnF.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources