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.
Missingness and nonidentification
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- 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
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Summary
Missing-data analysis starts with a declared full-data target and an observation-pattern law. MCAR, MAR, and MNAR describe how that law depends on the full values relative to the chosen pattern-specific observed projection; these are model assumptions, not empirical facts established by the observed record alone.
For a finite-coordinate model dominated by a common sigma-finite measure, the observed record has patternwise densities after replacing that measure by an equivalent finite measure and pushing it forward through each observed projection. With a coordinate-product reference, these densities are the familiar missing-coordinate integrals. Under a supplied MAR response model and a Cartesian full-data/response parameter space, a bounded observed-value response factor separates from likelihood inference about the full-data parameter. This factorization does not identify every target. In the binary unrestricted-response example, if and , the compatible population means are exactly ; MAR yields only when . If an outcome is not defined after death, its value is not merely unrecorded.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Full and observed data under a missingness pattern
Definition
Let be a probability space and let , for a finite , be a random element of the product measurable space (Random elements and real random variables, Measurable spaces and measurable sets). The law of is the pushforward probability measure defined in Law or distribution of a random element. Let be a nonempty finite set of observation patterns with its discrete sigma-algebra, and let be a random element.
For each , specify the recorded coordinate set and its complement . The observed projection is the coordinate projection into , and the missing projection is the projection into . An empty coordinate tuple takes values in a one-point measurable space. The observed record is in the disjoint union , where a set in the disjoint-union sigma-algebra is measurable exactly when each pattern section is measurable. The pattern records which coordinates are available; it does not replace an unrecorded full-data value by zero.
MCAR, MAR, and MNAR relative to an observation pattern
Definition
Fix the full-data/observed-data partition of Full and observed data under a missingness pattern. A response mechanism is a specified conditional law of the pattern given full data , represented by a probability kernel from the full-data space to the finite pattern space (Conditional law given a random element, Measure kernel and probability kernel). In a parameterized model, write the response kernel as ; it must be a probability distribution over patterns for each full-data value.
Relative to a specified full-data law, the mechanism is missing completely at random (MCAR) when, for every pattern , is constant in almost surely. It is missing at random (MAR) when, for every pattern , there is a measurable function on that pattern's observed-data space such that For a family of full-data laws, the condition is required under each law with the same response mechanism and observed-coordinate function. It is missing not at random (MNAR) when MAR fails for at least one pattern, for the declared full-data and observed-data partition. MCAR is a special case of MAR, since a constant is a function of the observed coordinates.
These conditions concern a supplied version of the conditional law; values off the full-data model's support do not affect the classification. This definition does not assert that a response mechanism is empirically true or that every joint law comes with a selected conditional kernel.
Remarks
When the full-data and pattern spaces are standard Borel and a kernel must be obtained from a joint law rather than supplied as part of the model, the library's RCD existence and factor-through results provide that construction under AC: Existence of regular conditional distributions for standard borel targets and Regular conditional kernels factor through a standard borel conditioning variable. The finite examples on the companion page specify their response probabilities directly and do not use that existence argument.
Observed-data likelihood under a response model
Statement
Assume AC. Let have a full-data model dominated by a common sigma-finite positive measure on the finite product measurable space , with selected finite-valued density representatives as in Dominated statistical experiments and Likelihood densities. Let be a nonempty finite pattern set, let and be the observed and missing coordinate sets for pattern , and write for its measurable coordinate projection. Let be a supplied response probability kernel as in MCAR, MAR, and MNAR relative to an observation pattern, and define the joint model by
Fix a finite positive measure equivalent to ; such a measure exists for every sigma-finite . For each pattern put for measurable , and define the finite measure on the observed disjoint union by The full-data marginal law of and the pattern- observed sublaw are absolutely continuous with respect to . Choose finite-valued nonnegative Radon--Nikodym density representatives and for these measures. Then the observed record is dominated by and has density at .
In the product-reference special case where , each is sigma-finite, and the coordinate reordering identifies with , where and , one may instead use the pattern reference , with disjoint-union reference . The observed record is dominated by this sigma-finite measure, and Tonelli's theorem gives the density versions An empty coordinate block is a one-point space with unit mass.
Facts & Assumptions
Given: AC, the finite-coordinate model dominated by a common sigma-finite measure, its supplied response kernel, and, for the coordinate integral specialization, the product reference and pattern-specific product decompositions in the Statement.
Full and observed data under a missingness pattern: the full data are , pattern selects the recorded coordinates, and the observed record is .
MCAR, MAR, and MNAR relative to an observation pattern: a response mechanism is a supplied conditional law represented by a probability kernel.
Dominated statistical experiments: the common supplied dominator is sigma-finite and dominates every full-data law.
Finite, sigma-finite, and semifinite measures: sigma-finiteness supplies a countable cover by sets of finite -measure.
Parametric statistical models: a parametric model is the parameter map from labels to their sampling laws .
Likelihood densities: under AC, select finite-valued measurable nonnegative representatives of density classes.
Measure kernel and probability kernel: every response-kernel section has total mass one.
A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density and A sigma-finite positive measure has a nonnegative Radon–Nikodym density version: finite positive measures absolutely continuous with respect to a finite positive reference have finite-valued nonnegative density representatives under AC.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product-measurable functions have measurable section integrals, and integrating a section integral equals integrating over the product.
The Axiom of Choice: AC permits selection from a family of nonempty sets.
Proof
Proof technique: Construct an equivalent finite reference, take patternwise pushforwards, and use Tonelli in the product-reference specialization.
By [F3] and [F4], choose a countable cover of with , replace it by the increasing cover , and put and for . The partition and each has finite -measure. Set and define . Rearrangement of nonnegative double series shows that is countably additive; moreover , and exactly when , since every and the partition . Thus is finite and equivalent to .
For every pattern , the coordinate projection is measurable by [F1], so is a finite measure. If , equivalence gives , and [F3] gives . Thus the full-data marginal is absolutely continuous with respect to . The pattern sublaw is bounded above by that marginal because the kernel section lies in , so it too is absolutely continuous. By [A1, F6, F8], choose finite-valued nonnegative densities and for these finite measures.
For a measurable set in the observed disjoint union, its pattern sections satisfy . These densities therefore represent the observed-record law relative to the stated ; their total mass is one because . The full-data marginal densities likewise integrate to one.
In the product-reference case, for each pattern and observed-coordinate measurable set , the product decomposition in the Statement gives the pattern sublaw as . Its integrand is nonnegative and product-measurable, so [F9] gives the displayed missing-coordinate integral as a density relative to . Applying the same argument with omitted gives the displayed marginal density . Empty blocks use the one-point unit measure as stated.
Exact binary-outcome bounds under unrestricted missingness
Statement
Let , with meaning that is observed, and encode the observed record as . When , the zero in the second recorded coordinate is a placeholder and does not assign the missing full-data value . Put Let be the set of all joint laws of with these values of and , and let the statistical model map to the law of . For each individual , use its finite conditional response kernel specified below when assessing the MAR clause; arbitrary null-state values do not affect that classification. The full-data mean is an estimand on this model. Its set of values over is exactly Consequently, without a MAR restriction, the mean is not identifiable when ; it is identified as when . If MAR also holds, then for the mean is , while for it remains unidentified.
Facts & Assumptions
Given: The binary full-data/response setup and observed law in the Statement.
Full and observed data under a missingness pattern: records which coordinates of the full data are observed, and retains the pattern label. In the binary encoding , the zero at is a record placeholder and does not assign the missing full-data value .
MCAR, MAR, and MNAR relative to an observation pattern: MAR requires each pattern probability to depend only on that pattern's observed projection; MNAR means MAR fails for at least one pattern.
Law or distribution of a random element: the law of a random element is the pushforward probability .
Parametric statistical models: a statistical model is a parameter map .
Observational equivalence: two parameter values are observationally equivalent exactly when their sampling laws are equal.
Estimands on a statistical model: an estimand is a specified function from the parameter set to target values.
Identifiability of an estimand: an estimand is identifiable only if equality of sampling laws implies equality of its values.
MCAR, MAR, and MNAR relative to an observation pattern and Measure kernel and probability kernel: for each finite joint law of , a response kernel is given on states with by ; on any null state, any probability vector may be assigned, for example and . These finite-space kernels are measurable and give the selected mechanism used to interpret MAR for each law .
Proof
For any , write . Since , one has , and . Hence .
Conversely, fix any and assign , , , and . Each entry is nonnegative by the bounds on ; the four entries sum to one. This law has response rate , observed success mass , and mean , so every point of the interval is attained, including both endpoints.
Under each such law, the pushforward law of has masses at , at , and at , independent of . Thus all parameters in are observationally equivalent. If , the interval has positive length , so it contains distinct means and the estimand is not identifiable. If , it is the singleton and the mean is identified as .
For each use the finite conditional response kernel in [F8]. Under MAR, the probability depends only on the empty observed projection for pattern , so it is constant -almost surely. Hence is also constant -almost surely; its constant is , by integrating over . Therefore , and for the mean is . If , every law in the interval construction of step 1.2 has almost surely; its selected kernel is constant on the support of , so it is MCAR and hence MAR. The whole interval therefore remains compatible with MAR.
MAR factorization and likelihood ignorability for the full-data parameter
Statement
Assume AC and the hypotheses and notation of Observed-data likelihood under a response model. Suppose the full-data parameter and response-mechanism parameter range independently over the nonempty Cartesian product , so the full-data law is and the response kernel is . For each pattern let denote the pattern reference selected in the lemma: in general, and one may take in the product-reference special case. Let be the law of under , and choose a finite-valued nonnegative density representative . Suppose MAR holds for every and with one measurable factor valid -almost surely for every . Clipping this factor to preserves those almost-sure identities, so take for every . Then is a selected observed-record likelihood version relative to the disjoint union reference . In the product-reference special case, the missing-coordinate integrals are density versions, and may be chosen in the displayed factorized form after selecting finite-valued representatives.
For a fixed response parameter, if and , the factor cancels from the likelihood ratio in . Profiling over the same set for each multiplies by the factor , which is independent of ; when this factor is zero the observed record has zero likelihood for every . This licenses omission of the response factor for likelihood inference about on its support. It does not license omission when the target depends on , or when the allowed parameter pairs are not a Cartesian product.
Facts & Assumptions
Given: AC; the full-data and response model, nonempty Cartesian parameter space, pattern reference measures, and MAR hypothesis in the Statement.
Observed-data likelihood under a response model: the full-data marginal pushforward and each observed pattern sublaw have selected densities relative to the same patternwise reference measures; in the product-reference special case these densities have the missing-coordinate integral versions.
MCAR, MAR, and MNAR relative to an observation pattern: MAR means that each pattern probability factors through that pattern's observed projection; for a family of full-data laws the same response mechanism and observed-coordinate function are used across the family.
Parametric statistical models: a parameterized model is a map from parameter labels to sampling laws.
Law or distribution of a random element: the law under a measurable projection is its pushforward measure; the identity for nonnegative measurable integrands follows from its indicator-set definition by simple approximation and monotone convergence.
Every nonnegative measurable function admits an explicit increasing sequence of simple approximations: a nonnegative measurable function is the increasing pointwise limit of nonnegative simple functions.
Monotone convergence for the integral: increasing nonnegative measurable functions have integrals increasing to the integral of their pointwise limit.
Integrating against a Radon-Nikodym derivative recovers integration against the measure: integration of a simple function against a measure with density agrees with integration of that function times against the reference measure; [F5] and [F6] extend this to nonnegative measurable integrands.
Likelihood densities: under AC a likelihood density uses a selected finite-valued measurable nonnegative representative of its density class.
The Axiom of Choice: AC supplies a choice function for a family of nonempty sets.
Proof
Proof technique: Factor the response probability through the observed projection and use the parameter product.
For each MAR factor in the Statement, replace any measurable almost-sure version by . Since every kernel evaluation lies in and equals -almost surely for every , clipping leaves each of those identities true and makes pointwise -valued.
For a measurable observed-coordinate set , put . By [F4], the integral of any nonnegative simple function of under equals its integral under the pushforward law ; [F5] supplies increasing simple approximations to , and [F6] passes to their limit. Since has density with respect to , [F7] gives the same integral as , again by simple approximation and monotone convergence. MAR therefore yields . Thus is a selected density version for the observed pattern section; in the product-reference case this agrees as a density class with the coordinate integral in the Statement.
Because and the same nonempty parameter set is allowed for every , the profile satisfies . The multiplier is finite and common to every , and if it is zero the record has zero likelihood for all . For fixed , whenever and , the ratio at and is . A target depending on can still depend on the response factor, and a non-Cartesian allowed parameter set need not permit common profiling.
Remarks
The density-class identities are for each fixed parameter pair. As in Likelihood densities, no common exceptional null set across an uncountable parameter family is asserted; the displayed pointwise likelihood claims use the selected versions stated above.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Lu Mao, Missing Data: Foundations and Methods, Chapter 1, §§1.1–1.2
- National Research Council, The Prevention and Treatment of Missing Data in Clinical Trials, Chapter 4, pp. 47–51
- Lu Mao, Missing Data: Foundations and Methods, Chapter 1, §§1.3–1.5
- National Research Council, The Prevention and Treatment of Missing Data in Clinical Trials, Chapter 4, pp. 50–52
- Lu Mao, Missing Data: Foundations and Methods, Chapter 1, §1.2
- National Research Council, The Prevention and Treatment of Missing Data in Clinical Trials, Chapter 4, pp. 60–61
- Lu Mao, Missing Data: Foundations and Methods, Chapter 1, §§1.6–1.7
- Lu Mao, Missing Data: Foundations and Methods, Chapter 1, §1.4