Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Adaptive multivariate trimmed mean

Definition

Let d,N≥1 be integers, let 0≤η≤1/10, and let 0<δ<1 satisfy N≥2560log⁡(2/δ). Given two observed halves X~1,…,X~N and Y~1,…,Y~N in Rd, set

ε=max⁡{10η,2560log⁡(2/δ)N}∈(0,1].

For v∈Sd−1, sort ⟨Y~i,v⟩ nondecreasingly and let αv and βv be its order statistics of ranks ⌈εN/2⌉ and ⌈(1−ε/2)N⌉. Write ϕa,b(t)=min⁡{b,max⁡{a,t}}. For Q>0 define UQ(v)=1N∑i=1Nϕαv−Q, βv+Q(⟨X~i,v⟩),Γ(v,Q)={z∈Rd:∣⟨z,v⟩−UQ(v)∣≤2εQ}. and Γ(Q)=⋂v∈Sd−1Γ(v,Q). For each j∈Z, put

Kj=⋂i≥jΓ(2i),S={j∈Z:Kj≠∅}.

Return the unique minimum-norm point of Kj if S has least element j; if S=Z, return the unique minimum-norm point of ⋂i∈ZΓ(2i); if S=∅, return the first-half sample mean N−1∑i=1NX~i. This three-branch selector is total on the displayed input domain; its existence and Borel measurability are proved in Totality and measurability of the repaired multivariate trimmed-mean selector ↗.

Depends on

Used by

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