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.
The excess-tail functional cannot upper-bound the trimmed mean
Statement refuted
Replacing the raw centered-tail functional in the univariate trimmed-mean bound by would falsely assert for Split-sample univariate winsorized trimmed mean. This fails for a bounded absolutely continuous law.
Facts & Assumptions
Given: , , , , and , where is a uniform sign and is independent uniform on ; clean coordinates are iid copies. Assume Countable Choice as in the quantile supplier.
Split-sample univariate winsorized trimmed mean sorts the second half at levels and and averages the clipped first half.
An absolutely continuous upper quantile has its specified tail mass uses exact continuous quantiles, with its Countable Choice hypothesis (The Axiom of Countable Choice ()).
Chebyshev's inequality for random variables bounds a centered random variable's tail by its variance divided by the squared threshold.
Counterexample
Given: The displayed parameters and symmetric two-interval clean law. Replace the first negative first-half observations by , or all negatives if fewer; do not change the second half.
This law is absolutely continuous with density on each interval and , has mean zero and variance . The replacement rule is a measurable finite-coordinate rule and makes at most changes. Put , so , and . At lower tail mass the quantile is . Integration over the lower interval gives ; symmetry gives the same upper-tail excess. Hence , using , and .
Let be the event that the clean first-half sign average has absolute value at most , and let be the event that the second-half negative-sign count lies between and . The sign average has variance , so [F3] gives . The second-half count has variance , so . On there are at least negative first-half signs, so the replacement changes exactly of them. The resulting sign average is at least . On , the ranks in [F1] put in the negative interval and in the positive interval, since . Every clipped value is at least its altered sign minus : a negative value is at least , and a positive value, including a replacement , clips to at least . Therefore on , whose probability is at least . This exceeds the proposed threshold with probability greater than , disproving the asserted coverage.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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
- Lugosi and Mendelson, Robust Multivariate Mean Estimation: The Optimality of Trimmed Mean, pp. 6-23 (standard reference, not scraped)