Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13
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.

Bayes' theorem over a finite partition

Statement

Let B0,,Bn1 be a finite partition with P(Bi)>0 for every i<n. If P(A)>0, then for every j<n, P(BjA)=P(ABj)P(Bj)i<nP(ABi)P(Bi).

Facts & Assumptions

Given: A finite partition, an event A of positive probability, and an index j<n as in the Statement.

[L1]

The multiplication rule gives P(AB)=P(AB)P(B) whenever P(B)>0 (The multiplication rule and finite chain rule for conditional probability).

[L2]

The law of total probability gives P(A)=iP(ABi)P(Bi) (The law of total probability for a finite partition).

Proof

technique · direct
1.1

By conditional probability and symmetry of intersection, P(BjA)=P(ABj)/P(A).

L1
2.1

The numerator in step 1.1 is P(ABj)P(Bj), and [L2] is the denominator.

L1L2
3.1

Substitution yields the formula; its denominator is positive because it equals P(A)>0.

step 1.1step 2.1algebra

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 9 results over 5 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources