TheoremBase

The two maps come from the existence of maps given by expressions, the absolute value through its predicative formula and the square as a value of the multiplication; the entrywise matrices are composites of A with these maps, and are unique because matrices with equal entries are equal.

Proof

Each result cited is universally quantified over the data in its own statement.

By The Real Numbers Form an Ordered Field in Which Every Nonempty Set Bounded Above Has a Supremum §ordered-field, R\mathbb{R}, with ++, ⋅\cdot, 00, 11 and ≤\le, is an ordered field, so the results on ordered fields cited below apply to it; and R\mathbb{R} is a set by The Real Numbers §reals.

Clause absolute-value. Apply Maps and Relations Given by Formulas §map with R\mathbb{R} for its aa and bb and the expression ∣u∣|u|, which lies in R\mathbb{R} for u∈Ru\in\mathbb{R}. The symbol ∣u∣|u| is used properly at every u∈Ru\in\mathbb{R}: there ∣u∣|u| is uniquely determined by Absolute Value in an Ordered Field §absolute-value, and the condition u∈R∧z=∣u∣u\in\mathbb{R}\wedge z=|u| is equivalent to a predicative formula by Predicative Substitution of Values of Functions and Binary Operations, and Predicative Formulas for Negatives, Differences, Absolute Values, Distances, Reciprocals and Quotients in an Ordered Field §absolute-value-formula, with uu and zz for its xx and zz and with R\mathbb{R}, ++, ⋅\cdot, 00, 11 and ≤\le as the values of its t1,…,t6t_{1},\dots,t_{6}; so ∣u∣|u| is a defined set symbol with argument uu, used properly where u∈Ru\in\mathbb{R}. The lemma gives exactly one map a:R→Ra:\mathbb{R}\to\mathbb{R} with a(u)=∣u∣a(u)=|u| for every u∈Ru\in\mathbb{R}.

Clause square. The multiplication ⋅\cdot is a binary operation on R\mathbb{R}, so for u∈Ru\in\mathbb{R} the product u⋅uu\cdot u is the value of ⋅\cdot at (u,u)(u,u), a defined set symbol, and lies in R\mathbb{R}, by Binary Operations on a Set §notation; it is the unique set zz with ((u,u),z)∈⋅((u,u),z)\in{\cdot}, a predicative formula by Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity §operation-membership, and it is used properly where u∈Ru\in\mathbb{R}. Apply Maps and Relations Given by Formulas §map with R\mathbb{R} for its aa and bb and the expression u⋅uu\cdot u: there is exactly one map q:R→Rq:\mathbb{R}\to\mathbb{R} with q(u)=u⋅u=u2q(u)=u\cdot u=u^{2} for every u∈Ru\in\mathbb{R}.

Clause entrywise. By Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations §matrices, AA is a map A:[m]×[n]→RA:[m]\times[n]\to\mathbb{R}, and Mm×n(R)\mathcal{M}_{m\times n}(\mathbb{R}) is the set of these maps, so a set lies in Mm×n(R)\mathcal{M}_{m\times n}(\mathbb{R}) if and only if it is a map [m]×[n]→R[m]\times[n]\to\mathbb{R}, by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set §members. By Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition, applied to AA and the map aa of the clause absolute-value, the composite a∘Aa\circ A is a map [m]×[n]→R[m]\times[n]\to\mathbb{R} with (a∘A)((i,j))=a(A((i,j)))(a\circ A)((i,j))=a(A((i,j))) for (i,j)∈[m]×[n](i,j)\in[m]\times[n]; so a∘A∈Mm×n(R)a\circ A\in\mathcal{M}_{m\times n}(\mathbb{R}), and by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations §entries, for i∈[m]i\in[m] and j∈[n]j\in[n], (a∘A)ij=a(Aij)=∣Aij∣(a\circ A)_{ij}=a(A_{ij})=|A_{ij}|, as Aij∈RA_{ij}\in\mathbb{R} by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol §graph. Likewise q∘A∈Mm×n(R)q\circ A\in\mathcal{M}_{m\times n}(\mathbb{R}) with (q∘A)ij=q(Aij)=Aij2(q\circ A)_{ij}=q(A_{ij})=A_{ij}^{2}. If N∈Mm×n(R)N\in\mathcal{M}_{m\times n}(\mathbb{R}) also has Nij=∣Aij∣N_{ij}=|A_{ij}| for all i∈[m]i\in[m] and j∈[n]j\in[n], then NN and a∘Aa\circ A have the same entries, so N=a∘AN=a\circ A by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations §equality; the same argument applies to q∘Aq\circ A. So a∘Aa\circ A and q∘Aq\circ A are the only matrices in Mm×n(R)\mathcal{M}_{m\times n}(\mathbb{R}) with the stated entries.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…