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 be real Hilbert spaces, let be any set, let , and let and . Let be continuous, nondecreasing and concave, with . If then The intersection over an empty index set means all of .
Statement references
Facts & Assumptions
Given: the Hilbert spaces, points, index set and modulus in the Statement.
Every nonempty closed convex Hilbert set has a unique nearest point under Countable Choice, and if is nearest to zero, then for every point of the set. (Projection onto a nonempty closed convex set, Variational characterisation of the nearest point)
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.
For a nonnegative function with , consider the finite weighted inequality for Hilbert vectors and nonnegative scalars . The function satisfies it, since the sum is . Each truncated function , , also satisfies it. Indeed, for the subsum with BOTH , replacing the negative truncated-distance square by the negative full-distance square can only decrease the sum, and this subsum is then . Every remaining summand is separately nonnegative, because at least one of its two positive squares is while its negative square is at most . The property is closed under pointwise limits, and under taking with , since the weighted expression is linear in .
The function is nondecreasing, continuous, zero at zero and concave. Here is a proof that covers nonsmooth moduli. For integers , interpolate on grids and extend constantly after ; these concave nondecreasing polygonal functions converge pointwise to . On each affine piece , its slope is nonnegative and its intercept is nonnegative because concavity and imply . Thus is concave on that piece. At a junction its one-sided derivatives are , so the slope drops when drops. Continuity at zero then proves global concavity for , 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 is a finite sum with : take to be the decrease of slope at the breakpoint . Hence has step 1.1's property. Passing to the limit gives that property for .
First suppose the index set is finite and nonempty. If is identically zero, the pairwise hypothesis makes all the equal and their common value works. Otherwise for every : if with , monotonicity makes it zero on , and concavity bounds every subsequent slope by zero, forcing it to be identically zero. If some , then works directly by the pairwise hypothesis. In the remaining case all and are positive. In the finite-dimensional affine span of the , minimize . A minimum exists because this continuous function tends to infinity with in that span; its perpendicular projection from never increases any distance. Let be a minimizer and let be its active set. The origin belongs to the convex hull of , : otherwise that finite convex hull has a nonzero nearest point , whose variational inequality gives for every active . Moving a sufficiently small distance in direction strictly decreases all active functions and keeps the finitely many inactive ones below the old maximum, a contradiction.
Choose nonnegative coefficients , summing to one over , with , and normalize . Then and . Write ; every active index has . The Hilbert variance identity gives . Apply the pairwise hypothesis and step 2.1's weighted inequality to . They bound that same sum above by . The latter scalar is positive, so . The minimizer therefore belongs to EVERY target ball, proving finite intersection.
Now let be arbitrary and nonempty, and fix . For every finite containing , the set is nonempty by step 4.1, closed and convex. Let be its nearest point to zero by [F1]. Since lies in the fixed ball with center and radius , the numbers have a finite supremum . By [A1], for each integer , choose finite with and replace them by their cumulative unions, preserving this inequality. They are increasing. For , [F1] gives , so they form a Cauchy sequence and converge to a point .
For any fixed , let . Again [F1] gives . Hence ; since every lies in the closed ball , so does . This works for each without enumerating , and proves the required full intersection. If 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
- Yoav Benyamini and Joram Lindenstrauss, Geometric Nonlinear Functional Analysis, Volume 1 (standard reference, not scraped)
- F. Grünbaum and E. H. Zarantonello, On the extension of uniformly continuous mappings (standard reference, not scraped)