Ring involutions #
This file defines a ring involution as a structure extending R ≃+* Rᵐᵒᵖ
,
with the additional fact f.involution : (f (f x).unop).unop = x
.
Notations #
We provide a coercion to a function R → Rᵐᵒᵖ
.
References #
Tags #
Ring involution
A ring involution
- left_inv : Function.LeftInverse self.invFun self.toFun
- right_inv : Function.RightInverse self.invFun self.toFun
The requirement that the ring homomorphism is its own inverse
Instances For
class
RingInvoClass
(F : Type u_3)
(R : Type u_4)
[Semiring R]
[EquivLike F R Rᵐᵒᵖ]
extends RingEquivClass F R Rᵐᵒᵖ :
RingInvoClass F R
states that F
is a type of ring involutions.
You should extend this class when you extend RingInvo
.
Every ring involution must be its own inverse
Instances
def
RingInvoClass.toRingInvo
{F : Type u_1}
{R : Type u_3}
[Semiring R]
[EquivLike F R Rᵐᵒᵖ]
[RingInvoClass F R]
(f : F)
:
RingInvo R
Turn an element of a type F
satisfying RingInvoClass F R
into an actual
RingInvo
. This is declared as the default coercion from F
to RingInvo R
.
Equations
Instances For
instance
RingInvo.instCoeTCOfRingInvoClass
{F : Type u_1}
{R : Type u_2}
[Semiring R]
[EquivLike F R Rᵐᵒᵖ]
[RingInvoClass F R]
:
Any type satisfying RingInvoClass
can be cast into RingInvo
via
RingInvoClass.toRingInvo
.
Equations
def
RingInvo.mk'
{R : Type u_2}
[Semiring R]
(f : R →+* Rᵐᵒᵖ)
(involution : ∀ (r : R), MulOpposite.unop (f (MulOpposite.unop (f r))) = r)
:
RingInvo R
Construct a ring involution from a ring homomorphism.
Equations
Instances For
@[simp]