Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Exact scalar MMSE denoiser for a two-point prior

Example

Let a,σ,γ>0 and let the scalar prior put mass 1/2 at each of −a and a. Under the Gaussian likelihood kernel ρσ(z−u)=exp⁡(−(z−u)2/(2σ2)), its exact posterior-mean map is Dσ(z)=atanh⁡ ⁣(azσ2),tanh⁡(s)=exp⁡(s)−exp⁡(−s)exp⁡(s)+exp⁡(−s). The normalizing constant of the Gaussian likelihood cancels in the posterior. For every z, Dσ(z) uniquely minimizes the posterior squared-error risk and, with the potential hσ,γ constructed from this prior, is the unique global minimizer of x↦(x−z)2/2+γhσ,γ(x).

Facts & Assumptions

Given: a,σ,γ>0, the two-point prior and Gaussian likelihood in the Example, and the definitions of a Dirac probability measure and the exact posterior-mean map.

[F1]

The Dirac set function at a point: δx0(E)=1 when x0∈E and 0 otherwise.

[F2]

A Dirac set function is a probability measure: each Dirac set function is a probability measure.

[F3]

The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y): exp⁡(x+y)=exp⁡(x)exp⁡(y) for all real x,y.

[F4]

Tweedie identity, positive Jacobian, and the MMSE proximal potential: if a Borel probability measure on R is not concentrated on an affine hyperplane, then for the Gaussian likelihood kernel its posterior-mean map uniquely minimizes posterior squared-error risk and the constructed hσ,γ makes that map the unique global minimizer of 12∣x−z∣2+γhσ,γ(x).

Verification

Given: The hypotheses and definitions in the Example.

1.1F1F2givenalgebra

By [F1]–[F2], μ=12δ−a+12δa is a probability measure: for pairwise-disjoint Borel sets each of the two atoms occurs in at most one set, and μ(R)=1. Since a>0, its two atoms are distinct and each has positive mass; every affine hyperplane in R is a singleton, so μ is not concentrated on any affine hyperplane. The posterior weights at a and −a are proportional to ρσ(z−a) and ρσ(z+a), hence Dσ(z)=aρσ(z−a)−ρσ(z+a)ρσ(z−a)+ρσ(z+a).

2.1F3step 1.1algebra

Factoring exp⁡(−(z2+a2)/(2σ2)) from numerator and denominator and using [F3] yields Dσ(z)=a(exp⁡(az/σ2)−exp⁡(−az/σ2))/(exp⁡(az/σ2)+exp⁡(−az/σ2)), which is the stated hyperbolic-tangent formula.

3.1F4givenstep 2.1∎

Fact [F4] applies to this nondegenerate two-point prior, so the posterior mean is the unique squared-error minimizer and the lemma's hσ,γ makes Dσ(z) the unique global minimizer of the displayed proximal objective for every z.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

37 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