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 weights and sensitivity — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- 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
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Markov Kernels and Markov Chains
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Missingness and nonidentification
- Missingness weights and sensitivity
- 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
- 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
- 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
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Finite laws show that strict response positivity can coexist with arbitrarily large weighted-contribution variance as an observation probability approaches zero. At a positivity failure, two full-data laws can give the same observed records but different means. A location-shift sensitivity curve likewise keeps the observed law fixed while changing the full-data mean; the resulting range depends on the stated sensitivity model and is not a confidence interval.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Positivity failure, near-positivity weights, and an MNAR sensitivity curve
Example
All laws below are finite. Encode an observed record by its response mask and the available coordinates; when convenient write the missing outcome slot as a placeholder zero, with the mask distinguishing it from an observed zero.
First consider with , full outcome , and response probabilities For the response-weighted contribution , positivity holds for every fixed , and . However, with probability and is zero otherwise, so Thus strict positivity gives the population identity but no uniform finite-variance bound as positivity deteriorates.
At the boundary , let still be fair, let exactly when , and set on . Consider two full-data laws indexed by that set on . Their observed record has the same law under both: mass at and mass at . The full-data mean is , so it differs between observationally equivalent laws. The zero response probability at prevents identification of the mean.
Finally let , take , and, for a sensitivity value , specify for . This is the location-shift pattern-mixture family of Location-shift pattern-mixture sensitivity function with constant . Every member has the same observed law: Its full-data mean is so the sensitivity range yields means in despite an unchanged observed law. This is a model-indexed range of target values, not a confidence interval or a coverage statement.
Facts & Assumptions
Given: The finite laws and parameter ranges specified in the Example.
On a finite probability space, expectation is the probability-weighted finite sum. (Expectation of a real random variable on a finite probability space)
A finite probability law has nonnegative atom weights summing to one, and event probabilities are sums of those weights. (Finite probability spaces, outcome weights, events, and event probabilities)
Variance is the expectation of the squared deviation from the mean. (Moments, variance, and covariance on a probability space)
An estimand is a specified function of the parameter in a parametric model. (Estimands on a statistical model)
Two parameter values are observationally equivalent exactly when their sampling laws agree. (Observational equivalence)
An estimand is identifiable only if observationally equivalent parameters have the same target value. (Identifiability of an estimand)
The location-shift sensitivity family specifies the nonrespondent conditional law by translating the respondent law by . (Location-shift pattern-mixture sensitivity function)
In the one-outcome pattern, MAR requires the response probability for the missing pattern to depend only on that pattern's observed coordinates. (MCAR, MAR, and MNAR relative to an observation pattern)
Conditional independence given a sigma-algebra is the conditional product identity for bounded measurable functions. (Conditional independence given a sigma-algebra)
in the near-positivity law.
in the sensitivity family.
Proof
The near-positivity law has atom weights at , at , and at . By [A1] and [F2], these are nonnegative and sum to one. Given either value , is constant, so for bounded measurable and , . Thus this construction is MAR under the assigned conditional-independence formulation [F9]. Hence equals on the responding atom, of probability , and is zero on the other atoms.
For each , the full-data law assigns probability to and to . Mapping these atoms to gives the same two observed atoms for both values of , while [F1] gives . Thus the observed sampling laws agree but the estimand values are and .
For each , assign observed-pattern masses to , to , and missing-pattern masses to , to . These masses sum to one by [F2]. Conditional on , the outcome is Bernoulli; conditional on , it has the law of that Bernoulli variable translated by , as required by [F7]. The observed record has masses at for every .
By [F1], and . This diverges as , although for each fixed . At , , so positivity fails on an stratum of probability .
By [F5], the two parameters are observationally equivalent; by [F6], the different values of therefore show that the full-data mean is not identifiable from this observed-data model. The response probability is zero at , exactly the stratum on which the two full-data laws differ.
By [F1], the target mean is . At it is , and at it is , while step 1.3 shows that the observed sampling law is unchanged. Thus the target is not identified across this sensitivity family; the interval is only the set of means induced by the stipulated range and carries no repeated-sampling coverage assertion.
If , then whereas : both conditioning events have positive probability, and keeps distinct from respondent support . With no always-observed covariate, the missing pattern has an empty observed-coordinate vector, so [F8] requires this response probability to be constant in for MAR; it is not, hence this member is MNAR. At , both response groups have the same Bernoulli law and is independent of , so the response probability is constant and the member is MAR.
Sources
- Miguel A. Hernán and James M. Robins, Causal Inference: What If, updated author-hosted PDF
- National Research Council, The Prevention and Treatment of Missing Data in Clinical Trials, Chapter 4
- National Research Council, The Prevention and Treatment of Missing Data in Clinical Trials, Chapter 5
- L. Mao, Missing Data: Foundations and Methods, Chapter 1