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.
At the critical quadratic ULA step size, no invariant law exists
Example
Let on and set in ULA. Then the update is for a fresh independent . This Markov kernel has no invariant probability law.
Facts & Assumptions
Given: AC; the ULA update for at .
AC is assumed in the standard-normal construction. The Axiom of Choice Standard normal and normal laws
For , , so the ULA update at is , with fresh independent . Unadjusted Langevin algorithm (ULA) Standard normal and normal laws
Affine maps and sums of independent variables transform characteristic functions by and by multiplication. Characteristic functions under affine maps and independent sums
Every characteristic function has , is continuous, and satisfies . Characteristic function of a real random variable Basic properties of characteristic functions
The standard normal characteristic function is . Characteristic function of a normal law
Verification
Given: The update and facts above.
Suppose for contradiction that an invariant probability exists and write for its characteristic function. Invariance of the kernel in [F1], together with the affine characteristic-function identity [F2] and the standard-normal characteristic function [F4], gives for every real ,
By [F3], . For each , the displayed identity implies , and forces . Thus vanishes at every nonzero , contradicting continuity at zero and from [F3]. No invariant probability can exist.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
43 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Alain Durmus and Éric Moulines, Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm, §3.3 (standard reference, not scraped)