Alphabeta Math

Finite Probability and the Probabilistic Method — Examples and Counterexamples

About this page
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.

✓ 6 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Combinatorics
Linear Algebra
Measure Theory
Real Analysis
Set Theory
Topology
2 · Logical flowchart

3 · Items

Example

The expected number of triangles in G(n,p) is C(n, 3)p³

Example

First- and second-moment bounds for a nonempty Bernoulli random subset

Example

The random-colouring proof of R(k,k)>2^k/2

Example

Checking the symmetric local-lemma condition for a sparse uniform hypergraph

Example

A parameter ledger for the high-girth, high-chromatic alteration proof

Counterexample

Expectation equal to 1 does not force a nonnegative integer-valued variable to vanish somewhere

Sources