Bourbaki

Exercise 5, § 10

Algebra, II, 418

Bourbaki marks this one as harder than the rest.

Let A\mathbf{A} be a ring, L,M,N\mathbf{L}, \mathbf{M}, \mathbf{N} any three indexing sets U=(aλμ)U = (a_{\lambda \mu}) a matrix of AL×M\mathbf{A}^{\mathbf{L} \times \mathbf{M}} and V=(bμν)V = (b_{\mu \nu}) a matrix of AM×N\mathbf{A}^{\mathbf{M} \times \mathbf{N}}; if, for every ordered pair (λ,ν)∈L×N(\lambda, \nu) \in \mathbf{L} \times \mathbf{N}, the family (aλμbμν)(a_{\lambda \mu} b_{\mu \nu}) (μ∈M\mu \in \mathbf{M}) has finite support, the element cλν=∑μaλμbμνc_{\lambda \nu} = \sum_{\mu} a_{\lambda \mu} b_{\mu \nu} is defined and it is also said that the matrix (cλν)(c_{\lambda \nu}) is the product UVUV of UU by VV. When the products UV′UV' and UV′′UV'' are defined, so is U(V′+V′′)U(V' + V'') and UV′+UV′′=U(V′+V′′)UV' + UV'' = U(V' + V''); is the converse true? Give an example of three infinite matrices, U,V,WU, V, W such that the products UV,VW,U(VW)UV, VW, U(VW) and (UV)W(UV)W are defined but U(VW)≠(UV)WU(VW) \neq (UV)W (take UU to be a matrix with one row all of whose elements are equal to 1, WW its transpose and VV a matrix all of whose elements are 0, 1 or −1-1 and which has only a finite number of elements ≠0\neq 0 in each row and each column. Determine by induction the elements of VV such that UV=0UV = 0 but VWVW has a single element ≠0\neq 0.)

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.