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.
SCM, DAGs, adjustment — 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
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- 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
- 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
- Potential outcomes and identification
- 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
- SCM, DAGs, adjustment
- 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 examples compute a confounded observational association and the backdoor-adjusted target, show how conditioning on a collider creates dependence, verify a front-door formula with overlapping mediator support, and exhibit two Markovian SCMs with the same observed law but different intervention laws. Each conclusion is conditional on the stated SCM and its graph; none treats the model assumptions as empirical facts.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A confounder and a conditioned collider
Example
Consider first a confounding SCM with independent and , observed , and observed . Its DAG is and . The only path between and is the backdoor path .
For collider conditioning, let independent , and set . Its DAG is .
Facts & Assumptions
Given: The finite-valued recursive models and mutually independent Bernoulli exogenous variables specified above.
Mutual independence gives the product joint law for each finite exogenous family. Independent random elements, Independent random elements have product joint law
A noncollider conditioned on blocks a path, while conditioning on a collider activates it. Paths, active paths, and d-separation in a finite DAG
The causal response is obtained by replacing only the treatment equation. Recursive structural causal models on finite DAGs
Verification
Given: [F1]–[F3] and the two models in the Example.
In the confounding model, . Also and . Thus and , although under the variable remains Bernoulli. The difference between the observational conditionals and the intervention law is caused by the open backdoor path through ; conditioning on blocks that path and the adjusted mean is .
For the collider model, by [F1], so the variables are independent before conditioning. But on exactly the three equiprobable pairs . Hence while . Conditioning on the collider therefore creates dependence, exactly as the active-path rule [F2] predicts.
The same observed law can have different intervention laws
Example
Let . In SCM 1 set and ; its graph is . In SCM 2 set and ; its graph is and . Degenerate independent exogenous errors at and complete both Markovian SCMs.
Facts & Assumptions
Given: The two binary SCMs in the Example.
Observational equivalence means equality of the induced sampling laws. Parametric statistical models, Observational equivalence
An estimand is identifiable only if it is constant over parameter values with the same observed law. Estimands on a statistical model, Identifiability of an estimand
Under an intervention only the named structural equation is replaced. Recursive structural causal models on finite DAGs
Verification
Given: [F1]–[F3] and the two SCMs in the Example.
In either model, , so the observed joint law assigns probability to and to , and zero to the other pairs. The parameter values representing the two SCMs are observationally equivalent by [F1].
Under in SCM 1, the equation remains and gives with probability one. Under in SCM 2, the equation remains and is unchanged, so is Bernoulli. Thus for the interventional success probabilities are respectively and ; the intervention-law estimand is not constant on the observational-equivalence class in step 1.1. It is therefore not identifiable on the two-model statistical model by [F2].
A binary SCM where front-door adjustment works
Example
Let , , and be mutually independent. Set The full graph is , , , . The only directed -to- path passes through . The path is blocked by its collider , so and are d-separated by the empty set in . The path is blocked by when checking the other front-door condition. Both mediator values have positive probability conditional on either treatment value, so the nested conditional laws have the required support.
Facts & Assumptions
Given: The finite SCM and independent Bernoulli laws in the Example.
The exogenous family has its finite product law. Independent random elements, Independent random elements have product joint law
The front-door theorem states the observed functional and its graph and support hypotheses. Front-door adjustment identifies an interventional mean
Interventions replace only the named structural equation. Recursive structural causal models on finite DAGs
Verification
Given: [F1]–[F3] and the SCM in the Example.
Since , Bayes' rule gives and . Since is independent of , and . Thus for each both mediator outcomes have positive conditional probability; the nested-law support condition in [F2] holds.
If , then . If , then , so and . Averaging over the marginal law of gives , while the same inner average for is . The front-door formula [F2] therefore gives
Under , with probability and with probability . The exogenous remains Bernoulli and independent of , so and . Hence , agreeing with the observed functional.
Sources
- Judea Pearl, Causal Diagrams for Empirical Research, §2-1 and §3-1, pp. 671–675
- Miguel A. Hernán and James M. Robins, Causal Inference: What If, Fine Point 6.1 and §7.1, pp. 78, 85–86
- Judea Pearl, Causal Diagrams for Empirical Research, §3-1, pp. 674–675
- Miguel A. Hernán and James M. Robins, Causal Inference: What If, §6.1, pp. 71–74
- Judea Pearl, Causal Diagrams for Empirical Research, §3-2, pp. 675–676
- Miguel A. Hernán and James M. Robins, Causal Inference: What If, Technical Point 7.4, p. 101