Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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.

Standardization for a causal mean

Definition

Let Q be a probability law for an observed discrete or atomic treatment A, a covariate random element L, and a real-valued observed outcome Y. Fix an atom a with Q(A=a)>0, let G=σ(L), and define Ia=1{A=a},ea(L)=EQ[Ia∣G]. Assume ea(L)>0 Q-almost surely and IaY∈L1(Q). Define qa(L)=EQ[IaY∣G],ma(L)=qa(L)ea(L). The standardization functional at a is Ψstd(Q;a)=EQ[ma(L)], provided ma(L) is integrable. The numerator and denominator are conditional-expectation classes; the ratio is defined almost surely because the denominator is positive. In conventional notation ma(L) is EQ[Y∣A=a,L], and the displayed expectation averages that treatment-specific conditional mean over the target law of L.

When L has discrete support, this is ∑ℓEQ[Y∣A=a,L=ℓ] Q(L=ℓ). For general L we use the version-free conditional-expectation class above and integrate it under Q; no value of a regression function is chosen at a null covariate stratum.

This is a population functional of the observed law and the true conditional treatment probability. It is not an algorithm for estimating a propensity from a finite sample.

Depends on

Used by

Dependency tree · two levels

18 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