DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13

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.

Dependency digraphs for a finite family of bad events

Definition

Let $(A_{i})_{i \in I}$ be a finite family of events. A loopless digraph $D$ on $I$ is a dependency digraph for the family when, for every $i \in I$ and every set $S \subseteq I ∖ ({i} \cup N_{D}^{+} (i))$ , $P ⁣ (A_{i} \cap ⋂_{j \in S} A_{j}^{c}) = P (A_{i}) P ⁣ (⋂_{j \in S} A_{j}^{c}) .$ Thus $A_{i}$ is independent of every conjunction of complements indexed by its non-out-neighbours. An undirected dependency graph is the special case in which every edge is replaced by both directed arcs.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 9 results over 4 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, Section 5.1 (standard reference, not scraped)