Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 L, and pairwise disjoint subsets L1,…,Ls⊆L. For each j, let Ej be an event determined only by the indicators indexed by Lj. Prove that E1,…,Es are independent.

[F1]

Independent Local Quantum Fault Model: A fault pattern F has probability η∣F∣(1−η)∣L∖F∣.

[F2]

Fault Locations, Paths, and Rectangles: Distinct child rectangles used in the ordinary recursion have pairwise disjoint elementary-location sets.

[F3]

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

1.1givenF1F2

For each j, let Xj={0,1}Lj be the finite set of fault-indicator patterns on Lj, and let Aj⊆Xj be the patterns that realize Ej. The event Ej is the disjoint union of the pattern events {X∣Lj=xj} over xj∈Aj.

1.2F1F3

For any tuple xj∈Aj, the joint pattern event fixes one bit at each location in ⋃jLj. 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].

2.1step 1.1step 1.2algebra∎

Summing over the finite Cartesian product A1×⋯×As and distributing finite sums gives P(⋂j=1sEj)=∑x1∈A1,…,xs∈As∏j=1sP(X∣Lj=xj)=∏j=1s∑xj∈AjP(X∣Lj=xj)=∏j=1sP(Ej). Thus E1,…,Es 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