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

A scalar inverse with a conditioning-dependent shift modulus

Example

Fix R,a0,σ>0 and 0≤ρA<a0/2. The working inverse is g(y)=y/a0. Under a test operator a=a0+δ with ∣δ∣≤ρA, the observation is Y=aθ+ε for θ∈[−R,R] and independent ε∼N(0,σ2). For any two truth laws μ0,μ on [−R,R], define W1(μ,μ0) as the infimum of E∣Θ−Θ0∣ over their couplings. The risk is Rμ,δ(g)=Eθ∼μ,ε∣g((a0+δ)θ+ε)−θ∣2=δ2a02Eμθ2+σ2a02, and it satisfies Rμ,δ(g)≤(ρA2R2+σ2)/a02 and ∣Rμ,δ(g)−Rμ0,δ(g)∣≤2δ2Ra02W1(μ,μ0).

Facts & Assumptions

Given: R,a0,σ>0, 0≤ρA<a0/2, ∣δ∣≤ρA, θ∈[−R,R], ε∼N(0,σ2) independent of θ, and the working inverse g(y)=y/a0.

[A1]

The test law μ and source law μ0 are Borel probability measures on [−R,R]; W1 is the infimum of expected absolute distance over their couplings.

Verification

1.1givenA1algebra

Substitution gives g(Y)−θ=((a0+δ)θ+ε)/a0−θ=δθ/a0+ε/a0. Independence and Eε=0 make the cross term vanish, so the expected squared error is δ2Eμθ2/a02+σ2/a02. Since ∣θ∣≤R and ∣δ∣≤ρA, this is at most (ρA2R2+σ2)/a02.

2.1A1step 1.1algebra∎

For any coupling (Θ,Θ0) of μ,μ0, ∣Θ2−Θ02∣=∣Θ−Θ0∣∣Θ+Θ0∣≤2R∣Θ−Θ0∣. Taking expectations, then the infimum over couplings, gives ∣Eμθ2−Eμ0θ2∣≤2RW1(μ,μ0). Multiplication by δ2/a02 and step 1.1 yields the claimed risk-transfer bound.

Used by

Nothing in the library uses this result yet.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.