Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

A reversible linear-Gaussian additive-noise model

Example

Assume AC. Let X,N be independent standard normal random variables and set Y=X+N. The forward model Y=X+N is an additive-noise model, and the same joint law also has the reverse representation X=12Y+M,M:=X−N2, where M is independent of Y. Indeed, the joint density of (Y,M) is pY,M(y,m)=12πexp⁡ ⁣(−y24−m2)=(12πe−y2/4)(1πe−m2). The forward structural function f(x)=x 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.

Facts & Assumptions

Given: Assume AC and take independent X,N∼N(0,1) with standard normal density ϕ(t)=(2π)−1/2e−t2/2.

[A1]

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ω), AC implies DC implies countable choice

[F1]

The standard normal law has density ϕ, and its affine images are the corresponding normal laws. Standard normal and normal laws

[F2]

ϕ is a positive normalized Lebesgue density. The standard normal density has total mass one

[F4]

A bivariate additive-noise equation has the form Y=f(X)+N with independent X,N. Continuous additive-noise models on finite DAGs

[F5]

Condition 19 is inequality with its displayed differential equation at at least one point where ν′′(y−f(x))f′(x)≠0. Condition 19 and restricted additive-noise models

Verification

Given: The independent standard normal variables X,N and the definitions in the Example.

1.1givenA1F1F2F4

Under AC [A1], [F1]–[F2] and independence give the density ϕ(x)ϕ(n)=(2π)−1e−(x2+n2)/2 for (X,N). The forward equation Y=X+N is an additive-noise equation by [F4].

2.1step 1.1F3algebra

The linear map (x,n)↦(y,m)=(x+n,(x−n)/2) has determinant −1 and inverse (y,m)↦(x,n)=(y/2+m,y/2−m), whose determinant also has absolute value 1. By [F3], substituting the inverse into the density from step 1.1 gives pY,M(y,m)=12πexp⁡ ⁣(−(y/2+m)2+(y/2−m)22)=12πe−y2/4−m2.

3.1step 2.1F1F2algebra

The last density factors as pY(y)pM(m) with pY(y)=(2π)−1e−y2/4 and pM(m)=π−1/2e−m2. 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 M⊥Y. Since M=X−Y/2, rearranging gives X=Y/2+M.

4.1givenF5algebra∎

For f(x)=x and standard normal input and noise, ξ(x)=ν(x)=−x2/2−12log⁡(2π), f′=1, f′′=f′′′=0, ξ′′′=ν′′′=0, and ν′′=−1. The Condition 19 domain is all (x,y) because ν′′(y−f(x))f′(x)=−1≠0; both sides of its equation equal zero there. Thus its required inequality never holds, so Condition 19 fails.

Depends on

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