Alphabeta Math
Pipeline-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.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Contamination and Robust Risk — Examples

1 · Prerequisites

2 · Summary

These examples compute the mean's directional response along a gross-error path, the exact modulus and equalizing contaminations in a Bernoulli Huber model, and a finite-sample replacement bound. The bounded replacement calculation uses values in [0,1]; it does not imply a robust mean rate for unbounded observations.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The mean has an unbounded directional derivative supremum

Example

On R with its Borel sigma-algebra, for F=δ0 and H=δa, the mean functional T(G)=∫x dG(x) has T(Fϵ,H)=ϵa and right derivative a at ϵ=0. Each path law has finite support and hence a finite first moment. Taking the supremum of the absolute derivatives over a∈R gives +∞.

Facts & Assumptions

Given: The gross-error path and point masses F=δ0, H=δa.

[F1]

Gross-error contamination path: Fϵ,H=(1−ϵ)F+ϵH for 0≤ϵ≤1.

[F2]

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

[F3]

Expectation agrees with the published finite weighted sum: on a finite probability space, expectation is the finite weighted sum of attained values.

[F4]

The Borel sigma-algebra of a topological space: the real line carries the sigma-algebra generated by its open sets, so the identity function is measurable.

Verification

1.1F1F2algebra

By [F1] and [F2], the path law places weight 1−ϵ at 0 and weight ϵ at a; this also covers a=0, when both atoms coincide.

2.1F3F4step 1.1algebra

The identity function is measurable for the Borel sigma-algebra because each Borel set is its own preimage under the identity. Let S={0,a} with its full power-set sigma-algebra and weights w(b)=Fϵ,H({b}). Since the complement of S has path-law measure zero, the integral of the identity is the integral of its restriction to this finite probability space: both are the same finite sum over the distinct atoms (apply the simple-function integral separately to the positive and negative parts). Thus [F3] gives T(Fϵ,H)=(1−ϵ)0+ϵa=ϵa, while T(F)=0.

3.1step 2.1algebra∎

For ϵ>0, the difference quotient is (T(Fϵ,H)−T(F))/ϵ=a, so the right derivative at zero is a. Since a ranges over all real numbers, the supremum of its absolute value is +∞.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Bounded sample-mean change under replacements and a common corrupted sample

Example

For integers N≥1 and 0≤k≤N, if xi,yi∈[0,1] and at most k coordinates differ, then

∣N−1∑i=1Nyi−N−1∑i=1Nxi∣≤k/N.

For the coupling example, take X=Θ={0,1} with their full power-set sigma-algebras (Measurable spaces and measurable sets) and the experiment Pθ=δθ (Statistical experiments, The Dirac set function at a point, A Dirac set function is a probability measure). For N=2 and replacement fraction η=1/2, the clean samples (0,0) and (1,1) can both be changed to (0,1) with one replacement, so the two parameter values induce the same observed law.

Facts & Assumptions

Given: Clean iid samples and a sample-replacement coupling as defined in Adversarial sample replacement.

[F1]

Adversarial sample replacement: the clean vector is iid and the mismatch count is at most ⌊ηN⌋ almost surely; the adversary may depend on the clean sample.

[F2]

Huber contamination model: under the Huber model the observed coordinates are iid from one common mixture law.

[F3]

Measurable spaces and measurable sets, Statistical experiments, The Dirac set function at a point, and A Dirac set function is a probability measure: the two-point experiment on full power sets has clean law δθ at each θ∈{0,1}, so its size-two clean iid samples are (0,0) and (1,1) almost surely.

Verification

1.1givenalgebra

Let I={i:xi≠yi}, with ∣I∣≤k. Since xi,yi∈[0,1], each changed coordinate satisfies ∣yi−xi∣≤1, and ∣N−1∑i(yi−xi)∣=∣N−1∑i∈I(yi−xi)∣≤∣I∣/N≤k/N.

1.2F1F3givenconstruct

Use a one-point probability space for each coupling. By [F3], at parameter 0 the clean iid sample is (0,0); set the observed vector to (0,1). At parameter 1 the clean sample is (1,1); set the observed vector to (0,1). Each coupling changes exactly one of two coordinates, which is the allowed ⌊(1/2)2⌋=1 replacement, so both observed laws are the same point mass.

2.1F1F2step 1.2algebra∎

A rule that sees only the observed vector receives the same value (0,1) under both parameter laws, so it cannot identify both parameters. The observed vector is not iid: its first coordinate is 0 almost surely and its second is 1 almost surely, whereas [F2] requires identical coordinate laws. Thus this replacement mechanism is distinct from iid Huber contamination.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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).

Sources