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.
Variance of dyadic quadratic variation
Example
With the notation of Expected dyadic quadratic variation, the dyadic quadratic sum over has so in as .
Facts & Assumptions
Given: AC, a standard Brownian motion , , with and .
The increments over disjoint intervals are independent with laws , and , for an increment of length . Brownian motion Gaussian even moments for Brownian increments
The mean of the dyadic sum is . Expected dyadic quadratic variation
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
Verification
For each , [F1] gives .
The variables are functions of increments over disjoint intervals, hence independent by [F1], so the variance of the sum is the sum of the variances: .
Since by [F2], , which is the convergence .
The cases are covered: the independence of the squared increments is the only place where the joint law is used; the value is included and gives ; the limit is taken as with fixed and positive; and AC enters only through [F3].
Source notes
Lawler, Theorem 2.8.1, obtains the variance of the quadratic sums from the fourth Gaussian moment and the independence of the increments, giving the mean-square convergence used in the dyadic quadratic-variation theorem.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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
- Gregory F. Lawler, Stochastic Calculus: An Introduction with Applications, Theorem 2.8.1 (standard reference, not scraped)