Bourbaki

Exercise 16, § 10

Algebra, II

a) Let UU be a square matrix of order n over the field Q\mathbf{Q}, whose all non-diagonal elements are equal to the same rational number r > 0, and whose diagonal (d1,…,dnd_1, \ldots, d_n) is such that di≥rd_i \geq r for every i and di>rd_i > r perhaps for one value of i. Now prove that U is invertible (if x=(xi)1≤i≤nx = (x_i)_{1 \leq i \leq n} is a solution of the equation U.x=0U.x = 0, show that the xix_i are all of the same sign and deduce that they are all zero). b) Let E be a finite set having m elements denoted by aia_i (1≤i≤m1 \leq i \leq m), (Aj)1≤j≤n(A_j)_{1 \leq j \leq n} a family of n parts of E, pairwise distinct; suppose that one has Card(Ai∩Aj)=r≥1(A_i \cap A_j) = r \geq 1 for every pair (i, j) of distinct elements of {1, n}. Now prove that one necessarily has n≤mn \leq m. (Let V=(cij)V = (c_{ij}) be the matrix of type (m, n) such that cij=1c_{ij} = 1 when ai∈Aj,cij=0a_i \in A_j, c_{ij} = 0 in the contrary case. Apply a) to the matrix tV.V^tV.V of order n.)

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-6. Not checked by a person.