Bourbaki

Theorem 2

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

Algebra, chapter I, § 5. Groups operating on a set

Let E be a finite set. There exists one and only one homomorphism ε\varepsilon from Sn\mathfrak{S}_n to the multiplicative group {−1,+1}\{-1, +1\} such that ε(τ)=−1\varepsilon(\tau) = -1 for every transposition τ\tau.

The uniqueness follows from Proposition 8. We show the existence. By transporting the structure, it may be assumed that E={1,n}E = \{1, n\}. Using the above notation, let ε(σ)=(−1)ν(σ)\varepsilon(\sigma) = (-1)^{\nu(\sigma)}. Then (Lemma 2)

σ(σ′p)=σ(ε(σ′)p)=ε(σ′)(σp)=ε(σ′)ε(σ)p. \sigma(\sigma' p) = \sigma(\varepsilon(\sigma') p) = \varepsilon(\sigma') (\sigma p) = \varepsilon(\sigma') \varepsilon(\sigma) p.

On the other hand,

σ(σ′p)=(σσ′)p=ε(σσ′)p. \sigma(\sigma' p) = (\sigma \sigma') p = \varepsilon(\sigma \sigma') p.

As p≠−pp \neq -p, it follows that ε(σσ′)=ε(σ)ε(σ′)\varepsilon(\sigma \sigma') = \varepsilon(\sigma) \varepsilon(\sigma') and thus ε\varepsilon is a homomorphism. We now show that, for every transposition τ\tau, ε(τ)=−1\varepsilon(\tau) = -1. ν(τn−1,n)=1\nu(\tau_{n-1, n}) = 1, whence ε(τn−1,n)=−1\varepsilon(\tau_{n-1, n}) = -1. As every transposition τ\tau is conjugate to τn−1,n\tau_{n-1, n} and the group {−1,+1}\{-1, +1\} is commutative, ε(τ)=ε(τn−1,n)=−1\varepsilon(\tau) = \varepsilon(\tau_{n-1, n}) = -1.

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

Cited by

Cites

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