Theorems · Definition · nonassociative algebras

RootPairing.posRootForm

{ι : Type u_1} →
  {R : Type u_2} →
    {M : Type u_3} →
      {N : Type u_4} →
        [inst : CommRing R] →
          [inst_1 : AddCommGroup M] →
            [inst_2 : Module R M] →
              [inst_3 : AddCommGroup N] →
                [inst_4 : Module R N] →
                  (P : RootPairing ι R M N) →
                    (S : Type u_5) →
                      [inst_5 : CommRing S] →
                        [inst_6 : LinearOrder S] →
                          [IsStrictOrderedRing S] →
                            [inst_8 : Algebra S R] →
                              [FaithfulSMul S R] →
                                [inst_10 : P.IsValuedIn S] → [Fintype ι] → RootPairing.RootPositiveForm S P

The bilinear form of a finite root pairing taking values in a linearly-ordered ring, as a root-positive form.

Defined in

Mathlib.LinearAlgebra.RootSystem.Finite.CanonicalBilinear

Cited by

23 results in Mathlib

Foundations

Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CommRingAddCommGroupModuleAddCommGroupModuleCommRingLinearOrderIsStrictOrderedRingAlgebraFaithfulSMulRootPairing.IsValuedInFintype