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.
Disjoint Fault-Location Events Are Independent
Statement
In the independent local fault model, events determined by pairwise disjoint finite sets of location fault indicators are mutually independent. In particular, bad-rectangle events determined only by the faults in pairwise disjoint child rectangles are independent.
Facts & Assumptions
Given: A finite set of independent Bernoulli fault indicators indexed by , and pairwise disjoint subsets . For each , let be an event determined only by the indicators indexed by . Prove that are independent.
Independent Local Quantum Fault Model: A fault pattern has probability .
Fault Locations, Paths, and Rectangles: Distinct child rectangles used in the ordinary recursion have pairwise disjoint elementary-location sets.
Independent families of event classes: For distinct event classes, every finite intersection of chosen events has probability equal to the product of their probabilities.
Proof
For each , let be the finite set of fault-indicator patterns on , and let be the patterns that realize . The event is the disjoint union of the pattern events over .
For any tuple , the joint pattern event fixes one bit at each location in . The product fault law [F1] gives its probability as the product of the one-location bit probabilities; this is the finite-intersection condition in [F3].
Summing over the finite Cartesian product and distributing finite sums gives . Thus are mutually independent.
Depends on
Used by
Dependency tree · two levels
6 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
- D. Aharonov and M. Ben-Or, Fault-Tolerant Quantum Computation With Constant Error (standard reference, not scraped)