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.

✓ 2 results · all verified · 2 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 2 also cleared it.

Potential outcomes and identification

1 · Prerequisites

2 · Summary

This page fixes a target population and treatment versions before defining potential outcomes, consistency, the ATE/CATE, conditional exchangeability, and positivity. For countably discrete treatments and standard-Borel covariates, it proves the standardization identity from the full-data assumptions and identifies the almost-everywhere RCD version used for general covariates. Identification means that all compatible full-data laws give the same target value. Exchangeability remains a substantive, generally untestable assumption; positivity failure leaves target strata unsupported. The theorem does not assert pointwise identification at null values of a continuous treatment.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Potential outcomes and consistency

Definition

Fix a target population with probability law P, a real outcome, and a nonempty countable discrete set A of treatment versions. A treatment version a∈A is a specified intervention protocol, not just a treatment label. The potential outcome Ya is the real random variable giving the outcome for a unit in the target population under version a. Write A for the observed treatment assignment or receipt, with values in A, and Y for the observed outcome. The observed potential outcome is the measurable random variable

YA=∑a∈A1{A=a}Ya,

where the countable sum has at most one nonzero summand at each sample point. Consistency is the assumption Y=YA P-almost surely. It links the observed outcome to the potential outcome for the received version; it does not assert that treatment assignment is unconfounded.

The full-data law is the joint law of the potential-outcome family, A, any baseline covariate random element L, and Y. The observed-data law is its marginal law of (A,L,Y). A target population, outcome, intervention protocol, and contrast must be fixed before the associated causal target is specified. If interference between units matters, the version or treatment regime must include the relevant assignment or exposure of other units; the notation Ya by itself does not assert no interference.

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

Positivity for discrete treatment

Definition

Let A take values in a countable discrete set on a target probability space, and let L be the baseline covariate random element. For a treatment value a of interest, the conditional treatment probability is the almost-sure class

ea=E[1{A=a}∣σ(L)],

using the conditional-expectation convention of Conditional expectation as an ae class under the The Axiom of Choice. Positivity for a on the target population means both P(A=a)>0 and ea>0 almost surely under the target law of L. Positivity for a contrast is required at every treatment value in that contrast.

The almost-sure condition is relative to the target population: values of L with zero target probability impose no condition. Strict positivity does not mean that ea is bounded away from zero. The marginal condition makes the observed treatment-stratum law P( ⋅∣A=a) available.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Integrable factorization under conditional independence

Statement

Assume the The Axiom of Choice for the conditional-expectation classes. Let U be a real integrable random variable, let Z be a random element, and let G be a sub-sigma-algebra. If U and Z are conditionally independent given G in the bounded-function sense of Conditional independence given a sigma-algebra, then for every bounded measurable real function h on the state space of Z,

E[Uh(Z)∣G]=E[U∣G]E[h(Z)∣G]almost surely.

Facts & Assumptions

Given: The Axiom of Choice, U∈L1(P), a random element Z, a sub-sigma-algebra G, and U⊥ ⁣ ⁣ ⁣⊥Z∣G.

[A1]

The Axiom of Choice is assumed for the conditional-expectation classes used in this lemma. The Axiom of Choice

[F1]

Conditional independence is the bounded-product conditional-expectation identity. Conditional independence given a sigma-algebra

[F2]

Conditional-expectation notation denotes the almost-sure class of versions, which exists under the stated Choice assumption. Conditional expectation as an ae class

[F3]

Under Choice, conditional expectation contracts every Lp norm for 1≤p≤∞, in particular L1 and L∞. Conditional lp contraction

Proof

1.1givenF1F2construct

For each integer n≥1, let Tn(u)=max⁡(−n,min⁡(u,n)). The functions Tn(U) and h(Z) are bounded and measurable, so [F1] gives the identity E[Tn(U)h(Z)∣G]=E[Tn(U)∣G]E[h(Z)∣G] of the classes in [F2].

2.1A1F2F3step 1.1algebra∎

Since U∈L1, Tn(U)→U in L1; boundedness of h gives Tn(U)h(Z)→Uh(Z) in L1. By [F3], the conditional expectations on the left converge in L1 to E[Uh(Z)∣G], and E[Tn(U)∣G]→E[U∣G] in L1. Also ∣E[h(Z)∣G]∣≤∥h∥∞ almost surely by [F3], so multiplication by this factor preserves that L1 convergence. Taking the L1 limits in step 1.1 proves the stated identity of almost-sure classes.

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

Conditional exchangeability of potential outcomes

Definition

Let A be the observed treatment assignment, L a baseline covariate random element, and (Ya)a∈A the potential-outcome family of Potential outcomes and consistency. Conditional exchangeability given L means

σ(Ya:a∈A)⊥ ⁣ ⁣ ⁣⊥σ(A)∣σ(L),

where conditional independence is the bounded-measurable-function factorization of Conditional independence given a sigma-algebra under the The Axiom of Choice. Each fixed Ya is then conditionally independent of A given L by measurable-map preservation in Conditional-independence equivalences and preservation. This is a full-data assumption; the observed distribution alone does not establish it.

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

Average and conditional average treatment effects

Definition

In a fixed target population with two specified treatment versions 0 and 1 and integrable potential outcomes Y0,Y1 from Potential outcomes and consistency, the average treatment effect (ATE) is the target-population mean contrast E[Y1−Y0]. For a baseline covariate random element L, the conditional average treatment effect (CATE) given L is the conditional-expectation almost-sure class

E[Y1−Y0∣σ(L)],

using the conditional-expectation convention of Conditional expectation as an ae class under the The Axiom of Choice. Thus a CATE is determined only up to equality almost surely under the target law of L; a pointwise value at a null covariate value is not specified by this definition. The ATE is the mean of the individual contrast, not an assertion that both potential outcomes are observed for any unit.

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

Discrete-treatment potential-outcome means are identifiable

Statement

Assume the Axiom of Choice. Let A be a countable discrete set containing treatment versions 0 and 1. On a full-data probability space (Ω,F,P), let A take values in A, let L take values in a standard-Borel space L (Standard Borel spaces), let Y be the observed real outcome, and let (Yb)b∈A be the potential outcomes of Potential outcomes and consistency. For each treatment value a under consideration, assume Ya∈L1(P), consistency Y=YA almost surely, conditional exchangeability σ(Yb:b∈A)⊥ ⁣ ⁣ ⁣⊥σ(A)∣σ(L), and positivity P(A=a)>0 and E[1{A=a}∣σ(L)]>0 almost surely. These are assumptions on the full-data law; Choice is required for the stated conditional-expectation classes and regular conditional distributions.

Write PL(B)=P(L∈B) for the target-population law of L. For such an a, define the treatment-stratum probability Pa(C)=P(C∩{A=a})/P(A=a) for C∈F. Under Pa, let Ka(l,dy) be a regular conditional law of Y given the standard-Borel random element L, and put ma(l)=∫y Ka(l,dy) wherever the absolute integral is finite, with value 0 on the exceptional set. The suppliers Conditional law given a random element, Existence of regular conditional distributions for standard borel targets, Regular conditional kernels factor through a standard borel conditioning variable, and Conditional integration through a regular conditional law give this construction. Then ma is PL-integrable and is uniquely determined PL-almost everywhere by the observed-data law, and

EP[Ya]=∫Lma(l) PL(dl).

If L is countably discrete, this is

EP[Ya]=∑l:P(L=l)>0EP[Y∣A=a,L=l]P(L=l).

In this sum, E[Y∣A=a,L=l] denotes E[Y1{A=a,L=l}]/P(A=a,L=l), whose denominator is positive for each displayed atom.

For the binary contrast, both treatment levels must satisfy positivity. The CATE is then represented PL-almost everywhere by m1−m0, and the ATE is ∫(m1−m0) dPL. In the model whose parameters are all full-data laws satisfying these assumptions and whose observation map sends a full-data law to its (A,L,Y) marginal, each E[Ya] is identifiable in the sense of Identifiability of an estimand: it is constant over full-data laws with the same observed-data law.

Facts & Assumptions

Given: Choice; a full-data probability law; countable discrete treatment versions; a standard-Borel covariate L; integrable potential outcomes for the treatment values considered; consistency; conditional exchangeability; and positivity.

[A1]

The Axiom of Choice is assumed. It supplies the conditional-expectation classes and standard-Borel regular conditional distributions used below. The Axiom of Choice

[F1]

Potential outcomes are indexed by specified treatment versions, the observed outcome is YA, and consistency is Y=YA almost surely. Potential outcomes and consistency

[F2]

Conditional exchangeability means the sigma-algebra generated by the potential-outcome family is conditionally independent of the treatment sigma-algebra given σ(L). Conditional exchangeability of potential outcomes

[F3]

For each treatment a under consideration, P(A=a)>0 and E[1{A=a}∣σ(L)]>0 almost surely under the target law. Positivity for discrete treatment

[F4]

The ATE is E[Y1−Y0], and the CATE is the conditional-expectation class E[Y1−Y0∣σ(L)]. Average and conditional average treatment effects

[F5]

A conditional-expectation version is an integrable σ(L)-measurable function satisfying the defining event-integral identities; under Choice its unique almost-sure class is available. Conditional expectation given a sigma algebra, Conditional expectation as an ae class

[F6]

Conditional independence of an integrable real variable and a random element extends the bounded-product identity to any bounded measurable function of that random element. Integrable factorization under conditional independence

[F7]

Under Choice, a real-valued random element has a regular conditional distribution given any sub-sigma-algebra. Existence of regular conditional distributions for standard borel targets

[F8]

For standard-Borel L, a regular conditional distribution given σ(L) factors through an everywhere probability kernel on the value space of L; this is the conditional law given L. Regular conditional kernels factor through a standard borel conditioning variable, Conditional law given a random element

[F9]

Integrating the identity function against that conditional law, with zero fill where the absolute integral is infinite, gives a real conditional-expectation version under Pa. Conditional integration through a regular conditional law

[F10]

Conditional-expectation versions with the same defining event integrals agree almost surely. Conditional expectation is unique almost surely

[F11]

A finite σ(L)-measurable factor can be taken out of conditional expectation when the products are integrable. Taking out what is known

[F12]

Conditional expectation preserves ordinary expectation and is the tower of nested conditional expectations. Basic algebra and order properties of conditional expectation, Tower property of conditional expectation

[F13]

The expectation of a measurable function of a random element is its integral against that random element's law. Law or distribution of a random element, Change of variables for expectation

[F14]

An estimand is identifiable when it is constant on parameter values with the same observed sampling law. Identifiability of an estimand

Proof

technique · Construct each observed treatment-stratum law, transport its conditional mean to the target covariate law by exchangeability and positivity, and then apply the definition of identifiability
1.1A1F3F5construct

Fix a treatment value a satisfying the hypotheses, write ea=E[1{A=a}∣σ(L)], and define Pa(C)=P(C∩{A=a})/P(A=a). For every Borel B⊆L, the defining event-integral identity for ea gives Pa(L∈B)=EP[1{L∈B}ea]/P(A=a).

1.2A1F1F7F8F9

Under Pa, Y is integrable because Y=Ya on {A=a} by consistency and EPa∣Y∣=EP[1{A=a}∣Ya∣]/P(A=a)≤EP∣Ya∣/P(A=a). By [A1, F7, F8], choose a conditional law Ka(l,dy) of Y given L under Pa; [F9] makes its zero-filled integral ma(L) a real integrable version of EPa[Y∣σ(L)].

1.3A1F2F3F6

Put va=EP[Ya∣σ(L)]. Conditional independence in [F2], applied to the coordinate Ya and the bounded indicator 1{A=a}, together with [F6], gives EP[1{A=a}Ya∣σ(L)]=eava almost surely.

2.1step 1.1F3algebra

The covariate laws Pa,L and PL are equivalent. Indeed, PL(B)=0 makes the numerator in step 1.1 zero. Conversely, if PL(B)>0, positivity gives P(L∈B,ea>0)>0; since {ea>0}=⋃n≥1{ea≥1/n} up to a null set, some n has P(L∈B,ea≥1/n)>0, so the numerator is positive.

2.2F1F9F11step 1.3

For every B∈B(L), the defining event integrals of ma(L) under Pa, consistency [F1], step 1.3, and the take-out rule [F11] give EPa[1{L∈B}ma(L)]=EPa[1{L∈B}Y]=EPa[1{L∈B}Ya]=EPa[1{L∈B}va].

3.1F5F9F10step 2.1step 2.2

By [F5], va∈L1(P). Since Pa is the law conditional on A=a and P(A=a)>0, EPa∣va∣=EP[1{A=a}∣va∣]P(A=a)≤EP∣va∣P(A=a)<∞, so va∈L1(Pa). Also ma(L)∈L1(Pa) by [F9]. These are σ(L)-measurable versions under Pa with the same event integrals for Y by step 2.2. Uniqueness [F10] gives ma(L)=va Pa-almost surely. Step 2.1 transfers this equality to PL-almost every covariate value, so the integral in the statement is finite and independent of the conditional-law version and its null-set filler.

4.1F12F13step 3.1

By [F12], EP[va]=EP[Ya]. Since ma(L)=va P-almost surely on the target covariate law by step 3.1, the change-of-variables identity [F13] yields ∫ma(l)PL(dl)=EP[Ya].

5.1F3F4F9F10F12F13F14step 2.1step 4.1algebra∎

If L is countably discrete, positivity implies P(A=a,L=l)>0 for every atom l with P(L=l)>0, so the conditional-mean definition in the statement and the version identity [F9] give ma(l)=E[Y∣A=a,L=l] there. Splitting the integral in step 4.1 over the countable support proves the displayed sum; its absolute convergence follows from the integrability of va. For a=0,1, linearity of conditional expectation [F12] gives the CATE version m1(L)−m0(L), and subtraction of the two mean identities gives the ATE formula. Equal observed-data laws give the same PL and the same law Qa of (L,Y) conditional on A=a, since Qa(D)=P((L,Y)∈D,A=a)/P(A=a) for measurable D⊆L×R. Under this common Qa, the conditional means of Y given L have the same defining event integrals, so [F10] makes their measurable versions equal Pa,L-almost everywhere. Step 2.1 transfers that equality to PL-almost everywhere. Hence [F14] identifies each E[Ya] and the ATE.

Remarks

This theorem is for discrete treatment values. For continuous A, conditional-law versions are uniquely determined only PA-almost everywhere: any two regular conditional laws agree outside a single conditioning-law null set by Simultaneous ae uniqueness of regular conditional distributions, and factoring through A transfers that qualification to PA. The theorem asserts no pointwise causal effect at a PA-null value; a specified version and any continuity or smoothness assumptions need a separate proof. Conditional exchangeability is generally untestable from the observed law. If positivity fails on a target stratum, that stratum's counterfactual mean is unsupported by the observed treatment data; the theorem does not identify the full target by this formula.

5 · Examples, counterexamples and false statements

None yet.

Sources