Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-12
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.

A Chernoff bound for sums of independent Bernoulli trials

Statement

Let X1,…,Xk be independent Bernoulli(p) random variables, let S:=X1+⋯+Xk, let μ:=pk, and let 0<α<1. Then

P ⁣(S≤(1−α)μ)≤exp⁡ ⁣(−α2μ2).

Facts & Assumptions

Given: independent Bernoulli(p) variables X1,…,Xk, their sum S, and a parameter 0<α<1.

[L1]

Markov's inequality applies to every nonnegative random variable (Markov's inequality on a finite probability space).

[L3]

The expectation of a product factors over finite independent families (Expectation factors over a finite product of mutually independent random variables).

Proof

technique · direct
1.1L1given

Fix λ>0 and apply [L1] to the nonnegative variable e−λS. Because e−λt decreases with t, we get P(S≤(1−α)μ)≤eλ(1−α)μ E[e−λS].

1.2L2L3algebra

Since S=∑iXi, we have e−λS=∏ie−λXi. The family (e−λXi)i is still independent, so [L3] and [L2] give E[e−λS]=∏i=1kE[e−λXi]=((1−p)+pe−λ)k≤exp⁡(−μ(1−e−λ)), using 1−u≤e−u with u=p(1−e−λ).

2.1step 1.1step 1.2choosealgebra

Combine steps 1.1 and 1.2, and choose λ so that e−λ=1−α. Then P(S≤(1−α)μ)≤exp⁡(μ(−(α)+(1−α)log⁡11−α)).

3.1step 2.1algebra∎

Define g(α):=−(α)+(1−α)log⁡11−α+α2/2. Then g(0)=0 and g′(α)=α+log⁡(1−α)≤0 because log⁡(1−α)≤−α for 0<α<1. Hence g(α)≤0, which is exactly −(α)+(1−α)log⁡11−α≤−α2/2. Substituting this into step 2.1 gives the claimed bound.

Depends on

Used by

Dependency tree · two levels

18 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