Perfect pairings of modules #

A perfect pairing of two (left) modules may be defined either as:

A bilinear map M × N → R such that the induced maps M → Dual R N and N → Dual R M are both bijective. It follows from this that both M and N are reflexive modules.
A linear equivalence N ≃ Dual R M for which M is reflexive. (It then follows that N is reflexive.)

In this file we provide a PerfectPairing definition corresponding to 1 above, together with logic to connect 1 and 2.

Main definitions #

structure PerfectPairing (R : Type u_1) (M : Type u_2) (N : Type u_3) [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] extends M →ₗ[R] N →ₗ[R] R :

Type (max (max u_1 u_2) u_3)

A perfect pairing of two (left) modules over a commutative ring.

toFun : M → N →ₗ[R] R
map_add' (x y : M) : self.toFun (x + y) = self.toFun x + self.toFun y
map_smul' (m : R) (x : M) : self.toFun (m • x) = (RingHom.id R) m • self.toFun x
bijective_left : Function.Bijective ⇑self.toLinearMap
bijective_right : Function.Bijective ⇑self.flip

Instances For

source

@[deprecated PerfectPairing.toLinearMap (since := "2025-04-20")]

def PerfectPairing.toLin {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (self : PerfectPairing R M N) :

M →ₗ[R] N →ₗ[R] R

Alias of PerfectPairing.toLinearMap.

The underlying bilinear map of a perfect pairing.

Equations

Instances For

source

@[deprecated PerfectPairing.bijective_left (since := "2025-04-20")]

theorem PerfectPairing.bijectiveLeft {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (self : PerfectPairing R M N) :

Function.Bijective ⇑self.toLinearMap

Alias of PerfectPairing.bijective_left.

source

@[deprecated PerfectPairing.bijective_right (since := "2025-04-20")]

theorem PerfectPairing.bijectiveRight {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (self : PerfectPairing R M N) :

Function.Bijective ⇑self.flip

Alias of PerfectPairing.bijective_right.

source

def PerfectPairing.mkOfInjective {K : Type u_4} {V : Type u_5} {W : Type u_6} [Field K] [AddCommGroup V] [Module K V] [AddCommGroup W] [Module K W] [FiniteDimensional K V] (B : V →ₗ[K] W →ₗ[K] K) (h : Function.Injective ⇑B) (h' : Function.Injective ⇑B.flip) :

PerfectPairing K V W

If the coefficients are a field, and one of the spaces is finite-dimensional, it is sufficient to check only injectivity instead of bijectivity of the bilinear form.

Equations

Instances For

source

def PerfectPairing.mkOfInjective' {K : Type u_4} {V : Type u_5} {W : Type u_6} [Field K] [AddCommGroup V] [Module K V] [AddCommGroup W] [Module K W] [FiniteDimensional K W] (B : V →ₗ[K] W →ₗ[K] K) (h : Function.Injective ⇑B) (h' : Function.Injective ⇑B.flip) :

PerfectPairing K V W

If the coefficients are a field, and one of the spaces is finite-dimensional, it is sufficient to check only injectivity instead of bijectivity of the bilinear form.

Equations

Instances For

source

instance PerfectPairing.instFunLike {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] :

FunLike (PerfectPairing R M N) M (N →ₗ[R] R)

Equations

source

@[simp]

theorem PerfectPairing.toLinearMap_apply {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) (x : M) :

p.toLinearMap x = p x

source

@[deprecated PerfectPairing.toLinearMap_apply (since := "2025-04-20")]

theorem PerfectPairing.toLin_apply {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) (x : M) :

p.toLinearMap x = p x

Alias of PerfectPairing.toLinearMap_apply.

source

@[simp]

theorem PerfectPairing.mk_apply_apply {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {f : M →ₗ[R] N →ₗ[R] R} {hl : Function.Bijective ⇑f} {hr : Function.Bijective ⇑f.flip} {x : M} :

{ toLinearMap := f, bijective_left := hl, bijective_right := hr } x = f x

source

def PerfectPairing.flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) :

PerfectPairing R N M

Given a perfect pairing between M and N, we may interchange the roles of M and N.

Equations

Instances For

source

@[simp]

theorem PerfectPairing.flip_apply_apply {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) {x : M} {y : N} :

(p.flip y) x = (p x) y

source

@[simp]

theorem PerfectPairing.flip_flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) :

p.flip.flip = p

source

def PerfectPairing.toDualLeft {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) :

M ≃ₗ[R] Module.Dual R N

The linear equivalence from M to Dual R N induced by a perfect pairing.

Equations

Instances For

source

@[simp]

theorem PerfectPairing.toDualLeft_apply {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) (a : M) :

p.toDualLeft a = p a

source

@[simp]

theorem PerfectPairing.apply_toDualLeft_symm_apply {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) (f : Module.Dual R N) (x : N) :

(p (p.toDualLeft.symm f)) x = f x

source

def PerfectPairing.toDualRight {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) :

N ≃ₗ[R] Module.Dual R M

The linear equivalence from N to Dual R M induced by a perfect pairing.

Equations

Instances For

source

@[simp]

theorem PerfectPairing.toDualRight_apply {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) (a : N) :

p.toDualRight a = p.flip a

source

@[simp]

theorem PerfectPairing.apply_apply_toDualRight_symm {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) (x : M) (f : Module.Dual R M) :

(p x) (p.toDualRight.symm f) = f x

source

theorem PerfectPairing.toDualLeft_of_toDualRight_symm {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) (x : M) (f : Module.Dual R M) :

(p.toDualLeft x) (p.toDualRight.symm f) = f x

source

theorem PerfectPairing.toDualRight_symm_toDualLeft {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) (x : M) :

p.toDualRight.symm.dualMap (p.toDualLeft x) = (Module.Dual.eval R M) x

source

theorem PerfectPairing.toDualRight_symm_comp_toDualLeft {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) :

↑p.toDualRight.symm.dualMap ∘ₗ ↑p.toDualLeft = Module.Dual.eval R M

source

theorem PerfectPairing.bijective_toDualRight_symm_toDualLeft {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) :

Function.Bijective fun (x : M) => p.toDualRight.symm.dualMap (p.toDualLeft x)

source

theorem PerfectPairing.reflexive_left {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) :

Module.IsReflexive R M

source

theorem PerfectPairing.reflexive_right {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) :

Module.IsReflexive R N

source

instance PerfectPairing.instEquivLikeDual {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] :

EquivLike (PerfectPairing R M N) M (Module.Dual R N)

Equations

source

instance PerfectPairing.instLinearEquivClassDual {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] :

LinearEquivClass (PerfectPairing R M N) R M (Module.Dual R N)

source

theorem PerfectPairing.finrank_eq {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) [Module.Finite R M] [Module.Free R M] :

Module.finrank R M = Module.finrank R N

source

structure PerfectPairing.IsPerfectCompl {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) (U : Submodule R M) (V : Submodule R N) :

Prop

Given a perfect pairing p between M and N, we say a pair of submodules U in M and V in N are perfectly complementary wrt p if their dual annihilators are complementary, using p to identify M and N with dual spaces.

isCompl_left : IsCompl U (Submodule.map p.toDualLeft.symm V.dualAnnihilator)
isCompl_right : IsCompl V (Submodule.map p.toDualRight.symm U.dualAnnihilator)

Instances For

source

theorem PerfectPairing.IsPerfectCompl.flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {p : PerfectPairing R M N} {U : Submodule R M} {V : Submodule R N} (h : p.IsPerfectCompl U V) :

p.flip.IsPerfectCompl V U

source

@[simp]

theorem PerfectPairing.IsPerfectCompl.flip_iff {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {p : PerfectPairing R M N} {U : Submodule R M} {V : Submodule R N} :

p.flip.IsPerfectCompl V U ↔ p.IsPerfectCompl U V

source

@[simp]

theorem PerfectPairing.IsPerfectCompl.left_top_iff {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {p : PerfectPairing R M N} {V : Submodule R N} :

p.IsPerfectCompl ⊤ V ↔ V = ⊤

source

@[simp]

theorem PerfectPairing.IsPerfectCompl.right_top_iff {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {p : PerfectPairing R M N} {U : Submodule R M} :

p.IsPerfectCompl U ⊤ ↔ U = ⊤

source

def IsReflexive.toPerfectPairingDual {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] [Module.IsReflexive R M] :

PerfectPairing R (Module.Dual R M) M

A reflexive module has a perfect pairing with its dual.

Equations

Instances For

source

@[simp]

theorem IsReflexive.toPerfectPairingDual_toFun {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] [Module.IsReflexive R M] (a : Module.Dual R M) :

toPerfectPairingDual a = a

source

@[simp]

theorem IsReflexive.toPerfectPairingDual_apply {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] [Module.IsReflexive R M] {f : Module.Dual R M} {x : M} :

(toPerfectPairingDual f) x = f x

source

def LinearEquiv.flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) :

M ≃ₗ[R] Module.Dual R N

For a reflexive module M, an equivalence N ≃ₗ[R] Dual R M naturally yields an equivalence M ≃ₗ[R] Dual R N. Such equivalences are known as perfect pairings.

Equations

Instances For

source

@[simp]

theorem LinearEquiv.coe_toLinearMap_flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) :

↑e.flip = (↑e).flip

source

@[simp]

theorem LinearEquiv.flip_apply {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) (m : M) (n : N) :

(e.flip m) n = (e n) m

source

theorem LinearEquiv.symm_flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) :

e.flip.symm = e.symm.dualMap ≪≫ₗ (Module.evalEquiv R M).symm

source

theorem LinearEquiv.trans_dualMap_symm_flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) :

↑(e ≪≫ₗ e.flip.symm.dualMap) = Module.Dual.eval R N

source

theorem LinearEquiv.isReflexive_of_equiv_dual_of_isReflexive {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) :

Module.IsReflexive R N

If N is in perfect pairing with M, then it is reflexive.

source

@[simp]

theorem LinearEquiv.flip_flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) (h : Module.IsReflexive R N := ⋯) :

e.flip.flip = e

source

def LinearEquiv.toPerfectPairing {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) :

PerfectPairing R N M

If M is reflexive then a linear equivalence N ≃ Dual R M is a perfect pairing.

Equations

Instances For

source

def PerfectPairing.dual {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (p : PerfectPairing R M N) :

PerfectPairing R (Module.Dual R M) (Module.Dual R N)

A perfect pairing induces a perfect pairing between dual spaces.

Equations

Instances For

source

@[simp]

theorem Submodule.dualCoannihilator_map_linearEquiv_flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) (p : Submodule R M) :

(map e.flip p).dualCoannihilator = map e.symm p.dualAnnihilator

source

@[simp]

theorem Submodule.map_dualAnnihilator_linearEquiv_flip_symm {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) (p : Submodule R N) :

map e.flip.symm p.dualAnnihilator = (map e p).dualCoannihilator

source

@[simp]

theorem Submodule.map_dualCoannihilator_linearEquiv_flip {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) (p : Submodule R (Module.Dual R M)) :

map e.flip p.dualCoannihilator = (map e.symm p).dualAnnihilator

source

@[simp]

theorem Submodule.dualAnnihilator_map_linearEquiv_flip_symm {R : Type u_1} {M : Type u_2} {N : Type u_3} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] [Module.IsReflexive R M] (e : N ≃ₗ[R] Module.Dual R M) (p : Submodule R (Module.Dual R N)) :

(map e.flip.symm p).dualAnnihilator = map e p.dualCoannihilator

Documentation

Mathlib.LinearAlgebra.PerfectPairing.Basic

Perfect pairings of modules #

Main definitions #