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.
Latent-variable EM and likelihood ascent — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Computational foundations: factorization, KL, and optimization
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- 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
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Latent-variable EM and likelihood ascent
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- 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
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- 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
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- 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 Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
These examples calculate finite-mixture responsibilities and a nonmaximizing generalized step, then isolate three boundaries of the ascent identity: tied likelihood maxima with nonconvergent exact selections, an unbounded Gaussian-mixture likelihood under covariance collapse, and a candidate that loses the current latent support. The examples assert no general convergence or finite-sample optimality property.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Responsibilities in a two-component mixture
Example
Let with its Borel sigma-algebra and Lebesgue measure, and let latent labels have the power-set sigma-algebra and counting measure. Set and ; both are probability densities. For mixture weights , define the complete-data density . At the observation , the observed density is and the conditional latent-label probabilities are . For any positive candidate weights , the EM auxiliary function is the responsibility-weighted complete-data log density.
Facts & Assumptions
Given: The two component densities, current weights , observation , and a candidate weight vector with positive coordinates summing to one.
Latent-variable joint and observed-data factorization: a jointly measurable complete-data density is normalized over observation and latent coordinates; its observed marginal is the latent-coordinate integral.
The observed density is the latent marginal under Tonelli: the observed density is that integral, and its positive finite fibers normalize the quotient to a latent probability density.
Bayes formula for dominated kernels: for a proper latent prior and a jointly measurable dominated sampling density, the posterior on a positive finite evidence fiber is prior times likelihood divided by the marginal evidence.
Conditional density formula: the normalized quotient on a positive finite fiber is a conditional distribution of the latent coordinate given the observation.
Expectation-maximization: is the current conditional expectation of ; this E-step formula is choice-free, and AC is used only by the KL-based candidate test.
Verification
Each integrates to one, so is a probability density on because . At , and , hence the observed density is .
The latent conditional weights are by [F2] and [F3], giving and .
Using this conditional law in the definition [F5] yields . The two coefficients are exactly the current responsibilities, so this is the complete-data log density averaged over the latent label. By [F4], these weights are also the conditional probabilities for the observation fiber.
A generalized EM step can increase Q without maximizing it
Example
Let with its Borel sigma-algebra, and let with the power-set sigma-algebra and counting measure. Under parameter , take independent Bernoulli variables, so . Observe at current value . The candidate strictly increases but is not its exact maximizer; the observed log likelihood also increases.
Facts & Assumptions
Given: AC for the finite-KL admissibility branch, the displayed two-coordinate Bernoulli model, observation , current parameter , and candidate .
The Axiom of Choice: AC supplies the Radon–Nikodym branch needed to evaluate finite KL when the current law is absolutely continuous with respect to the candidate law.
Latent-variable joint and observed-data factorization: each parameter fiber of a complete-data density integrates to one over observed and latent coordinates.
The observed density is the latent marginal under Tonelli: integrating out the latent coordinate gives the observed-data density, and positive finite fibers yield a normalized conditional density.
Kullback–Leibler divergence: under AC, is directional and uses the Radon–Nikodym derivative when .
Expectation-maximization: averages the complete-data log density under the current latent law; exact mode selects an attained maximizer over an admissible candidate set containing the current iterate.
Verification
For every , summing over gives . At , and the conditional law of is Bernoulli, so the current law is Bernoulli. Every candidate has positive finite marginal, the same two-point latent support, and is finite by [A1, F3]. Their complete-data log values are finite, so every is admissible by [F4].
Averaging under that current conditional law gives . At , this is ; at , it is . Their difference is , so the candidate strictly raises .
For , , with equality only at . Thus the exact maximizer of is , so is a genuinely nonmaximizing generalized step. The observed log-likelihood difference is .
An EM likelihood with two strict local maxima
Example
Let with its Borel sigma-algebra, and let with the power-set sigma-algebra and counting measure. Set For the observed value , the likelihood has strict local maxima at and , and both points are global maximizers. Starting at , the exact Q maximizer set at either point contains both points. The fixed selector therefore produces the infinite sequence , which does not converge.
Facts & Assumptions
Given: AC, the displayed finite latent model and the fixed observation .
The Axiom of Choice: AC is required by the cited observed-likelihood ascent theorem used to contextualize the example.
Latent-variable joint and observed-data factorization: a complete-data density is normalized on each parameter fiber.
The observed density is the latent marginal under Tonelli: the observed density is the latent marginal, and its positive finite fibers define normalized latent conditional densities.
Expectation-maximization: exact mode selects an attained Q maximizer over an admissible set containing the current iterate.
EM does not decrease the observed log likelihood: every admissible exact update with nondecreasing Q does not decrease the observed log likelihood.
Likelihood ascent alone gives no global optimality or convergence conclusion: the ascent theorem supplies no unique-mode or parameter-convergence conclusion.
Verification
Since on , . Thus is nonnegative and sums to one over for every . The observed density at is .
The squared term vanishes exactly at and is positive elsewhere. Therefore , and hence the observed likelihood and log likelihood, have strict local maxima at those two distinct parameter values; both are global maximizers with equal value, so neither is a strict global maximum.
For every current value , the latent conditional law is uniform on . For any candidate , , so its exact maximizer set is again . Starting from , choosing at each step is an attained exact M-step; all fibers have positive finite marginals and identical latent support, with finite Q and KL. The algorithm therefore emits the infinite alternating sequence, which has no limit while its log likelihood is constant. This verifies the limitation described in [F5] without contradicting the one-step ascent result [F4].
Gaussian mixture likelihood is unbounded under covariance collapse
Example
Assume AC. Use with its Borel sigma-algebra as the scale parameter space, with the first component's standard deviation; let with its Borel sigma-algebra and Lebesgue measure, and let latent labels have the power-set sigma-algebra and counting measure. Let for , the density of from A positive-variance normal law has its location-scale density. Put , , , and . For two independent observations and their two latent labels, use the complete-data density relative to Lebesgue measure on and counting measure on : Its one-observation marginal is the two-component mixture For observations the likelihood is . The Gaussian components are proper for every positive , but as , so this observed likelihood has no finite global maximizer.
Facts & Assumptions
Given: AC, the displayed Gaussian densities, mixture weights , observations , the two-label product model above, and the parameter .
The Axiom of Choice: AC is the hypothesis of the positive-variance normal location-scale density result used below.
A positive-variance normal law has its location-scale density: under AC, has Lebesgue density for every and .
Latent-variable joint and observed-data factorization: a complete-data density must be jointly measurable and normalized on each parameter fibre; its observed marginal is obtained by integrating over the latent coordinate.
EM does not decrease the observed log likelihood: the proved EM conclusion is a one-step nondecrease on admissible fibers and does not assert existence of a global likelihood maximum.
Likelihood ascent alone gives no global optimality or convergence conclusion: likelihood ascent alone supplies no global-optimality or convergence theorem.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for a nonnegative product-measurable function on sigma-finite measure spaces, the product integral equals either iterated integral.
Verification
For each fixed label pair the displayed density is continuous in on ; the finite label space therefore makes it jointly measurable. For each observation coordinate, by [F1]. Lebesgue measure and finite counting measure are sigma-finite, so Tonelli [F5] gives integral for the nonnegative two-coordinate product density. This verifies the requirements of [F2] directly. Summing over the two labels in each coordinate gives the observed joint density , so its value at is .
At the two observations, and . Thus . For every , choosing gives , so the likelihood is unbounded while each fixed- value is finite. No finite parameter attains a global maximum.
This is compatible with [F3]–[F4]: the ascent theorem only compares consecutive admissible iterates; it neither bounds the likelihood sequence nor supplies a parameter attaining its unbounded supremum.
A support-losing candidate has infinite directional KL
Example
Let with its Borel sigma-algebra, let the observation space be the singleton with counting measure, and let the latent space be with counting measure. Set and . At current value , the latent law is ; candidate has latent law . The observed marginal is one at both parameters, but the current-to-candidate KL divergence is infinite. The extended diagnostic integral of under the current latent law is when ; the algorithm's is undefined because its Definition assigns only when the integral is finite.
Facts & Assumptions
Given: The displayed finite complete-data model, fixed observation , current value , candidate value , and the convention .
Latent-variable joint and observed-data factorization: a complete-data density is normalized over the observation and latent coordinates for every parameter.
Kullback–Leibler divergence: if the first probability is not absolutely continuous with respect to the second, the directional divergence is ; this branch uses no Radon–Nikodym representative or Axiom of Choice.
Expectation-maximization: Q is defined only when its integral is finite; admissibility requires finite directional KL and integrability of the candidate log density, and the rejection branch is choice-free while the finite-KL branch assumes AC.
Verification
For each , the complete-data masses sum to , and the observed marginal is . The current and candidate latent laws are therefore and .
The singleton set has -mass zero and -mass , so and by [F2]. The extended diagnostic integral is ; it is not a finite value of under [F3].
The observed log likelihood is zero at both parameters, but the candidate violates the support-compatible admissibility condition of [F3]. It is not an update allowed by the defined procedure.