Alphabeta Math
DefinitionDefinition: 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.

Continuous additive-noise models on finite DAGs

Definition

Fix a nonempty finite directed acyclic graph G=(V,E) with a specified topological order v1,…,vp; every arrow points from an earlier to a later vertex. For j∈V, let pa⁡(j)={i∈V:(i,j)∈E} be its parent set, and let nd⁡(j) be the vertices other than j that are not descendants of j. A continuous additive-noise model on G consists of real random variables Xj,Nj on a common probability space and continuous Borel functions fj:Rpa⁡(j)→R such that Xj=fj(Xpa⁡(j))+Nj recursively in the topological order. The finite family of noises is mutually independent, and each Nj has a strictly positive Lebesgue density qj. All vertices of G are observed; no latent vertices are omitted from the model. The observational law is the law of the vector X=(Xj)j∈V.

The model is causally minimal when every parent input is essential: for each edge i→j, there are values of the other parent coordinates and two distinct real values of the i-coordinate at which fj takes different values. A root has no parent-coordinate minimality condition.

Depends on

Used by

Dependency tree · two levels

11 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