Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Measurable minimum-norm geometric-median selection

Statement

Fix a separable real Hilbert space H and an integer k≥1. The rule in Geometric median of block means defines a single-valued Borel map Hk→H: for every tuple (m1,…,mk) the function Fm(z)=∑j=1k∥z−mj∥ has a nonempty closed convex minimizer set, and that set has a unique point of minimum norm. The choice-free Borel construction below does not use weak compactness or reflexivity. Countable Choice is used only for the published Hilbert projection supplier that identifies the minimum-norm point.

Facts & Assumptions

Given: A separable real Hilbert space H, an integer k≥1, and a tuple m=(m1,…,mk)∈Hk.

[F1]

The geometric-median objective is Fm(z)=∑j=1k∥z−mj∥; the algorithm selects the minimum-norm point among its minimizers (Geometric median of block means).

[F2]

In a Hilbert space, a nonempty closed convex set has a unique nearest point to 0 under Countable Choice (Projection onto a nonempty closed convex set, The Axiom of Countable Choice (ACω)).

[F4]

Cauchy–Schwarz implies ∣⟨x,y⟩∣≤∥x∥∥y∥ in a Hilbert space (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F5]

A continuous real-valued function on a nonempty compact metric space attains a minimum and maximum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

[F6]

In a compact metric space, every family of closed sets with the finite-intersection property has nonempty intersection (A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection).

[F7]

Borel sets form a sigma-algebra, a map is Borel when inverse images of Borel sets are Borel, countable infima of Borel real maps are Borel, and pointwise limits of Borel real maps are Borel (The Borel sigma-algebra of a topological space, A measurable function between measurable spaces, Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable).

[F8]

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

Proof

technique · direct

Given: A separable real Hilbert space H, an integer k≥1, and a tuple m=(m1,…,mk)∈Hk.

1.1F1F3F4F5algebra

Let V=span⁡{m1,…,mk}. In the given center order, Gram–Schmidt replaces mj by rj=mj−∑ℓ<j⟨mj,eℓ⟩eℓ using the previously retained orthonormal vectors; if rj=0 it is skipped, and otherwise e=rj/∥rj∥ is appended. Induction on the finite list shows the retained vectors are orthonormal and span V. For d=dim⁡V>0, if vn=∑ℓ=1danℓeℓ∈V converges in H to v, then [F4] gives anℓ=⟨vn,eℓ⟩→⟨v,eℓ⟩ for each ℓ; the finite sums converge to ∑ℓ⟨v,eℓ⟩eℓ=v, so V is closed. If d=0, all centers are zero and Fm(z)=k∥z∥ has the unique minimizer 0. For d>0, set PVz=∑ℓ⟨z,eℓ⟩eℓ; its residual is orthogonal to V. Pythagoras gives ∥z−mj∥2=∥PVz−mj∥2+∥z−PVz∥2, so Fm(PVz)<Fm(z) whenever z∉V. Thus every minimizer lies in V. The function Fm is continuous and coercive because Fm(z)≥k∥z∥−∑j∥mj∥; its sublevel set {z∈V:Fm(z)≤Fm(0)} is nonempty, closed and bounded in the finite-dimensional coordinate space Rd, hence compact by [F3]. By [F5], Fm attains a minimum there; the full minimizer set Cm is nonempty, closed, bounded and compact, and it is convex because Fm is convex.

1.2F1F2F3F4F5F7F8construct

By [F2], Cm has a unique point z∗(m) nearest to 0, its unique minimum-norm point. If H={0}, the selection is the constant zero map; otherwise fix a unit vector e and a countable dense sequence (da)a≥1 in H, whose existence is given by [F8]. The countable set D={⟨da,e⟩:a≥1} is dense in R: for each t∈R, density gives daj→te, and [F4] gives ⟨daj,e⟩→t. For λ>0, Gλ,m(z)=Fm(z)+λ∥z∥2 is continuous, coercive and strictly convex. Projection to V cannot increase Fm and strictly decreases the squared norm off V, so every minimizer lies in V; if d=0 the single candidate is 0. For d>0, a closed bounded sublevel set in V is compact by [F3], so [F5] gives a unique minimizer zλ(m). By continuity and density, hλ(m)=inf⁡aGλ,m(da)=Gλ,m(zλ(m)). Each map m↦Gλ,m(da) is continuous, so [F7] makes their countable infimum hλ Borel. For s≥1, set Aa,s={m:Gλ,m(da)<hλ(m)+1/s}. The countable dense set D gives Aa,s=⋃q∈D{m:Gλ,m(da)<q}∩{m:hλ(m)>q−1/s} so Aa,s is Borel; density ensures at least one such a for each m. The least such a is a Borel, countably-valued map because its level set at a is Aa,s∖⋃b<aAb,s, and the selected point map is Borel since each open-set preimage is the union of its Borel level sets whose values lie in that open set. The selected point is within (λs)−1/2 of zλ(m): convexity of Fm and ∥(1−t)z+ty∥2=(1−t)∥z∥2+t∥y∥2−t(1−t)∥y−z∥2, applied at the minimizer and followed by t↓0, give Gλ,m(y)−Gλ,m(zλ)≥λ∥y−zλ∥2. Hence the selected maps converge pointwise to zλ. Since they are countably valued with Borel level sets, their distances to each da are Borel and converge to ∥zλ−da∥; [F7] makes these limits Borel. Balls with centers da and positive rational radii form a countable basis of the separable metric space H: every open neighborhood of a point contains such a ball around a sufficiently close dense center. Thus inverse images of open sets are countable unions of Borel inverse images of these balls, proving m↦zλ(m) is Borel.

2.1F3F6F7step 1.2algebra

For every s≥1, comparison with z∗(m) in the minimization of Fm+s−1∥⋅∥2 gives ∥z1/s∥≤∥z∗∥ and Fm(z1/s)≤Fm(z∗)+s−1∥z∗∥2. If d=0 then both points are 0. Otherwise all z1/s lie in the compact ball BV(0,∥z∗∥) by [F3]. The closed tail sets Cn={z1/s:s≥n}‾ inside this ball are nonempty, nested and have the finite-intersection property, so [F6] gives c∈⋂nCn. For every n, continuity of Fm and the tail bounds imply Fm(c)≤Fm(z∗)+∥z∗∥2/n, while ∥c∥≤∥z∗∥; letting n→∞ shows c∈Cm is a minimum-norm minimizer, hence c=z∗. If the sequence did not converge to z∗, some ρ>0 would leave arbitrarily late terms at distance at least ρ; the closed tail closures of those terms are nonempty nested subsets of the same compact ball, so [F6] gives a point in their intersection. It lies in every Cn, hence equals z∗, but its distance from z∗ is at least ρ, a contradiction. Thus z1/s→z∗. By [F7] and the separable-metric basis argument of step 1.2, the pointwise limit of the Borel maps z1/s is Borel.

3.1F1F2step 1.1step 1.2step 2.1∎

The minimizer set is nonempty, closed and convex by step 1.1, its minimum-norm point is unique by step 1.2, and step 2.1 proves the selected map is Borel. The only choice principle used is Countable Choice in [F2]; the dense sequence is supplied by separability and all subsequent approximations use least-index rules.

Depends on

Used by

Cited to discharge well-definedness by Geometric median of block means.

Dependency tree · two levels

83 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