Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 Bernoulli Huber modulus and indistinguishable mixtures

Example

Take Θ=[0,1] with its Borel sigma-algebra and sample space {0,1} with full power set. Let δ0,δ1 be the point masses, set Pθ=(1−θ)δ0+θδ1, and use absolute parameter loss L(θ,a)=∣θ−a∣. Then

ω(ϵ,Θ)=min⁡{ϵ/(1−ϵ),1}(0≤ϵ<1),ω(1,Θ)=1.

For 0<ϵ≤1/2, set θ0=0, θ1=ϵ/(1−ϵ), Q0=δ1, and Q1=δ0; both Huber mixtures are Bernoulli(ϵ). For 1/2≤ϵ≤1, endpoint laws can also be made identical.

Facts & Assumptions

Given: The Bernoulli experiment, absolute loss, Huber mixtures, and the modulus definition.

[F1]

Huber contamination model: each observed coordinate has law (1−ϵ)Pθ+ϵQ.

[F2]

Huber contamination modulus: ω is the supremum of parameter loss over clean pairs within the specified total-variation threshold, with the ϵ=1 endpoint defined separately.

[F3]

Total variation distance for probability laws: total variation is the supremum over measurable events, with no factor 1/2.

[F4]

The Dirac set function at a point and A Dirac set function is a probability measure: δb is the probability law concentrated at b.

[F5]

A convex mixture of probability laws is a probability law: convex mixtures of probability laws are probability laws.

[F6]

Measurable spaces and measurable sets and The Borel sigma-algebra of a topological space: the parameter set uses its Borel measurable structure and the finite sample space its full-power-set measurable structure.

Verification

1.1givenF4F5F6algebra

The weights in Pθ=(1−θ)δ0+θδ1 are nonnegative and sum to one. By [F4] and [F5], each Pθ is a probability law. On the full power set of {0,1} the four events are ∅,{0},{1}, and {0,1}.

2.1F2F3step 1.1algebra

For the four events in step 1.1, the probability differences are either zero or ±(θ0−θ1). Thus [F3] gives TV(Pθ0,Pθ1)=∣θ0−θ1∣. Under absolute loss, the allowed parameter separation is at most min⁡{ϵ/(1−ϵ),1} when ϵ<1. If the fraction is at most 1, the pair 0,ϵ/(1−ϵ) attains it; if it is at least 1, the endpoints attain separation 1. The endpoint definition gives ω(1,Θ)=1.

3.1F1F4step 2.1algebra

For 0<ϵ≤1/2, both chosen parameters lie in [0,1]. Under (θ0,Q0) the success probability is ϵ; under (θ1,Q1) it is (1−ϵ)ϵ/(1−ϵ)=ϵ. Hence both mixtures are Bernoulli(ϵ).

4.1F1F4F5step 3.1algebra∎

For 1/2≤ϵ≤1, take θ0=0,θ1=1, set q0=1/(2ϵ) and q1=1−1/(2ϵ), and define Qj=(1−qj)δ0+qjδ1. The qj lie in [0,1], so [F4] and [F5] make these probability laws. The mixture success probabilities are ϵq0=1/2 and (1−ϵ)+ϵq1=1/2. At ϵ=1 the clean part vanishes and both mixtures still equal Bernoulli(1/2).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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