Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Sanov's Theorem

Probability and Statistics

Sanov's Theorem gives a large deviations principle for the empirical distribution of independent, identically distributed random variables, stating that the probability the empirical distribution lies close to some other fixed distribution decays exponentially in the sample size, at a rate given by the relative entropy, or Kullback-Leibler divergence, between that fixed distribution and the true underlying distribution. Named for Ivan Sanov, it is a foundational result of large deviations theory quantifying how unlikely a systematic deviation of the sample from the true distribution actually is.

Facts
Statement
A bound on the probability of observing an atypical sequence of samples from a given probability distribution. 1
Proof Year
1957 1
Classification
Statement Form
Inequality 1
Connections

Has Statement Form

Inequality, Concepts

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

In Branch

Source Sanov's theorem (Wikipedia)
Sources
1. Sanov's theorem (Wikipedia)
  • Introduction
    Sanov's theorem gives a bound on the probability of observing an atypical sequence of samples from a given probability distribution.
  • References
    Sanov, I. N. (1957) 'On the probability of large deviations of random variables'.
  • In Branch: Information Theory, Lead sentence
    In mathematics and information theory, Sanov's theorem gives a bound on the probability of observing an atypical sequence of sampl
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.