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)i∈I be an independent family of events, and for each i∈I choose either Bi=Ai or Bi=Aic. Then the family (Bi)i∈I is independent.

Facts & Assumptions

Given: An independent family of events (Ai)i∈I and, for each i∈I, 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)=1−P(E) and, for E⊆F, P(F∖E)=P(F)−P(E) (Basic identities for a probability measure).

Proof

technique · direct
1.1givenL1

It is enough to prove the claim for a fixed finite subfamily Ai0,…,Ain−1. We argue by induction on the number of complemented coordinates among Bi0,…,Bin−1.

1.2L1

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

2.1step 1.1step 1.2L2algebra

Assume the factorization is known whenever at most m coordinates are complemented, and suppose exactly m+1 are. Reindex so that Bin−1=Ain−1c, and put C:=⋂k<n−1Bik. Then C∩Ain−1⊆C, so [L2] gives P(C∩Ain−1c)=P(C)−P(C∩Ain−1). By the induction hypothesis, both terms on the right factor: P(C)=∏k<n−1P(Bik) and P(C∩Ain−1)=(∏k<n−1P(Bik))P(Ain−1). Therefore P(C∩Ain−1c)=(∏k<n−1P(Bik))(1−P(Ain−1))=(∏k<n−1P(Bik))P(Ain−1c). This is the desired factorization for the current finite family.

3.1step 1.1step 1.2step 2.1L1∎

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

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