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.
Conditional cauchy schwarz inequality
Statement
Assume AC. For real , almost surely.
Facts & Assumptions
Given: AC, real and a sub-sigma-algebra G.
XY is integrable because X and Y are square integrable. (Cauchy-Schwarz inequality for )
Integrable inputs have finite conditional versions under AC. (Conditional expectation as an ae class)
Conditional positivity and linearity hold. (Basic algebra and order properties of conditional expectation)
Rationals approximate every real parameter. (The rationals embed densely in the reals)
There are only countably many rational parameters. ( is countably infinite)
Proof
By [F1], XY is integrable. Fix finite versions , , and . Positivity gives almost surely. For every rational t, is integrable and nonnegative, and linearity and positivity give almost surely. By [F5] one null union removes every rational-parameter exception.
At a remaining point, the polynomial is continuous: , which tends to zero as . If q were negative at any real s, it would stay negative on an interval around s, containing a rational by [F4], contrary to step 1.1. Thus q is nonnegative for all real t.
If and , the choice gives , impossible; hence and . If , put to get , so again . The cases cover every remaining point and prove the conditional inequality.
Source notes
Durrett §4.1.2, Theorem 4.1.9(a)–(b), printed pp.210–211, supplies positivity and linearity. The conditional quadratic argument is written here in full, using rational parameters and explicit zero-coefficient handling.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
41 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
- Durrett, Probability: Theory and Examples, 5th ed. (standard reference, not scraped)