The Unitary Group

This file defines elements of the unitary group Matrix.unitaryGroup n α, where α is a StarRing. This consists of all n by n matrices with entries in α such that the star-transpose is its inverse. In addition, we define the group structure on Matrix.unitaryGroup n α, and the embedding into the general linear group LinearMap.GeneralLinearGroup α (n → α).

We also define the orthogonal group Matrix.orthogonalGroup n β, where β is a CommRing.

Main Definitions

• Matrix.unitaryGroup is the submonoid of matrices where the star-transpose is the inverse; the group structure (under multiplication) is inherited from a more general unitary construction.
• Matrix.UnitaryGroup.embeddingGL is the embedding Matrix.unitaryGroup n α → GLₙ(α), where GLₙ(α) is LinearMap.GeneralLinearGroup α (n → α).
• Matrix.orthogonalGroup is the submonoid of matrices where the transpose is the inverse.

References

• https://en.wikipedia.org/wiki/Unitary_group

Tags

matrix group, group, unitary group, orthogonal group

@[inline, reducible]

abbrev Matrix.unitaryGroup (n : Type u) [DecidableEq n] [Fintype n] (α : Type v) [CommRing α] [StarRing α] : Submonoid (Matrix n n α)

Matrix.unitaryGroup n is the group of n by n matrices where the star-transpose is the inverse.

Equations

• Matrix.unitaryGroup n α = unitary (Matrix n n α)

theorem Matrix.mem_unitaryGroup_iff {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] {A : Matrix n n α} : A ∈ Matrix.unitaryGroup n α ↔ A * star A = 1

theorem Matrix.mem_unitaryGroup_iff' {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] {A : Matrix n n α} : A ∈ Matrix.unitaryGroup n α ↔ star A * A = 1

theorem Matrix.det_of_mem_unitary {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] {A : Matrix n n α} (hA : A ∈ Matrix.unitaryGroup n α) : Matrix.det A ∈ unitary α

instance Matrix.UnitaryGroup.coeMatrix {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] : Coe (↥(Matrix.unitaryGroup n α)) (Matrix n n α)

Equations

• Matrix.UnitaryGroup.coeMatrix = { coe := Subtype.val }

instance Matrix.UnitaryGroup.coeFun {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] : CoeFun ↥(Matrix.unitaryGroup n α) fun (x : ↥(Matrix.unitaryGroup n α)) => n → n → α

Equations

• Matrix.UnitaryGroup.coeFun = { coe := fun (A : ↥(Matrix.unitaryGroup n α)) => ↑A }

def Matrix.UnitaryGroup.toLin' {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) : (n → α) →ₗ[α] n → α

Matrix.UnitaryGroup.toLin' A is matrix multiplication of vectors by A, as a linear map.

After the group structure on Matrix.unitaryGroup n is defined, we show in Matrix.UnitaryGroup.toLinearEquiv that this gives a linear equivalence.

Equations

• Matrix.UnitaryGroup.toLin' A = Matrix.toLin' ↑A

theorem Matrix.UnitaryGroup.ext_iff {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) (B : ↥(Matrix.unitaryGroup n α)) : A = B ↔ ∀ (i j : n), ↑A i j = ↑B i j

theorem Matrix.UnitaryGroup.ext {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) (B : ↥(Matrix.unitaryGroup n α)) : (∀ (i j : n), ↑A i j = ↑B i j) → A = B

theorem Matrix.UnitaryGroup.star_mul_self {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) : star ↑A * ↑A = 1

@[simp]

theorem Matrix.UnitaryGroup.inv_val {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) : ↑A⁻¹ = star ↑A

@[simp]

theorem Matrix.UnitaryGroup.inv_apply {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) : ↑A⁻¹ = star ↑A

@[simp]

theorem Matrix.UnitaryGroup.mul_val {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) (B : ↥(Matrix.unitaryGroup n α)) : ↑(A * B) = ↑A * ↑B

@[simp]

theorem Matrix.UnitaryGroup.mul_apply {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) (B : ↥(Matrix.unitaryGroup n α)) : ↑(A * B) = ↑A * ↑B

@[simp]

theorem Matrix.UnitaryGroup.one_val {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] : ↑1 = 1

@[simp]

theorem Matrix.UnitaryGroup.one_apply {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] : ↑1 = 1

@[simp]

theorem Matrix.UnitaryGroup.toLin'_mul {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) (B : ↥(Matrix.unitaryGroup n α)) : Matrix.UnitaryGroup.toLin' (A * B) = Matrix.UnitaryGroup.toLin' A ∘ₗ Matrix.UnitaryGroup.toLin' B

@[simp]

theorem Matrix.UnitaryGroup.toLin'_one {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] : Matrix.UnitaryGroup.toLin' 1 = LinearMap.id

def Matrix.UnitaryGroup.toLinearEquiv {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) : (n → α) ≃ₗ[α] n → α

Matrix.unitaryGroup.toLinearEquiv A is matrix multiplication of vectors by A, as a linear equivalence.

Equations

• Matrix.UnitaryGroup.toLinearEquiv A = let __src := Matrix.toLin' ↑A; { toLinearMap := __src, invFun := ⇑(Matrix.UnitaryGroup.toLin' A⁻¹), left_inv := ⋯, right_inv := ⋯ }

def Matrix.UnitaryGroup.toGL {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) : LinearMap.GeneralLinearGroup α (n → α)

Matrix.unitaryGroup.toGL is the map from the unitary group to the general linear group

Equations

• Matrix.UnitaryGroup.toGL A = LinearMap.GeneralLinearGroup.ofLinearEquiv (Matrix.UnitaryGroup.toLinearEquiv A)

theorem Matrix.UnitaryGroup.coe_toGL {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) : ↑(Matrix.UnitaryGroup.toGL A) = Matrix.UnitaryGroup.toLin' A

@[simp]

theorem Matrix.UnitaryGroup.toGL_one {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] : Matrix.UnitaryGroup.toGL 1 = 1

@[simp]

theorem Matrix.UnitaryGroup.toGL_mul {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (A : ↥(Matrix.unitaryGroup n α)) (B : ↥(Matrix.unitaryGroup n α)) : Matrix.UnitaryGroup.toGL (A * B) = Matrix.UnitaryGroup.toGL A * Matrix.UnitaryGroup.toGL B

def Matrix.UnitaryGroup.embeddingGL {n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] : ↥(Matrix.unitaryGroup n α) →* LinearMap.GeneralLinearGroup α (n → α)

Matrix.unitaryGroup.embeddingGL is the embedding from Matrix.unitaryGroup n α to LinearMap.GeneralLinearGroup n α.

Equations

• Matrix.UnitaryGroup.embeddingGL = { toOneHom := { toFun := fun (A : ↥(Matrix.unitaryGroup n α)) => Matrix.UnitaryGroup.toGL A, map_one' := ⋯ }, map_mul' := ⋯ }

@[inline, reducible]

abbrev Matrix.orthogonalGroup (n : Type u) [DecidableEq n] [Fintype n] (β : Type v) [CommRing β] : Submonoid (Matrix n n β)

Matrix.orthogonalGroup n is the group of n by n matrices where the transpose is the inverse.

Equations

• Matrix.orthogonalGroup n β = Matrix.unitaryGroup n β

theorem Matrix.mem_orthogonalGroup_iff (n : Type u) [DecidableEq n] [Fintype n] (β : Type v) [CommRing β] {A : Matrix n n β} : A ∈ Matrix.orthogonalGroup n β ↔ A * star A = 1

theorem Matrix.mem_orthogonalGroup_iff' (n : Type u) [DecidableEq n] [Fintype n] (β : Type v) [CommRing β] {A : Matrix n n β} : A ∈ Matrix.orthogonalGroup n β ↔ star A * A = 1