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 — Examples
1 · Prerequisites
- 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
- 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
- Missingness and nonidentification
- 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
- Sigma Algebras and Borel Sets
- 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 ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Summary
Finite response mechanisms make the MCAR/MAR/MNAR distinctions concrete. Two full-data laws can agree on the response rate, observed success mass, and entire observed-record distribution while having different population means. A separate example distinguishes an unrecorded outcome from an outcome that has no value after a competing event such as death.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Death is not automatically a missing outcome
Example
Suppose the scientific target is a quality-of-life score at time for all participants enrolled at baseline, with positive probability of death before , and the score is defined only for people alive at . If death before makes the score itself undefined, those post-death values are not merely unrecorded full-data components. An unconditional mean over all enrolled participants has no value until the scientist specifies a different target, such as a composite outcome or a survivor-specific target.
Facts & Assumptions
Given: A population probability space of all baseline-enrolled participants with ; means death before ; and the proposed score is defined only when , with no post-death value stipulated.
Random elements and real random variables: a real random variable is a measurable map from the entire probability space to .
Full and observed data under a missingness pattern: the full-data vector contains the values that define the target, while the response pattern records which of those values are available.
Estimands on a statistical model: an estimand is a specified function on the model's parameter set.
Verification
Since has no value stipulated on the event , it is only a function on and is not a map from the whole baseline probability space to . It therefore is not a real random variable on the stated population by [F1].
The observed-pattern construction [F2] can mask a coordinate of a full-data vector, but it does not define a value where the scientific outcome itself does not exist. Thus over all enrolled participants is not a well-defined target function as required by [F3]. Assigning a post-death value, using a composite outcome, or restricting to survivors defines a different scientific target and must be stated separately.
MCAR, MAR, MNAR, and indistinguishable observed laws
Example
Let and be independent fair binary variables, with full data ; observe under either response pattern and observe only when . Three response mechanisms are: In each case . The first mechanism is MCAR; the second is MAR because its probability depends only on observed ; the third is MNAR because for pattern its probability varies with the unobserved at each .
For a binary outcome with no always-observed covariate, consider two further joint laws:
| Law | |||||
|---|---|---|---|---|---|
Both yield , , and the same observed record law. Both are MNAR: their response probabilities given and differ. The respondent mean is under both laws, but the full-data mean differs. The example realizes the interval in Exact binary-outcome bounds under unrestricted missingness.
Facts & Assumptions
Given: The full/observed-data convention and MCAR/MAR/MNAR definitions in the Statement; the finite probability models displayed in the Example.
Full and observed data under a missingness pattern: the response pattern selects which full-data coordinates are recorded, and the pattern remains part of the observed record.
MCAR, MAR, and MNAR relative to an observation pattern: MCAR means every pattern probability is constant in the full data almost surely.
MCAR, MAR, and MNAR relative to an observation pattern: MAR means each pattern probability is a measurable function of that pattern's observed projection almost surely.
MCAR, MAR, and MNAR relative to an observation pattern: MNAR means MAR fails for at least one pattern relative to the declared partition.
Exact binary-outcome bounds under unrestricted missingness: for observed response rate and success mass , the compatible binary full means are exactly .
MCAR, MAR, and MNAR relative to an observation pattern and Measure kernel and probability kernel: both displayed joint laws have for , so each supplies the finite response kernel used below to classify that law.
Verification
For the first model, is constant in , hence MCAR by [F2]. In the second, both pattern probabilities are functions of alone, which is recorded for both patterns, so MAR holds by [F3]; it is not MCAR because the probability differs at and . In the third, for each , and while . Thus the pattern- probability cannot be a function of its observed coordinate alone, so the mechanism is MNAR by [F4].
Each row of the table contains nonnegative entries summing to one. Under either law, , , and , so the observed record laws agree and have , . The means are and . For the selected finite kernels in [F6], has and , while has and . In each law the pattern- response probability also differs across the two values of , although the observed projection for that pattern is empty; hence neither law is MAR. This agrees with [F5] and shows the observed respondent mean does not identify the population mean.
Sources
- Hernán and Robins, Causal Inference: What If, Chapter 8, §§8.4–8.5, and §12.6
- National Research Council, The Prevention and Treatment of Missing Data in Clinical Trials, Chapter 4, pp. 47–49
- Lu Mao, Missing Data: Foundations and Methods, Chapter 1, §1.1
- Lu Mao, Missing Data: Foundations and Methods, Chapter 1, §§1.3–1.7
- National Research Council, The Prevention and Treatment of Missing Data in Clinical Trials, Chapter 4, pp. 50–58