Bourbaki

Lemma 1

Tag 06LA, permanent. Cite it as [Bourbaki, Tag 06LA].

Algebra, V, p. 49, § 8. Norms and traces

Let V be a vector space of finite dimension over K and B a bilinear form on V x V. Let (v1,…,vn)(v_1, \ldots, v_n) be a basis of V over K and Δ=det⁡B(vi,vj)\Delta = \det B(v_i, v_j). Then A≠0A \neq 0 if and only if, for each x≠0x \neq 0 in V there exists y in V such that B(x,y)≠0B(x, y) \neq 0.

We have A≠0A \neq 0 if and only if the system of linear equations

∑i=1nλiB(vi,vj)=0(1≤j≤n) \sum_{i=1}^n \lambda_i B(v_i, v_j) = 0 \quad (1 \leq j \leq n)

has only the solution A,=⋯=A,=0A, = \cdots = A, = 0 in K. If we put x=∑i=1nλivix = \sum_{i=1}^n \lambda_i v_i, the above system is equivalent to B(x,vj)=0B(x, v_j) = 0 for 1≤j≤n1 \leq j \leq n, or also, since (v1,…,vn)(v_1, \ldots, v_n) is a basis of V over K, to B(x,y)=0B(x, y) = 0 for all y∈Vy \in V, whence the lemma.

Let us show that condition c) implies that A is reduced. Let x be a nilpotent element of A : for any y∈Ay \in A the element xy is nilpotent, and so the endomorphism LxyL_{xy} of the vector space A is nilpotent. Now the following lemma implies that Tr(xy)=0\mathrm{Tr}(xy) = 0 for all y∈Ay \in A, whence x=0x = 0 under hypothesis c).

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Nothing.

Transcribed from the printed edition, 2003, Springer. Not translated.