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.
Indicators turn event probabilities, intersections, and finite counts into expectations and products
Statement
For every event , . For every finite family , and is the number of events that contain . The empty product is and the empty sum is .
Facts & Assumptions
Given: Events and in one finite probability space.
The indicator of an event is on the event and off it (The indicator random variable of an event).
Expectation is the finite weighted sum over outcomes (Expectation of a real random variable on a finite probability space).
Empty finite sums and products are and (Finite sums and finite products, by recursion).
Proof
Expanding leaves exactly the weights of outcomes in , hence equals .
At an outcome , the product is exactly when belongs to every , and is otherwise .
At , each summand contributes one exactly when , so their sum counts those events.
Steps 1.2 and 1.3 also give the stated empty conventions by [L3].
Depends on
Used by
- The expected number of triangles in G(n,p) is binom n3p³ Example
- The expected number of cycles of length at most ℓ in G(n,p) Lemma
- Every finite graph with m edges has a cut containing at least m/2 edges Theorem
- Every k-uniform hypergraph with fewer than 2ᵏ⁻¹ edges is 2-colourable Theorem
- Every nonempty finite set of n nonzero integers has a sum-free subset of size greater than n/3 Theorem
- Markov's inequality on a finite probability space Theorem
- Szele's bound: for every n≥1, some n-vertex tournament has at least n!/2ⁿ⁻¹ Hamilton paths Theorem
- The finite second-moment bound ℙ(X≠0)geE[X]²/E[X²] when E[X²]>0 Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 28 results over 12 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
- J. Matousek and J. Vondrak, The Probabilistic Method, Lemma 3.1.3 (standard reference, not scraped)
- M. Bucic, Probabilistic Method, Section 2.1 (standard reference, not scraped)