Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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.

Independent events remain independent under complements

Statement

Let (Ai)iI be an independent family of events, and for each iI choose either Bi=Ai or Bi=Aic. Then the family (Bi)iI is independent.

Facts & Assumptions

Given: An independent family of events (Ai)iI and, for each iI, an event Bi equal to either Ai or Aic.

[L1]

Independence of events is the finite-intersection product identity (Independent sigma-algebras and independent events).

[L2]

Probabilities respect complements and set differences: P(Ec)=1P(E) and, for EF, P(FE)=P(F)P(E) (Basic identities for a probability measure).

Proof

technique · direct
1.1

It is enough to prove the claim for a fixed finite subfamily Ai0,,Ain1. We argue by induction on the number of complemented coordinates among Bi0,,Bin1.

givenL1
1.2

If no coordinate is complemented, the required factorization is exactly [L1].

L1
2.1

Assume the factorization is known whenever at most m coordinates are complemented, and suppose exactly m+1 are. Reindex so that Bin1=Ain1c, and put C:=k<n1Bik. Then CAin1C, so [L2] gives P(CAin1c)=P(C)P(CAin1). By the induction hypothesis, both terms on the right factor: P(C)=k<n1P(Bik) and P(CAin1)=(k<n1P(Bik))P(Ain1). Therefore P(CAin1c)=(k<n1P(Bik))(1P(Ain1))=(k<n1P(Bik))P(Ain1c). This is the desired factorization for the current finite family.

step 1.1step 1.2L2algebra
3.1

Steps 1.2 and 2.1 prove the inductive claim for every finite subfamily, so the family (Bi)iI is independent.

step 1.1step 1.2step 2.1L1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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