Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Concave-modulus intersection of Hilbert balls

Statement

Assume the Axiom of Choice. Let H1,H2 be real Hilbert spaces, let I be any set, let x∈H1, and let (xi)i∈I⊂H1 and (yi)i∈I⊂H2. Let ω:[0,∞)→[0,∞) be continuous, nondecreasing and concave, with ω(0)=0. If ∥yi−yj∥≤ω(∥xi−xj∥)(i,j∈I), then ⋂i∈IB‾(yi,ω(∥xi−x∥))≠∅. The intersection over an empty index set means all of H2.

Facts & Assumptions

Given: the Hilbert spaces, points, index set and modulus in the Statement.

[F1]

Every nonempty closed convex Hilbert set has a unique nearest point under Countable Choice, and if p is nearest to zero, then ⟨p,z−p⟩≥0 for every point z of the set. (Projection onto a nonempty closed convex set, Variational characterisation of the nearest point)

[A1]

The Axiom of Choice implies Countable Choice and supplies the countable near-supremum selections used below. (The Axiom of Choice)

Proof

Given: the data in the Statement.

1.1givenconstructalgebra

For a nonnegative function δ with δ(0)=0, consider the finite weighted inequality ∑i,jaiaj[δ(∥vi∥)2+δ(∥vj∥)2−δ(∥vi−vj∥)2]≥0 for Hilbert vectors vi and nonnegative scalars ai. The function δ(t)=t satisfies it, since the sum is 2∥∑iaivi∥2. Each truncated function δA(t)=min⁡{t,A}, A>0, also satisfies it. Indeed, for the subsum with BOTH ∥vi∥,∥vj∥<A, replacing the negative truncated-distance square by the negative full-distance square can only decrease the sum, and this subsum is then 2∥∑∥vi∥<Aaivi∥2≥0. Every remaining summand is separately nonnegative, because at least one of its two positive squares is A2 while its negative square is at most A2. The property is closed under pointwise limits, and under taking δ=(∑k=1Nckδk2)1/2 with ck≥0, since the weighted expression is linear in δ2.

2.1step 1.1givenconstructalgebra

The function η(t)=ω(t)2 is nondecreasing, continuous, zero at zero and concave. Here is a proof that covers nonsmooth moduli. For integers n≥1, interpolate ω on grids 0,1/n,2/n,…,n and extend constantly after n; these concave nondecreasing polygonal functions converge pointwise to ω. On each affine piece ωn(r)=a+br, its slope b is nonnegative and its intercept a is nonnegative because concavity and ωn(0)=0 imply ωn(r)≥rωn′(r). Thus ωn(t)2=a2+2abt+b2t is concave on that piece. At a junction its one-sided derivatives are ωn(r)b/r, so the slope drops when b drops. Continuity at zero then proves global concavity for ηn, and passing to the pointwise limit proves it for η. Interpolate η on the same type of grids and flatten the final slope to zero. Every such polygonal ηn is a finite sum ∑kckmin⁡{t,tk} with ck≥0: take ck to be the decrease of slope at the breakpoint tk. Hence ηn(t2)=(∑kckmin⁡{t,tk}2)1/2 has step 1.1's property. Passing to the limit gives that property for ω(t)=η(t2).

3.1A1F1step 2.1givenchoosealgebra

First suppose the index set is finite and nonempty. If ω is identically zero, the pairwise hypothesis makes all the yi equal and their common value works. Otherwise ω(t)>0 for every t>0: if ω(t∗)=0 with t∗>0, monotonicity makes it zero on [0,t∗], and concavity bounds every subsequent slope by zero, forcing it to be identically zero. If some xi=x, then y=yi works directly by the pairwise hypothesis. In the remaining case all ri=∥xi−x∥ and bi=ω(ri) are positive. In the finite-dimensional affine span of the yi, minimize h(y)=max⁡i∥y−yi∥2/bi2. A minimum exists because this continuous function tends to infinity with ∥y∥ in that span; its perpendicular projection from H2 never increases any distance. Let y be a minimizer and let J be its active set. The origin belongs to the convex hull of (y−yi)/bi2, i∈J: otherwise that finite convex hull has a nonzero nearest point z, whose variational inequality gives ⟨z,(y−yi)/bi2⟩≥∥z∥2>0 for every active i. Moving a sufficiently small distance in direction −z strictly decreases all active functions and keeps the finitely many inactive ones below the old maximum, a contradiction.

4.1step 2.1step 3.1givenalgebra

Choose nonnegative coefficients βi, summing to one over J, with ∑i∈Jβi(y−yi)/bi2=0, and normalize ai=(βi/bi2)/(∑j∈Jβj/bj2). Then ∑ai=1 and y=∑aiyi. Write h(y)=λ2; every active index has ∥y−yi∥2=λ2bi2. The Hilbert variance identity gives ∑i,j∈Jaiaj∥yi−yj∥2=2∑i∈Jai∥yi−y∥2=2λ2∑iaibi2. Apply the pairwise hypothesis and step 2.1's weighted inequality to vi=xi−x. They bound that same sum above by ∑i,jaiajω(∥vi−vj∥)2≤2∑iaiω(∥vi∥)2=2∑iaibi2. The latter scalar is positive, so λ≤1. The minimizer therefore belongs to EVERY target ball, proving finite intersection.

5.1A1F1step 4.1givenchoosealgebra

Now let I be arbitrary and nonempty, and fix i0∈I. For every finite J⊂I containing i0, the set CJ=⋂i∈JB‾(yi,bi) is nonempty by step 4.1, closed and convex. Let pJ be its nearest point to zero by [F1]. Since CJ lies in the fixed ball with center yi0 and radius bi0, the numbers ∥pJ∥2 have a finite supremum D. By [A1], for each integer n≥1, choose finite Jn with ∥pJn∥2>D−1/n and replace them by their cumulative unions, preserving this inequality. They are increasing. For m≥n, [F1] gives ∥pJm−pJn∥2≤∥pJm∥2−∥pJn∥2≤D−∥pJn∥2, so they form a Cauchy sequence and converge to a point p∈H2.

6.1F1step 5.1algebra∎

For any fixed i∈I, let qn=pJn∪{i}. Again [F1] gives ∥qn−pJn∥2≤∥qn∥2−∥pJn∥2≤D−∥pJn∥2→0. Hence qn→p; since every qn lies in the closed ball B‾(yi,bi), so does p. This works for each i without enumerating I, and proves the required full intersection. If I is empty, zero belongs to its intersection by convention. This proves all cases.

Depends on

Used by

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