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 be a nonempty compact metric space and let be Borel probability measures on . Let be lower semicontinuous, meaning that is open for every real , and not identically . Assume the speed- large-deviation bounds with and . Let be continuous and put For Borel , define the normalized exponential tilt Here a good rate function is a lower semicontinuous map whose sublevel sets are compact for every real . Then is finite and positive, and satisfies a speed- large-deviation principle with the good rate function . Its zero set is precisely , with .
Facts & Assumptions
Given: The compact metric space, measures, rate function, LDP bounds, and continuous tilt in the Statement.
The LDP hypothesis is the open-set lower bound and closed-set upper bound written in the Statement, at speed .
is nonempty compact metric, is lower semicontinuous in the superlevel-set sense defined in the Statement with at least one finite value, and is continuous. Here compactness means that every cover of by sets open in its metric topology has a finite subcover. For an extended-real function , upper semicontinuity means that is open for every real .
Proof
For each integer , put . These sets are open by continuity of : if , continuity gives a neighborhood on which , hence . They cover because every real is less than some positive integer. By the finite-open-cover meaning of compactness in [A2], finitely many cover , with since is nonempty. Let ; then for every . Thus 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 is not identically , choose with . Therefore , so is finite. The integrand is bounded above and bounded below by the positive constant , and is a probability measure, hence and is a probability measure.
Let be open, let with , and let . Continuity of gives an open neighborhood with and for every . Hence . By [A1], the logarithm of this integral divided by has liminf at least . Taking the supremum over finite-rate and then proves the open-set integral lower bound .
Let be closed and put , with . If , its integral is zero and the required bound is immediate. Since is bounded and , either is finite or . Suppose first that is finite, and fix . For each with , lower semicontinuity of and continuity of give an open neighborhood on which and . Choose a ball centered at with . For each with , choose ; lower semicontinuity gives an open neighborhood on which , and choose such a ball . Take the family of all centered balls satisfying these conditions; it covers . A closed subset of compact is compact: adjoining to any relative open cover of gives an open cover of . Thus finitely many admissible balls suffice, and only finitely many centers and neighborhood witnesses are selected. Put for the resulting centers. Each is closed. At a finite-rate center, at an infinite-rate center, The integral over is bounded by the finite sum . Applying [A1] to each closed and using that a finite sum has logarithmic limsup no greater than its largest summand gives Letting proves the localized bound in this case. If , every point of has infinite . For any real , lower semicontinuity gives, at each , an open neighborhood with ; take all centered balls with closures in such neighborhoods and then a finite subcover of . The corresponding closed pieces then satisfy . The same finite-sum and LDP argument gives a logarithmic limsup at most . Since is arbitrary, this limsup is . Thus in all cases
Taking in step 1.2 and in step 1.3 gives and , proving the log-Laplace limit. The function is lower semicontinuous, is nonnegative by the definition of , and has compact sublevel sets because those sets are closed in compact . To prove attainment, set , which is upper semicontinuous and bounded above by . For every integer , the set is closed and nonempty by the definition of ; these sets are nested. Compactness gives : otherwise their open complements would cover , and a finite subcover would contradict that a nested finite intersection is nonempty. Every point of this intersection has for all , hence and therefore . Equality holds exactly when , so its nonempty zero set is precisely the stated maximizing set.
For open , apply the open-set integral lower bound from step 1.2 and subtract the log-normalizer limit in step 2.1. Since , this is the LDP lower bound for .
For closed , apply the closed-set integral upper bound from step 1.3 and subtract the log-normalizer limit in step 2.1. Since , this is the LDP upper bound for .
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.