Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

Unions of overlapping independent events need not remain independent

Statement refuted

Whenever A and B are independent events, and C overlaps both of them, the unions AC and BC are also independent.

Facts & Assumptions

Given: The uniform four-point space Ω={00,01,10,11} and the events A:={00,01},B:={00,10},C:={00,11}.

[L1]

In a uniform finite space, event probability is cardinality divided by the total number of outcomes. (The uniform probability space on a nonempty finite set)

[L2]

Two events are independent exactly when P(EF)=P(E)P(F). (Independent events, pairwise independence, and mutual independence of a finite family)

Counterexample

technique · constructive
1.1

By [L1], the events A and B have probability 1/2, and AB={00} has probability 1/4. Hence A and B are independent by [L2]. Also C overlaps both of them because 00AC and 00BC.

L1L2construct
2.1

The unions are AC={00,01,11},BC={00,10,11}, so each has probability 3/4, while (AC)(BC)={00,11} has probability 1/2.

step 1.1L1
3.1

Since P((AC)(BC))=12916=3434, [L2] shows that AC and BC are not independent. This refutes the statement.

step 2.1L2discharge-construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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.