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.

A smooth median has bounded influence and about one-half breakdown

Example

Suppose F has a unique median m, satisfies F(m)=1/2, and has a continuous density with f(m)>0. The median's gross-error sensitivity is 1/(2f(m))<∞. For odd sample sizes n=2r+1, the sample median's replacement breakdown fraction is (r+1)/(2r+1), which tends to 1/2 as n increases through odd integers.

Facts & Assumptions

Given: A probability law F and median m satisfying the density and uniqueness assumptions in the Statement of Influence function and sensitivity of the median, and an odd sample size n=2r+1.

[F1]

Influence function and sensitivity of the median: the median has gross-error sensitivity 1/(2f(m)) under these assumptions.

[F2]

Replacement breakdown of the sample mean and odd-sample median: the odd-sample median's replacement breakdown fraction is (r+1)/(2r+1) for every fixed sample.

Verification

1.1F1algebra

By [F1], the influence values have absolute value at most 1/(2f(m)), and their supremum is exactly that value, which is finite because f(m)>0.

1.2F2algebra

By [F2], the finite-sample replacement breakdown fraction is (r+1)/(2r+1)=1/2+1/[2(2r+1)].

2.1step 1.2algebra

Since 1/[2(2r+1)]→0 as r→∞, the odd-sample median breakdown fractions tend to 1/2.

3.1step 1.1step 2.1∎

The bounded pointwise sensitivity and the separate replacement count follow from different definitions and theorems; here the median has both properties under the stated density hypothesis.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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