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.
Rate Distortion and Lossy Source Coding — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Computational foundations: factorization, KL, and optimization
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugate families and Gaussian conditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Finite-Alphabet Entropy and Divergence
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian Orthogonal Decomposition and Quadratic Forms
- Gaussian-process priors and finite posterior laws
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measure-Theoretic Information and Conditioning
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Quantum Communication and Fingerprinting
- Radon Measures and the Riesz Markov Kakutani Theorem
- Rate Distortion and Lossy Source Coding
- Reeb Stability and Global Foliation Constructions
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
The examples compute a binary Hamming curve and a two-coordinate Gaussian waterline. The counterexample records a zero-rate Gaussian optimizer whose reconstruction is a point mass, with no Lebesgue density. They use the A-page conventions for standard-Borel mutual information, bits, and squared-error distortion.
Source trail
- MIT OpenCourseWare 6.441, Chapters 23 and 25 (Chapter 23, Chapter 25), §§25.1.1 and 25.1.2: Bernoulli/Hamming and Gaussian squared-error formulas.
- Thomas M. Cover and Joy A. Thomas, Elements of Information Theory, 2nd ed. (full text), §§10.3.1 and 10.3.3: binary Hamming and Gaussian vector water-filling.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Binary Hamming rate-distortion curve at p equals one quarter
Statement
For a Bernoulli- source with Hamming distortion, the rates at are respectively , , and . At , the backward test-channel reproduction mass is ; at , a constant zero reproduction attains rate zero. The rate tends continuously to zero as .
Facts & Assumptions
Given: A Bernoulli source with parameter , binary Hamming distortion, and the rate function of the binary theorem.
Binary Hamming rate-distortion function: for , ; above that threshold the rate is zero.
Proof
Here . Substitution in [F1] gives and . At , the threshold branch gives zero; the constant reconstruction zero has distortion and carries no information.
For , put , which equals or , respectively. Construct independent and on their finite product space and set . Then and . Given either value of , the two conditional source masses are and in some order. Thus the finite joint-information sum is , with zero terms omitted. These channels attain the rates in step 1.1; in particular the backward test channel at has reproduction mass .
The function is continuous on under , so . This verifies the stated endpoint continuity.
A Gaussian rate-distortion optimizer need not have a density
Statement
Let with , use squared-error distortion, and choose . The constant reconstruction attains the Gaussian information rate-distortion value zero, but its law has no density with respect to Lebesgue measure.
Facts & Assumptions
Given: AC, a nondegenerate centered Gaussian source, squared-error distortion, and .
The Axiom of Choice: the Gaussian rate-distortion supplier assumes AC.
General single-letter information rate-distortion function: the information rate is the infimum of mutual information over joint laws meeting the expected-distortion constraint.
Mutual information for standard-Borel random elements: mutual information is the joint-law KL from the product of the marginals.
Gaussian squared-error rate-distortion function: for , the Gaussian squared-error information rate is zero.
The measure with density relative to : having a density with respect to Lebesgue measure requires absolute continuity with respect to that measure.
Proof
The constant choice has expected distortion . Since is constant, , so [F2] gives mutual information zero. By [F3], zero is the minimum rate; hence this reconstruction is optimal.
The singleton has Lebesgue measure zero but . Thus is not absolutely continuous with respect to Lebesgue measure and, by [F4], cannot have a Lebesgue density.
Finite Gaussian-vector distortion waterline
Statement
Assume AC. Let and be independent, and use total squared-error budget . The water level is , the optimal coordinate distortions are , and the information rate is bits per vector. An attaining reconstruction is , , where for standard normals that are mutually independent and jointly independent of .
Facts & Assumptions
Given: Independent centered Gaussian coordinates of variances 4 and 1, squared-error budget , and AC.
Finite Gaussian water-level allocation: the optimum allocates with unique satisfying the total-distortion equation.
Finite-dimensional Gaussian vector squared-error rate-distortion function: for independent Gaussian coordinates, the standard-Borel information rate in bits is the half-sum of positive log variance-to-water-level ratios.
Mutual information for standard-Borel random elements and Kullback–Leibler divergence: mutual information in nats is joint-law KL from the product of the marginals, computed as the joint expectation of the log Radon–Nikodym density.
Standard normal and normal laws and Orthogonal transformations preserve the standard normal product law: normal laws are scaled standard-normal laws, and orthogonal transforms preserve independent standard normals under AC.
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique and Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: finite independent product laws exist; independent variables with densities have the product density, as verified by integration on rectangles and uniqueness.
A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: an invertible linear change of variables transforms densities by the absolute inverse determinant. Its Countable Choice hypothesis follows from AC by restricting a choice function to a countable family.
Proof
Since , the water-level equation is , so . The allocated distortions are . By [F1]–[F2],
Put and . Choose independent standard normals by [F5], and set , , . The matrix with rows and is orthogonal, so [F4] gives , independently of . The errors are and , with total mean square .
Write for the density. By [F4]–[F6], has density . Relative to Lebesgue measure in times the point mass at , the joint law and product of the marginals therefore have respective positive densities and . Their log ratio is It is integrable since both quadratic terms have finite expectations. By [F3] and step 1.2 its joint expectation is nats. Dividing by yields the rate in step 1.1, proving attainment without assuming a Lebesgue density for the constant reconstruction coordinate.