Theorems · Definition · nonassociative algebras

RootPairing.IsBalanced.recOn

{ι : Type u_1} →
  {R : Type u_2} →
    {M : Type u_3} →
      {N : Type u_4} →
        [inst : AddCommGroup M] →
          [inst_1 : AddCommGroup N] →
            [inst_2 : CommRing R] →
              [inst_3 : Module R M] →
                [inst_4 : Module R N] →
                  {P : RootPairing ι R M N} →
                    {motive : P.IsBalanced → Sort u} →
                      (t : P.IsBalanced) →
                        ((isPerfectCompl : P.IsPerfectCompl (P.rootSpan R) (P.corootSpan R)) → motive ⋯) → motive t

Defined in

Mathlib.LinearAlgebra.RootSystem.BaseChange

Cited by

0 results in Mathlib

Foundations

Depth 36 from the axioms · uses propext, Quot.sound

Assumes

AddCommGroupAddCommGroupCommRingModuleModule