Example

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

If $\sigma$ is a cycle of order $d$ , then

\varepsilon(\sigma) = (-1)^{d-1}.

The number of inversions of the permutation

(1, 2, 3, \ldots, d) \mapsto (d, 1, 2, \ldots, d-1)

is equal to

d-1

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

Cited by

Nothing.

Nothing.