Math 2.0

example

Determinant as a group homomorphism

Example

Let nn be a positive integer and let GLn(R)\mathrm{GL}_n(\mathbb{R}) be the group of invertible n×nn \times n real matrices under multiplication. The determinant is a map det⁡ ⁣:GLn(R)→R×\det \colon \mathrm{GL}_n(\mathbb{R}) \to \mathbb{R}^\times to the group of nonzero real numbers under multiplication. It is a group homomorphism, because det⁡(AB)=det⁡(A)det⁡(B)\det(AB) = \det(A) \det(B) for all A,BA, B.

Remarks

The kernel of det⁡\det is the special linear group SLn(R)\mathrm{SL}_n(\mathbb{R}) of matrices of determinant 11, so this group is normal in GLn(R)\mathrm{GL}_n(\mathbb{R}). The determinant is surjective onto R×\mathbb{R}^\times, so GLn(R)/SLn(R)≅R×\mathrm{GL}_n(\mathbb{R}) / \mathrm{SL}_n(\mathbb{R}) \cong \mathbb{R}^\times. The same holds over each field FF, with GLn(F)\mathrm{GL}_n(F), SLn(F)\mathrm{SL}_n(F) and F×F^\times.

Explanations

L1 human

The determinant turns a product of matrices into a product of numbers. That is exactly what a homomorphism does. The matrices that it sends to 11 form an important subgroup, the special linear group.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Group homomorphism definition
  3. Kernel of a homomorphism definition
  4. Determinant as a group homomorphism example

Sources

  1. Web https://en.wikipedia.org/wiki/Determinant, Invertibility