Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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.

Gaussian tail tilting is logarithmically efficient but not bounded-relative-error

Statement

Assume AC. Let P=N(0,1), Aa=[a,∞), pa=P(Aa)=Φˉ(a), and Qa=N(a,1), for a>0. Let Za=1Aa(X) dP/dQa(X) for X∼Qa, and let p^a,n be the average of n IID copies. Then EQa[Za]=pa,EQa[Za2]=ea2Φˉ(2a). As a→∞, p^a,n is logarithmically efficient, while its one-sample relative error grows asymptotically as (π/2)1/4a. In particular this tilt is not bounded-relative-error.

Facts & Assumptions

Given: The standard-normal density and tail, the event Aa, the proposal Qa, and a>0.

[A1]

The Axiom of Choice: AC is inherited through Standard normal and normal laws; no further choice is used.

[F1]

Standard normal and normal laws: N(0,1) has density ϕ(x)=e−x2/2/2π, and N(a,1) is its translate by a.

[F2]

Standard-normal Mills bounds and logarithmic tail asymptotics: Φˉ(x)∼ϕ(x)/x and log⁡Φˉ(x)∼−x2/2 for x→∞.

[F3]

Rare-event efficiency and work criteria: Relative error is Var⁡(Za)/pa, and logarithmic efficiency is determined by log⁡E[Za2]/log⁡(pa2).

[F4]

Ordinary importance sampling is unbiased: Under the event-support and integrability hypotheses, the ordinary importance-sampling mean equals pa.

[F5]

Ordinary importance sampling has finite variance and a CLT under a weighted second moment: A finite weighted second moment gives Var⁡(Za)=E[Za2]−pa2.

[F6]

Unbiasedness and exact variance of the IID Monte Carlo mean: For n IID square-integrable contributions, the sample mean has mean pa and variance Var⁡(Za)/n.

Proof

1.1A1F1F4givenalgebra

For every x∈R, the density ratio is ϕ(x)/ϕ(x−a)=exp⁡(−ax+a2/2). The proposal has positive density on Aa, and 0≤Za≤e−a2/2 on Aa, so the event-support and integrability hypotheses of [F4] hold. Hence EQaZa=pa.

1.2F1givenalgebra

Direct integration gives EQaZa2=∫a∞e−2ax+a2ϕ(x−a) dx. With y=x−a, the integrand becomes e−2ay−a2ϕ(y)=ea2ϕ(y+2a); the integral is ea2Φˉ(2a), which is finite for every a>0.

2.1F2F3F6step 1.2givenalgebra

For the average of n≥1 IID contributions, [F6] gives E[p^a,n2]=pa2+E[Za2]−pa2n,pa2≤E[p^a,n2]≤pa2+E[Za2]. By [F2], log⁡pa2=−a2+o(a2) and log⁡E[Za2]=a2+log⁡Φˉ(2a)=−a2+o(a2). Therefore also log⁡(pa2+E[Za2])=−a2+o(a2). The two bounds squeeze log⁡E[p^a,n2]=−a2+o(a2), while 2log⁡pa=−a2+o(a2). By [F3], the logarithmic-efficiency ratio tends to 1.

3.1F2F4F5step 1.2algebra∎

Mills' equivalent in [F2] yields EZa2pa2∼ea2ϕ(2a)/(2a)(ϕ(a)/a)2=π/2 a. Using [F4] and [F5], RE⁡(p^a,1)2=EZa2/pa2−1∼π/2 a; taking square roots gives the stated divergence.

Depends on

Used by

Dependency tree · two levels

30 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