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.
The lambda-system generated by a pi-system is closed under finite intersections
Statement
If is a pi-system on , then its generated lambda-system is closed under binary intersections.
Facts & Assumptions
Given: A pi-system on and .
A pi-system is nonempty and closed under binary intersections (Pi-systems).
The family is the smallest lambda-system on containing (The generated lambda-system exists and is minimal).
For in a lambda-system , the family is a lambda-system (For a member A of a lambda-system D, the sets B with A intersection B in D form a lambda-system).
Proof
Fix . By [L3], is a lambda-system. If , then by [L1] and [L2], so . Minimality in [L2] yields .
Now fix . Symmetry of intersection and step 1.1 show for every , so . By [L3] and [L2], is a lambda-system containing and therefore contains .
Thus for arbitrary one has , which means .
Depends on
Used by
- Dynkin's pi-lambda theorem Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 5 results over 3 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- A. Dembo, Probability Theory lecture notes, proof of Theorem 1.1.38 (standard reference, not scraped)