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.
A reversible linear-Gaussian additive-noise model
Example
Assume AC. Let be independent standard normal random variables and set . The forward model is an additive-noise model, and the same joint law also has the reverse representation where is independent of . Indeed, the joint density of is The forward structural function and the two Gaussian log densities satisfy the differential equation in Condition 19 at every point of its nonzero domain, so Condition 19 fails. Thus this reversible case lies outside the bivariate identifiability theorem's hypothesis.
Example references
The additive-noise equations and their independent noise convention
Condition 19 and its nonzero domain
The bivariate direction-identifiability conclusion
Peters et al., JMLR (2014), Example 24
Peters, Janzing, and Schölkopf, Elements of Causal Inference, §4.1.4
Assaad, Devijver, and Gaussier, course notes (2023), slides 22–23
Facts & Assumptions
Given: Assume AC and take independent with standard normal density .
AC is the Axiom of Choice and implies countable choice (AC), the additional axiom interface used by the normal-density and linear-change-of-variables suppliers. The Axiom of Choice, The Axiom of Countable Choice (), AC implies DC implies countable choice
The standard normal law has density , and its affine images are the corresponding normal laws. Standard normal and normal laws
is a positive normalized Lebesgue density. The standard normal density has total mass one
An invertible linear transformation changes Lebesgue density by the absolute determinant of its inverse matrix. A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not
A bivariate additive-noise equation has the form with independent . Continuous additive-noise models on finite DAGs
Condition 19 is inequality with its displayed differential equation at at least one point where . Condition 19 and restricted additive-noise models
Verification
Given: The independent standard normal variables and the definitions in the Example.
Under AC [A1], [F1]–[F2] and independence give the density for . The forward equation is an additive-noise equation by [F4].
The linear map has determinant and inverse , whose determinant also has absolute value . By [F3], substituting the inverse into the density from step 1.1 gives
The last density factors as with and . Each factor integrates to one by the affine normal-law description [F1] and normalization [F2], so the joint law is the product of its marginals and . Since , rearranging gives .
For and standard normal input and noise, , , , , and . The Condition 19 domain is all because ; both sides of its equation equal zero there. Thus its required inequality never holds, so Condition 19 fails.
Depends on
- Continuous additive-noise models on finite DAGs
- Condition 19 and restricted additive-noise models
- Positive joint density of a finite additive-noise model
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- AC implies DC implies countable choice
- Standard normal and normal laws
- The standard normal density has total mass one
- A linear map $T$ of $\mathbb{R}^n$ sends Lebesgue measurable sets to Lebesgue measurable sets, with $\lambda_n(T[E])=|\det T|\,\lambda_n(E)$ when $T$ is invertible and $T[E]$ Lebesgue null when it is not
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
75 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
- Jonas Peters, Joris Mooij, Dominik Janzing, and Bernhard Schölkopf, Causal Discovery with Continuous Additive Noise Models, Example 24 (standard reference, not scraped)
- Jonas Peters, Dominik Janzing, and Bernhard Schölkopf, Elements of Causal Inference, §4.1.4 (standard reference, not scraped)
- K. Assaad, E. Devijver, and G. Gaussier, Causal discovery: noise-based methods, ENS Lyon course notes (2023), slides 22–23 (standard reference, not scraped)