Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Missingness and nonidentification

1 · Prerequisites

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 a=P(R=1) and b=P(R=1,Y=1), the compatible population means are exactly [b,b+1−a]; MAR yields b/a only when a>0. If an outcome is not defined after death, its value is not merely unrecorded.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Full and observed data under a missingness pattern

Definition

Let (Ω,F,P) be a probability space and let W=(W1,…,Wk), for a finite k≥1, be a random element of the product measurable space W=∏j=1kWj (Random elements and real random variables, Measurable spaces and measurable sets). The law of W is the pushforward probability measure defined in Law or distribution of a random element. Let R be a nonempty finite set of observation patterns with its discrete sigma-algebra, and let R:Ω→R be a random element.

For each r∈R, specify the recorded coordinate set Ir⊆{1,…,k} and its complement Jr={1,…,k}∖Ir. The observed projection Wobs(r) is the coordinate projection into Wobs(r):=∏j∈IrWj, and the missing projection Wmis(r) is the projection into Wmis(r):=∏j∈JrWj. An empty coordinate tuple takes values in a one-point measurable space. The observed record is O=(R,Wobs(R)) in the disjoint union ⨆r∈R({r}×Wobs(r)), 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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

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 g(r∣w) of the pattern R given full data W=w, 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 gψ; 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 r, g(r∣w) is constant in w almost surely. It is missing at random (MAR) when, for every pattern r, there is a measurable function hr on that pattern's observed-data space such that g(r∣w)=hr(Wobs(r))almost surely. 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Observed-data likelihood under a response model

Statement

Assume AC. Let W=(W1,…,Wk) have a full-data model dominated by a common sigma-finite positive measure μ on the finite product measurable space W=∏j=1kWj, with selected finite-valued density representatives pθ as in Dominated statistical experiments and Likelihood densities. Let R be a nonempty finite pattern set, let Ir and Jr be the observed and missing coordinate sets for pattern r, and write πr(w)=Wobs(r) for its measurable coordinate projection. Let gψ(r∣w) be a supplied response probability kernel as in MCAR, MAR, and MNAR relative to an observation pattern, and define the joint model by Pθ,ψ(dw,{r})=gψ(r∣w)Pθ(dw).

Fix a finite positive measure ρ equivalent to μ; such a measure exists for every sigma-finite μ. For each pattern put κr(B)=ρ(πr−1(B)) for measurable B⊆Wobs(r), and define the finite measure on the observed disjoint union by λO(A)=∑r∈Rκr({x:(r,x)∈A}). The full-data marginal law of Wobs(r) and the pattern-r observed sublaw B↦Pθ,ψ(R=r,πr(W)∈B) are absolutely continuous with respect to κr. Choose finite-valued nonnegative Radon--Nikodym density representatives qθ,r and ℓθ,ψ,r for these measures. Then the observed record O=(R,Wobs(R)) is dominated by λO and has density ℓθ,ψ(r,x)=ℓθ,ψ,r(x) at (r,x).

In the product-reference special case where μ=ν=⨂j=1kνj, each νj is sigma-finite, and the coordinate reordering w=(x,z)=(Wobs(r),Wmis(r)) identifies ν with νrobs×νrmis, where νrobs=⨂j∈Irνj and νrmis=⨂j∈Jrνj, one may instead use the pattern reference νrobs, with disjoint-union reference λOprod(A)=∑rνrobs({x:(r,x)∈A}). The observed record is dominated by this sigma-finite measure, and Tonelli's theorem gives the density versions qˉθ,r(x)=∫pθ(x,z) νrmis(dz),ℓθ,ψ,r(x)=∫pθ(x,z)gψ(r∣x,z) νrmis(dz). 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.

[F1]

Full and observed data under a missingness pattern: the full data are W=(W1,…,Wk), pattern R selects the recorded coordinates, and the observed record is O=(R,Wobs(R)).

[F2]

MCAR, MAR, and MNAR relative to an observation pattern: a response mechanism is a supplied conditional law g(r∣w) represented by a probability kernel.

[F3]

Dominated statistical experiments: the common supplied dominator is sigma-finite and dominates every full-data law.

[F4]

Finite, sigma-finite, and semifinite measures: sigma-finiteness supplies a countable cover by sets of finite μ-measure.

[F5]

Parametric statistical models: a parametric model is the parameter map from labels θ to their sampling laws Pθ.

[F6]

Likelihood densities: under AC, select finite-valued measurable nonnegative representatives of density classes.

[F7]

Measure kernel and probability kernel: every response-kernel section has total mass one.

[F8]

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.

[F9]

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.

[A1]

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.

1.1F3F4F9construct

By [F3] and [F4], choose a countable cover En of W with μ(En)<∞, replace it by the increasing cover Fn=⋃j≤nEj, and put A1=F1 and An=Fn∖Fn−1 for n≥2. The An partition W and each has finite μ-measure. Set cn=2−n/(1+μ(An)) and define ρ(E)=∑n≥1cnμ(E∩An). Rearrangement of nonnegative double series shows that ρ is countably additive; moreover ρ(W)≤∑n2−n<∞, and ρ(E)=0 exactly when μ(E)=0, since every cn>0 and the An partition W. Thus ρ is finite and equivalent to μ.

1.2A1F1F3F6F8given

For every pattern r, the coordinate projection πr is measurable by [F1], so κr=ρ∘πr−1 is a finite measure. If κr(B)=0, equivalence gives μ(πr−1B)=0, and [F3] gives Pθ(πr−1B)=0. Thus the full-data marginal B↦Pθ(πr−1B) is absolutely continuous with respect to κr. The pattern sublaw B↦∫πr−1Bgψ(r∣w) Pθ(dw) is bounded above by that marginal because the kernel section lies in [0,1], so it too is absolutely continuous. By [A1, F6, F8], choose finite-valued nonnegative densities qθ,r and ℓθ,ψ,r for these finite measures.

2.1F1F7step 1.2given

For a measurable set A in the observed disjoint union, its pattern sections Ar={x:(r,x)∈A} satisfy Pθ,ψ(O∈A)=∑r∫Arℓθ,ψ,r dκr=∫Aℓθ,ψ(r,x) dλO. These densities therefore represent the observed-record law relative to the stated λO; their total mass is one because ∑rPθ,ψ(R=r)=∫∑rgψ(r∣w) Pθ(dw)=1. The full-data marginal densities qθ,r likewise integrate to one.

3.1A1F1F2F5F7F9given∎

In the product-reference case, for each pattern r and observed-coordinate measurable set B, the product decomposition in the Statement gives the pattern sublaw as ∫B×Wmis(r)pθ(x,z)gψ(r∣x,z) d(νrobs×νrmis). Its integrand is nonnegative and product-measurable, so [F9] gives the displayed missing-coordinate integral as a density relative to νrobs. Applying the same argument with g omitted gives the displayed marginal density qˉθ,r. Empty blocks use the one-point unit measure as stated.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Exact binary-outcome bounds under unrestricted missingness

Statement

Let Y,R∈{0,1}, with R=1 meaning that Y is observed, and encode the observed record as O=(R,RY). When R=0, the zero in the second recorded coordinate is a placeholder and does not assign the missing full-data value Y=0. Put a=P(R=1),b=P(R=1,Y=1),0≤b≤a≤1. Let Θa,b be the set of all joint laws P of (Y,R) with these values of a and b, and let the statistical model map P∈Θa,b to the law of O. For each individual P, 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 m(P)=P(Y=1) is an estimand on this model. Its set of values over Θa,b is exactly [b,b+1−a]. Consequently, without a MAR restriction, the mean is not identifiable when a<1; it is identified as b when a=1. If MAR also holds, then for a>0 the mean is b/a, while for a=0 it remains unidentified.

Facts & Assumptions

Given: The binary full-data/response setup and observed law in the Statement.

[F1]

Full and observed data under a missingness pattern: R records which coordinates of the full data W are observed, and O=(R,Wobs(R)) retains the pattern label. In the binary encoding O=(R,RY), the zero at R=0 is a record placeholder and does not assign the missing full-data value Y=0.

[F2]

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.

[F3]

Law or distribution of a random element: the law of a random element is the pushforward probability PX(B)=P(X−1(B)).

[F4]

Parametric statistical models: a statistical model is a parameter map P:Θ→P(X,A).

[F5]

Observational equivalence: two parameter values are observationally equivalent exactly when their sampling laws are equal.

[F6]

Estimands on a statistical model: an estimand is a specified function from the parameter set to target values.

[F7]

Identifiability of an estimand: an estimand is identifiable only if equality of sampling laws implies equality of its values.

[F8]

MCAR, MAR, and MNAR relative to an observation pattern and Measure kernel and probability kernel: for each finite joint law P of (Y,R), a response kernel is given on states with P(Y=y)>0 by gP(r∣y)=P(R=r,Y=y)/P(Y=y); on any null state, any probability vector may be assigned, for example gP(0∣y)=1 and gP(1∣y)=0. These finite-space kernels are measurable and give the selected mechanism used to interpret MAR for each law P.

Proof

technique · Directly bound the unobserved success mass and construct every admissible completion
1.1givenF1algebra

For any P∈Θa,b, write c=P(R=0,Y=1). Since P(R=0)=1−a, one has 0≤c≤1−a, and m(P)=P(Y=1,R=1)+P(Y=1,R=0)=b+c. Hence b≤m(P)≤b+1−a.

1.2givenalgebraconstruct

Conversely, fix any m∈[b,b+1−a] and assign P(Y=1,R=1)=b, P(Y=0,R=1)=a−b, P(Y=1,R=0)=m−b, and P(Y=0,R=0)=1−a−m+b. Each entry is nonnegative by the bounds on a,b,m; the four entries sum to one. This law has response rate a, observed success mass b, and mean m, so every point of the interval is attained, including both endpoints.

2.1F1F3F4F5F6F7step 1.2algebra

Under each such law, the pushforward law of O has masses b at (1,1), a−b at (1,0), and 1−a at (0,0), independent of m. Thus all parameters in Θa,b are observationally equivalent. If a<1, the interval has positive length 1−a, so it contains distinct means and the estimand is not identifiable. If a=1, it is the singleton {b} and the mean is identified as b.

3.1F2F8step 1.2givenalgebra∎

For each P∈Θa,b use the finite conditional response kernel in [F8]. Under MAR, the probability gP(0∣Y) depends only on the empty observed projection for pattern R=0, so it is constant PY-almost surely. Hence gP(1∣Y)=1−gP(0∣Y) is also constant PY-almost surely; its constant is P(R=1)=a, by integrating over PY. Therefore b=P(R=1,Y=1)=aP(Y=1), and for a>0 the mean is b/a. If a=0, every law in the interval construction of step 1.2 has R=0 almost surely; its selected kernel is constant on the support of Y, so it is MCAR and hence MAR. The whole interval [0,1] therefore remains compatible with MAR.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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 Pθ and the response kernel is gψ. For each pattern let mr denote the pattern reference selected in the lemma: mr=κr in general, and one may take mr=νrobs in the product-reference special case. Let Qθ,r be the law of Wobs(r) under Pθ, and choose a finite-valued nonnegative density representative qθ,r=dQθ,r/dmr. Suppose MAR holds for every ψ and r with one measurable factor hψ,r valid Pθ-almost surely for every θ. Clipping this factor to [0,1] preserves those almost-sure identities, so take 0≤hψ,r(x)≤1 for every x. Then ℓθ,ψ(r,x)=hψ,r(x)qθ,r(x) is a selected observed-record likelihood version relative to the disjoint union reference λO(A)=∑rmr({x:(r,x)∈A}). In the product-reference special case, the missing-coordinate integrals qˉθ,r(x)=∫pθ(x,z) νrmis(dz),ℓθ,ψ(r,x)=∫pθ(x,z)gψ(r∣x,z) νrmis(dz) are density versions, and may be chosen in the displayed factorized form after selecting finite-valued representatives.

For a fixed response parameter, if hψ,r(x)>0 and qθ2,r(x)>0, the factor cancels from the likelihood ratio in θ. Profiling over the same set Ψ for each θ multiplies qθ,r(x) by the factor sup⁡ψ∈Ψhψ,r(x), 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.

[F1]

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.

[F2]

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.

[F3]

Parametric statistical models: a parameterized model is a map from parameter labels to sampling laws.

[F4]

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.

[F5]

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.

[F6]

Monotone convergence for the integral: increasing nonnegative measurable functions have integrals increasing to the integral of their pointwise limit.

[F7]

Integrating against a Radon-Nikodym derivative recovers integration against the measure: integration of a simple function against a measure with density q agrees with integration of that function times q against the reference measure; [F5] and [F6] extend this to nonnegative measurable integrands.

[F8]

Likelihood densities: under AC a likelihood density uses a selected finite-valued measurable nonnegative representative of its density class.

[A1]

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.

1.1F2givenalgebra

For each MAR factor in the Statement, replace any measurable almost-sure version hψ,r by hψ,r∗=min⁡(1,max⁡(0,hψ,r)). Since every kernel evaluation gψ(r∣w) lies in [0,1] and equals hψ,r(πr(w)) Pθ-almost surely for every θ, clipping leaves each of those identities true and makes hψ,r∗ pointwise [0,1]-valued.

2.1A1F1F2F3F4F5F6F7F8step 1.1given

For a measurable observed-coordinate set B, put u=1Bhψ,r∗. By [F4], the integral of any nonnegative simple function of πr(W) under Pθ equals its integral under the pushforward law Qθ,r; [F5] supplies increasing simple approximations to u, and [F6] passes to their limit. Since Qθ,r has density qθ,r with respect to mr, [F7] gives the same integral as ∫Bhψ,r∗(x)qθ,r(x) dmr(x), again by simple approximation and monotone convergence. MAR therefore yields Pθ,ψ(R=r,πr(W)∈B)=∫Bhψ,r∗(x)qθ,r(x) dmr(x). Thus hψ,r∗qθ,r 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.

3.1step 2.1givenalgebra∎

Because qθ,r(x)≥0 and the same nonempty parameter set Ψ is allowed for every θ, the profile satisfies sup⁡ψ∈Ψℓθ,ψ(r,x)=qθ,r(x)sup⁡ψ∈Ψhψ,r∗(x). The multiplier is finite and common to every θ, and if it is zero the record has zero likelihood for all θ. For fixed ψ, whenever hψ,r∗(x)>0 and qθ2,r(x)>0, the ratio at θ1 and θ2 is qθ1,r(x)/qθ2,r(x). 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