Bourbaki

Proposition 2

Tag 05H6, permanent. Cite it as [Bourbaki, Tag 05H6].

Algebra, chapter I, § 8. Rings

Let AA be a ring, x1,…,xnx_1, \ldots, x_n elements of AA and I={1,2,…,n}I = \{1, 2, \ldots, n\}. For H⊂IH \subset I, we write xH=∑i∈Hxix_H = \sum_{i \in H} x_i. Then

(−1)n∑σ∈Snxσ(1)⋯xσ(n)=∑H⊂I(−1)Card H(xH)n. (-1)^n \sum_{\sigma \in S_n} x_{\sigma(1)} \cdots x_{\sigma(n)} = \sum_{H \subset I} (-1)^{\mathrm{Card}\, H}(x_H)^n.

*In particular, if AA is commutative,

(−1)nn!x1x2⋯xn=∑H⊂I(−1)Card H(xH)n. (-1)^n n! x_1 x_2 \cdots x_n = \sum_{H \subset I} (-1)^{\mathrm{Card}\, H}(x_H)^n.

Let CC be the set of mappings of II into {0,1}\{0, 1\}. If each H⊂IH \subset I is mapped to its characteristic function, a bijection is obtained of P(I)\mathscr{P}(I) onto CC. The right hand side of (16) is thus equal to:

∑a∈C(−1)a(1)+⋯+a(n)(∑i∈Ia(i)xi)n \sum_{a \in C} (-1)^{a(1)+\cdots+a(n)} \left( \sum_{i \in I} a(i) x_i \right)^n
=∑a∈C(−1)a(1)+⋯+a(n)∑(i1,…,in)∈Ina(i1)…a(in)xi1…xin = \sum_{a \in C} (-1)^{a(1)+\cdots+a(n)} \sum_{(i_1, \ldots, i_n) \in I^n} a(i_1) \ldots a(i_n) x_{i_1} \ldots x_{i_n}
=∑(i1,…,in)∈Inci1…inxi1…xin = \sum_{(i_1, \ldots, i_n) \in I^n} c_{i_1 \ldots i_n} x_{i_1} \ldots x_{i_n}

where

ci1…in=∑a∈C(−1)a(1)+⋯+a(n)a(i1)…a(in). c_{i_1 \ldots i_n} = \sum_{a \in C} (-1)^{a(1)+\cdots+a(n)} a(i_1) \ldots a(i_n).

(1) Suppose that (i1,…,in)(i_1, \ldots, i_n) is not a permutation of II. There exists a j∈Ij \in I distinct from i1,…,ini_1, \ldots, i_n. Let C′C' be the set of a∈Ca \in C such that a(j)=0a(j) = 0. For all a∈C′a \in C', let a∗a^* be the sum of aa and the characteristic function of {j}\{j\}. Then a∗(1)+⋯+a∗(n)=a(1)+⋯+a(n)+1a^*(1) + \cdots + a^*(n) = a(1) + \cdots + a(n) + 1 and hence

ci1…in=∑a∈C′(−1)a(1)+⋯+a(n)a(i1)…a(in)+(−1)a∗(1)+⋯+a∗(n)a∗(i1)…a∗(in) c_{i_1 \ldots i_n} = \sum_{a \in C'} (-1)^{a(1)+\cdots+a(n)} a(i_1) \ldots a(i_n) + (-1)^{a^*(1)+\cdots+a^*(n)} a^*(i_1) \ldots a^*(i_n)
=∑a∈C′((−1)a(1)+⋯+(n)+(−1)a(1)+⋯+a(n)+1)a(i1)…a(in)=0. = \sum_{a \in C'} ((-1)^{a(1)+\cdots+(n)} + (-1)^{a(1)+\cdots+a(n)+1}) a(i_1) \ldots a(i_n) = 0.

(2) Suppose that there exists σ∈Sn\sigma \in S_n such that i1=σ(1),…,in=σ(n)i_1 = \sigma(1), \ldots, i_n = \sigma(n). Then a(i1)…a(in)=0a(i_1) \ldots a(i_n) = 0 unless aa only takes the value 1. Thus ci1…in=(−1)nc_{i_1 \ldots i_n} = (-1)^n.

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, 1998, Springer. Not translated.