TheoremBase

The Set of Lengths ‖Ax‖ over the Unit Ball Has a Supremum, and the Supremum Map Exists

For a real m x n matrix A, the lengths of Ax over the closed unit ball of RnR^n form a nonempty set of reals bounded by the square root of the sum of the squared entries, so it has a supremum, and A maps to that supremum by a map on all m x n matrices.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let m,n∈Nm,n\in\mathbb{N} and let A∈Mm×n(R)A\in\mathcal{M}_{m\times n}(\mathbb{R}) be a real m×nm\times n matrix, with the matrix-vector product AxAx of AA and a point xx of Rn\mathbb{R}^{n}, the Euclidean norm ∥⋅∥\lVert\cdot\rVert on Rn\mathbb{R}^{n} and on Rm\mathbb{R}^{m}, and bounded above subsets and suprema of subsets of R\mathbb{R} for its order ≤\le. Let Un={x∈Rn:∥x∥≤1}U_{n}=\{x\in\mathbb{R}^{n}:\lVert x\rVert\le1\} be the closed unit ball of Rn\mathbb{R}^{n}. For every B∈Mm×n(R)B\in\mathcal{M}_{m\times n}(\mathbb{R}), let

NB={∥Bx∥:x∈Un}N_{B}=\{\lVert Bx\rVert:x\in U_{n}\}

be the image of UnU_{n} under x↦∥Bx∥x\mapsto\lVert Bx\rVert, that is, the set of the values ∥Bx∥\lVert Bx\rVert at the points x∈Unx\in U_{n} (Images of Typed Terms: the Set of Values {t:u∈D}\{t:u\in D\} Is a Set, Finite when DD Is Finite, and a Typed Term §members). In particular NA={∥Ax∥:x∈Un}N_{A}=\{\lVert Ax\rVert:x\in U_{n}\}.

For every set ss: s∈NAs\in N_{A} if and only if s=∥Ax∥s=\lVert Ax\rVert for some x∈Rnx\in\mathbb{R}^{n} with ∥x∥≤1\lVert x\rVert\le1. For every set xx: x∈Unx\in U_{n} if and only if x∈Rnx\in\mathbb{R}^{n} and ∥x∥≤1\lVert x\rVert\le1.

NAN_{A} is a nonempty subset of R\mathbb{R}, and NAN_{A} is bounded above.

NAN_{A} has a supremum in R\mathbb{R}.

There is exactly one map ν:Mm×n(R)→R\nu:\mathcal{M}_{m\times n}(\mathbb{R})\to\mathbb{R} with ν(B)=sup⁡NB\nu(B)=\sup N_{B} for every B∈Mm×n(R)B\in\mathcal{M}_{m\times n}(\mathbb{R}).

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…