Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Finite-variance Hilbert mean bound for geometric medians of means

Statement

Assume Countable Choice. Let H be a separable real Hilbert space and let X1,…,Xn be iid Borel H-valued random elements with E∥X1∥2<∞. Let μ=EBX1 be their Bochner mean, define x⊗y:h↦⟨h,y⟩x, and let

Σ=EB[(X1−μ)⊗(X1−μ)]∈S1(H),V=tr⁡Σ=E∥X1−μ∥2,

where EB denotes Bochner expectation, S1(H) is the Banach space of trace-class operators on H, and x⊗y is the rank-one operator h↦⟨h,y⟩x. For 0<p<a<1/2, put ψ(a;p)=alog⁡(a/p)+(1−a)log⁡((1−a)/(1−p)) and Ca=(1−a)/1−2a. Set a=7/18, p=1/10, and

k=⌊log⁡(1/δ)ψ(a;p)⌋+1.

If 0<δ<1 and k≤n/2, apply Geometric median of block means to X1,…,Xn using k blocks and call the output μ^. Then

P ⁣(∥μ^−μ∥>11Vlog⁡(1.4/δ)n)≤δ.

If V>0, the same bound holds with ≥ in place of > in the displayed event. If V=0, then μ^=μ almost surely. The finite-variance assumption is on the clean iid sample; no sample-replacement or Huber-contamination guarantee is asserted here.

Facts & Assumptions

Given: Countable Choice, a separable real Hilbert space H, iid Borel random elements X1,…,Xn with finite second moment, 0<δ<1, and the displayed k≤n/2 condition.

[A1]

Countable Choice is used by Projection onto a nonempty closed convex set in the geometric-median selector and by the trace-class supplier chain; the Bochner integrability criterion itself is choice-free (The Axiom of Countable Choice (ACω), Measurable minimum-norm geometric-median selection, Trace class operator).

[F1]

A Borel map into separable H is strongly measurable by finite-valued approximations from a fixed dense sequence; strong measurability and integrability of the norm imply Bochner integrability (Strongly measurable Banach-valued function, Bochner-integrable function, Bochner integrability criterion).

[F2]

Trace-class operators form a Banach space under trace norm, and the trace is a bounded linear functional whose value on a nuclear representation Th=⟨h,u⟩v is ⟨v,u⟩ (Trace class operator, Trace class is a two sided Banach operator ideal, Trace is absolutely convergent and basis independent).

[F3]

The Bochner norm inequality and commutation with bounded linear maps give ∥EBZ∥≤E∥Z∥ and T(EBZ)=EB(TZ) for bounded linear T (Bochner integral norm inequality, Bounded linear maps commute with Bochner integration).

[F4]

Independent random elements have product joint law; disjoint subfamilies of an independent family remain independent (Independent random elements have product joint law, Disjoint groups of an independent sigma-algebra family remain independent).

[F5]

For a nonnegative random variable W and t>0, P(W≥t)≤EW/t (Markov's inequality for random variables).

[F6]

Fubini applies to the integrable scalar cross-term ⟨Yi,Yl⟩ under the product law of independent random elements (Fubini's theorem for L^1 functions on a sigma-finite product, Independent random elements have product joint law).

[F7]

The natural logarithm and exponential satisfy their usual inverse and algebraic identities (The natural logarithm as the inverse of the exponential function, The real exponential function and the number e by a power series).

[F8]

For 0<a<1 and 0<p<1, write ψ(a;p)=alog⁡(a/p)+(1−a)log⁡((1−a)/(1−p)); this is the Bernoulli relative-entropy expression used in the Chernoff calculation below.

[F9]

If a geometric median is farther than Car from a point, more than ak block centers are farther than r from that point (A geometric median is close when a strict majority is close).

[F11]

A nonnegative measurable function with integral zero vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[F12]

The minimum-norm geometric-median selector is Borel, and the block means are continuous functions of the input sample (Geometric median of block means, Measurable minimum-norm geometric-median selection).

[F13]

Separability means that a nonempty space has an at-most-countable dense subset; A nonempty set is at most countable iff it is a surjective image of N enumerates that subset by a sequence (Separability: the existence of an at most countable dense subset).

[L1]

If t=(x−1)/(x+1) and ∣t∣<1, then log⁡x=2∑j=0∞t2j+1/(2j+1); truncating after j=M leaves absolute remainder at most 2∣t∣2M+3/((2M+3)(1−t2)). This follows by integrating the geometric series for 2/(1−t2).

Proof

technique · direct

Given: Countable Choice, a separable real Hilbert space, the iid sample with finite second moment, the confidence parameter δ, and the stated k≤n/2 condition.

1.1F1F13givenalgebra

The map X1 is strongly measurable: by [F13], fix a countable dense sequence (hj) in H and approximate each x∈H by the nearest of h1,…,hm, breaking finite ties by the least index. The cells defining these finite-valued simple Borel maps are Borel because they are finite intersections of strict or weak comparisons of continuous distance functions, and the maps converge pointwise to x. Since ∥X1∥≤1+∥X1∥2, E∥X1∥<∞, so [F1] defines μ=EBX1.

1.2F4F5F7F8F9algebra

If the geometric median is farther than Car0 from μ, [F9] forces more than ak bad block means. For W the number of bad blocks, independence and P(bad block j)≤p give EeλW≤(1−p+peλ)k for λ>0. Markov's inequality with λ=log⁡(a(1−p)/(p(1−a)))>0 gives P(W≥ak)≤e−kψ(a;p)<δ, after substituting this λ and simplifying.

2.1A1F2F3F10F11F12givenstep 1.1

For the rank-one operator x⊗y, [F10] gives ∥x⊗y∥≤∥x∥∥y∥, with equality by testing y/∥y∥ when y≠0; its only possible nonzero singular value is this operator norm, so ∥x⊗y∥1=∥x∥∥y∥. Apply the rank-one map to the finite-valued simple approximants from step 1.1: the resulting S1(H)-valued functions are simple and converge pointwise in trace norm, because ∥u⊗u−v⊗v∥1≤(∥u∥+∥v∥)∥u−v∥. Hence (X1−μ)⊗(X1−μ) is strongly measurable; its trace norm is ∥X1−μ∥2, which is integrable since E∥X1−μ∥2≤2E∥X1∥2+2∥μ∥2. The Bochner integrability criterion gives its Bochner expectation Σ in S1(H). The bounded trace functional commutes with this integral by [F3], and [F2] gives tr⁡Σ=E∥X1−μ∥2=V. For h,g∈H, bounded evaluation maps commute with the integral and give ⟨Σh,g⟩=E[⟨h,X1−μ⟩⟨X1−μ,g⟩]; this is symmetric in h,g and is nonnegative when h=g. If V=0, [F11] gives X1=μ almost surely. Identical distribution and a finite union of null events imply that all Xi=μ simultaneously almost surely; hence every block mean is μ. The objective in [F12] is then k∥z−μ∥, uniquely minimized at μ, so μ^=μ almost surely. Thus the strict-tail event in the Statement is empty when its threshold is zero. Assume V>0 below.

3.1F3F4F6F10step 2.1algebra

Let mj∘ be a block size. For centered Yi=Xi−μ, expand E∥∑i∈BjYi∥2 into diagonal and cross terms. Each diagonal term is V; for i≠l, product-law independence [F4] and scalar Fubini [F6] give E⟨Yi,Yl⟩=∫ ⁣∫⟨x,y⟩ dPY(x)dPY(y)=0. The integrand is integrable because [F10] gives ∣⟨x,y⟩∣≤∥x∥∥y∥ and E∥Yi∥<∞; the inner integral is zero by [F3] and EBYl=0. Dividing by (mj∘)2 yields E∥mj−μ∥2=V/mj∘.

4.1F4F5F12step 3.1givenalgebra

Since k≤n/2, every block has size at least ⌊n/k⌋≥n/(2k). Put r0=2kV/(pn). By [F5] and step 3.1, P(∥mj−μ∥>r0)≤p for each block. The block means are independent by [F4], and [F12] makes their geometric-median aggregate a Borel random element.

5.1F9step 4.1step 1.2algebra

The same Chernoff calculation as step 1.2 applies to every q<a. For each sufficiently large integer s, use radius (1−1/s)r0 in step 4.1, so the bad-block probability is at most ps=p/(1−1/s)2<a. The event {∥μ^−μ∥≥Car0} is contained in the corresponding strict-radius event, whose probability is at most e−kψ(a;ps). Let s→∞; continuity gives e−kψ(a;p)<δ.

6.1F7L1step 2.1step 4.1step 5.1algebra∎

For a=7/18 and p=1/10, Ca=(1−a)/1−2a; applying [L1] with M=50 and t=−13/68,13/22,1/6 gives 2915/10000<ψ(a;p)<2916/10000 and 3364/10000<log⁡(7/5). Hence 5/18<ψ(a;p)<log⁡(7/5) and Ca2/(pψ(a;p))≤11. From k=⌊log⁡(1/δ)/ψ(a;p)⌋+1 we have kψ(a;p)≤log⁡(1/δ)+ψ(a;p)<log⁡(7/(5δ)). Step 4.1 therefore gives the asserted nonstrict-tail bound for V>0 after replacing r0 by its expression; the strict-tail event is a subset, so its bound follows as well. When V=0, exact recovery in step 2.1 gives the strict-tail bound. No nonstrict-tail assertion at zero threshold is made.

Depends on

Used by

Dependency tree · two levels

122 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