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 with its Borel sigma-algebra and sample space with full power set. Let be the point masses, set , and use absolute parameter loss . Then
For , set , , , and ; both Huber mixtures are Bernoulli. For , endpoint laws can also be made identical.
Facts & Assumptions
Given: The Bernoulli experiment, absolute loss, Huber mixtures, and the modulus definition.
Huber contamination model: each observed coordinate has law .
Huber contamination modulus: is the supremum of parameter loss over clean pairs within the specified total-variation threshold, with the endpoint defined separately.
Total variation distance for probability laws: total variation is the supremum over measurable events, with no factor .
The Dirac set function at a point and A Dirac set function is a probability measure: is the probability law concentrated at .
A convex mixture of probability laws is a probability law: convex mixtures of probability laws are probability laws.
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
The weights in are nonnegative and sum to one. By [F4] and [F5], each is a probability law. On the full power set of the four events are , and .
For the four events in step 1.1, the probability differences are either zero or . Thus [F3] gives . Under absolute loss, the allowed parameter separation is at most when . If the fraction is at most , the pair attains it; if it is at least , the endpoints attain separation . The endpoint definition gives .
For , both chosen parameters lie in . Under the success probability is ; under it is . Hence both mixtures are Bernoulli.
For , take , set and , and define . The lie in , so [F4] and [F5] make these probability laws. The mixture success probabilities are and . At the clean part vanishes and both mixtures still equal Bernoulli.
Depends on
- Huber contamination model
- Huber contamination modulus
- Total variation distance for probability laws
- The Dirac set function at a point
- A Dirac set function is a probability measure
- A convex mixture of probability laws is a probability law
- Measurable spaces and measurable sets
- The Borel sigma-algebra of a topological space
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
- Mengjie Chen, Chao Gao and Zhao Ren, Robust Covariance and Scatter Matrix Estimation under Huber’s Contamination Model, §§1 and 5 (standard reference, not scraped)
- Philippe Rigollet, 18.S997: High-Dimensional Statistics, Lecture Notes, Chapter 5, §5.3 (standard reference, not scraped)