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.
For independent random signs, for
Statement
Let be mutually independent uniform random signs, where , and put . For every ,
Facts & Assumptions
Given: Independent random signs, , their sum , and .
Markov gives for nonnegative and (Markov's inequality on a finite probability space).
On the finite probability space, expectations can be computed by grouping the attained values. (Expectation is the sum of each attained value times its probability)
A uniform sign satisfies (For a uniform random sign , ).
The exponential is strictly increasing (The exponential function is strictly increasing).
Probability of a finite union is at most the sum of the probabilities (The finite union bound).
Mutual independence is the factorization of all joint attained-value probabilities (Pairwise and mutual independence of finite-valued random variables).
Finite sums can be reindexed and factored over finite Cartesian products. (Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule)
for real . (The exponential addition formula )
Proof
For every real , [L2] groups the finite outcome sum by the sign tuple . Mutual atom independence [L6] and exponential addition [L8] give where finite Fubini [L7] justifies the middle equality. All sums and factors are finite.
For , strict monotonicity gives , so [L1] gives .
By step 1.1 and [L3], .
Choose . Substitution in steps 1.2 and 2.1 gives .
Negation merely relabels the two attained values of each sign, so the joint-value factorization in [L6] shows that the variables are again mutually independent uniform signs. Step 3.1 applied to gives the same bound for .
Since , [L5] and steps 3.1 and 4.1 give the result. The excluded boundary would only give the valid but uninformative bound .
Depends on
- Pairwise and mutual independence of finite-valued random variables
- Markov's inequality on a finite probability space
- Expectation is the sum of each attained value times its probability
- Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule
- The exponential addition formula $\exp(x+y)=\exp(x)\exp(y)$
- For a uniform random sign $\varepsilon$, $\mathbb E[e^{t\varepsilon}]\le e^{t^2/2}$
- The exponential function is strictly increasing
- The finite union bound
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
40 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
- J. Matousek and J. Vondrak, The Probabilistic Method, Section 7.1 (standard reference, not scraped)
- Y. Zhao, MIT 18.218 Probabilistic Method in Combinatorics, Section 4.1 (standard reference, not scraped)