Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Conditional-class standardization identifies a causal mean

Statement

Assume AC for the conditional-expectation existence convention. Consider a full-data law P with an observed discrete or atomic treatment A, covariate random element L, observed outcome Y, and potential outcomes (Yb)b∈A, with supplied potential outcomes (the countably discrete convention is Potential outcomes and consistency). Fix an atom a with P(A=a)>0 and Ya∈L1(P). Assume consistency Y=YA, conditional exchangeability (Yb)b∈A⊥ ⁣ ⁣ ⁣⊥A∣σ(L), and positivity ea(L):=P(A=a∣σ(L))>0P-almost surely. Let Q be the observed-data law of (A,L,Y), put G=σ(L) and Ia=1{A=a}, and define the standardization functional Ψstd(Q;a) as in Standardization for a causal mean. Then Ψstd(Q;a)=EP[Ya]. Thus the observed law and the stated causal assumptions identify the population mean of Ya, in the sense of Identifiability of an estimand. No lower bound ea(L)≥ε>0 is needed. This result is for a fixed atomic treatment value; it makes no pointwise claim for a continuous treatment.

For countably discrete treatments, the supplied potential outcomes and global consistency use Potential outcomes and consistency; conditional exchangeability is the full-family sigma-algebra condition of Conditional exchangeability of potential outcomes. More generally, for a treatment in any measurable space with measurable singleton {a}, the same conclusion holds whenever the supplied integrable Ya is conditionally independent of A given σ(L) and 1{A=a}Y=1{A=a}Ya almost surely, with the same positive propensity. This atom-consistency formulation does not require a global measurable selection YA outside the target atom.

On the overlapping countably discrete treatment and standard-Borel covariate domain of Discrete-treatment potential-outcome means are identifiable, this conditional-class functional equals that theorem's RCD standardization functional. The application here also allows arbitrary covariate random elements and uses the algorithm's version-free conditional class.

Facts & Assumptions

Given: AC, a probability space under P, a fixed treatment atom a, Ya∈L1(P), consistency Y=YA, conditional exchangeability (Yb)b∈A⊥ ⁣ ⁣ ⁣⊥A∣σ(L), and ea(L)>0 almost surely.

[A1]

The point-treatment setup uses potential outcomes and consistency as in Potential outcomes and consistency. For the full-family formulation, assume Y=YA, integrability of Ya, and conditional independence of the potential-outcome family from A given σ(L). For the general fixed-atom formulation, assume the atom-consistency and coordinate independence specified in the Statement; those are exactly the two consequences used below.

[A2]

The target is the causal mean relative to the causal model and observed law described by Identifiability of an estimand.

[F1]

The standardization functional is EQ[ma(L)], where ea=EQ[Ia∣G], qa=EQ[IaY∣G], and ma=qa/ea when ea>0. (Standardization for a causal mean)

[F2]

For integrable Z⊥ ⁣ ⁣ ⁣⊥A∣G and measurable C, E[1{A∈C}Z∣G]=E[1{A∈C}∣G]E[Z∣G]. (Conditional treatment-indicator factorization)

[F3]

Conditional independence is preserved under measurable maps of either variable. (Conditional-independence equivalences and preservation)

[F4]

Conditional expectation through nested sigma-algebras has the tower property, including E[E[X∣G]]=E[X] when the smaller sigma-algebra is trivial. (Tower property of conditional expectation)

[F5]

Conditional-expectation versions of the same integrable input are unique almost surely. (Conditional expectation is unique almost surely)

[F6]

Under AC, conditional expectations are well-defined almost-sure classes of integrable measurable versions. (Conditional expectation as an ae class)

[F7]

An estimand on a parametric model is a specified function ψ:Θ→T0. (Estimands on a statistical model)

[F8]

An estimand is identifiable when equal sampling laws imply equal target values. (Identifiability of an estimand)

[F9]

Identifiability is equivalent to factorization of the estimand through the statistical model map, with a unique factor on the model's image. (Identifiability is constancy on observational classes)

[F10]

The expectation of an event indicator is its probability: E[1B]=P(B). (The expectation of an indicator is the probability of the event)

[F11]

For a countable discrete treatment-version set containing 0 and 1, and standard-Borel covariates under consistency, full-family conditional exchangeability, positivity and AC, the observed RCD regression is a version of E[Ya∣σ(L)] on the target covariate support, and its integral equals E[Ya]. (Discrete-treatment potential-outcome means are identifiable)

[F12]

For a measurable function of a random element, expectation equals its integral against that element's law; integrability of the composite implies integrability under the law. (Change of variables for expectation)

Proof

1.1givenA1F2F3F4F6F10

Fix P in the stated model class, let Ia=1{A=a}, ea=EP[Ia∣G], μa=EP[Ya∣G], and qa=EP[IaY∣G]. By [F4] and [F10], P(A=a)=EP[Ia]=EP[ea]. Global consistency, or the stated atom-consistency directly, gives IaY=IaYa almost surely, so IaY is integrable. By [F3], full-family exchangeability implies Ya⊥ ⁣ ⁣ ⁣⊥A∣G; in the general atom formulation this coordinate independence is assumed directly; [F2] then gives qa=EP[IaYa∣G]=eaμa.

2.1A1F1F5F6F12step 1.1algebra

Let λ=PL=QL be the common law of the covariate coordinate. Since G=σ(L)={L−1(B):B∈S}, each real G-measurable version V factors as v(L): for each rational r choose Br∈S with {V<r}=L−1(Br), and put v(x)=inf⁡{r∈Q:x∈Br}, replacing nonfinite values by 0. Its rational sublevel sets make v measurable, and v(L)=V. Apply this to the five conditional versions, writing e~a,q~a for the Q-conditional classes in [F1], and eˉa,qˉa,μˉa for the P-conditional classes ea,qa,μa from step 1.1. By [F12], all five functions are integrable under λ. For each measurable set B in the covariate space, the defining event integrals for ea,qa and the fact that Q is the observed-data law give ∫Be~a dλ=Q(A=a,L∈B)=EP[Ia1{L∈B}]=∫Beˉa dλ, ∫Bq~a dλ=EQ[IaY1{L∈B}]=EP[IaY1{L∈B}]=∫Bqˉa dλ. Each difference is integrable and has zero integral over every B, so it and zero are conditional-expectation versions of zero given the full sigma-algebra on (L,S,λ). Uniqueness [F5] gives e~a=eˉa and q~a=qˉa λ-almost everywhere. Factoring the a.s. identity in step 1.1 gives qˉa=eˉaμˉa λ-almost everywhere; positivity therefore makes the ratio in [F1] equal to μˉa QL-almost everywhere. Thus ma is integrable and the standardization functional is well-defined.

3.1F4F12step 2.1

By [F12] and step 2.1, EQ[ma(L)]=∫ma dλ=∫μˉa dλ=EP[μa]. The tower property [F4] then gives Ψstd(Q;a)=EP[Ya].

4.1A2F5F6F7F8F9step 2.1step 3.1construct

For either potential-outcome formulation in the Statement, let Θa be the class of full-data laws on the fixed measurable spaces for its variables that satisfy the stated integrability, consistency, conditional-exchangeability (or atom-specific independence), and positivity assumptions. Define the target by ψa(P)=EP[Ya] and the observation map by O(P)=LP(A,L,Y)=Q, the pushforward of P under (A,L,Y). Steps 2.1–3.1 show for every P∈Θa that ψa(P)=Ψstd(O(P);a), where the conditional classes in the right-hand side are determined uniquely by that observed law. Hence the target factors through the observation map on this model, and [F7]–[F9] imply identifiability from Q.

5.1F11step 2.1step 3.1step 4.1∎

Under the additional countably discrete treatment and standard-Borel covariate hypotheses of [F11], the earlier theorem's RCD regression evaluated at L equals μa almost surely on the target support, as established in its proof steps 2.1–3.1. Step 2.1 gives the same class for this algorithm's ma. Thus the two standardization functionals coincide. The causal identification on this overlapping domain is the earlier theorem applied to the conditional-class algorithm; steps 1.1–4.1 supply the extension to arbitrary covariate random elements and the general target-atom formulation.

Remarks

The identity uses the true population propensity. It is not a finite-sample stability or estimated-propensity theorem, and it does not justify weight truncation. For continuous A, density-based functionals and support conditions require a separate statement; regular conditional versions identify conditional laws only almost everywhere in the treatment law, so no effect at a null value is asserted here.

Depends on

Used by

Dependency tree · two levels

53 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources