Fibre Suprema along a Coordinate Map and Their Semicontinuous Envelopes
lemmaAnalysislem:fibre-supremum-envelope-hilbert-2026aTaking suprema and infima over the fibres of a coordinate map turns a quadratically penalised difference on a subspace of a Hilbert space into one on Euclidean space whose semicontinuous envelopes still attain their maximum at the image of the original maximum point.
We work in the settings of Real Hilbert Spaces: Standing Notation and Background, Real Hilbert Spaces: Series, Products, Orthonormal Bases and Differential Calculus and Differential Calculus and Convexity on Euclidean Open Sets: Standing Notation, the last together with Real Matrices, Symmetric Matrices and the Semidefinite Ordering: Standing Notation on which it rests, used in the dimension for a natural number with .
Let be a real Hilbert space, with its inner product and norm as fixed there, let carry its Euclidean norm and Euclidean distance , and regard as the metric space . We write , and for the quotient of by .
Let be a linear subspace of , let be an -tuple in that is orthonormal and all of whose components lie in , and let be the coordinate map determined by .
Let and let be positive. Assume that the set of values of is bounded above and that the set of values of is bounded below. Let and assume that
Put and , and for put . Then the following hold.
1. (The fibre suprema)¶ For every the set is nonempty, the set has a least upper bound and the set has a greatest lower bound, unique by Existence of the Infimum of a Nonempty Subset of Bounded Below and Uniqueness of the Supremum and of the Infimum. The functions given by
are therefore defined; the set of values of is bounded above and that of is bounded below. Consequently is bounded above near each point of and is bounded below near each point of .
2. (Envelopes and the maximum)¶ Let be the upper semicontinuous envelope of and let be the lower semicontinuous envelope of , both taken in the metric space . Then is upper semicontinuous on , is lower semicontinuous on , and
3. (Values at the base point)¶ and .
4. (Approximation over a fibre neighbourhood)¶ Let and let be positive. Then there are and with
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.