LeanPool.BrauerGroupNew.IsoSecond #
Imported Lean Pool material for LeanPool.BrauerGroupNew.IsoSecond.
The balancing relations used to form the tensor-product quotient module.
Equations
Instances For
The balanced tensor-product module used in the multiplicativity proof.
Equations
- mapMulProof.M α β = (TensorProduct F (CrossProductAlgebra α) (CrossProductAlgebra β) ⧸ Submodule.span F (mapMulProof.S α β))
Instances For
Right multiplication by fixed tensor factors descends to the balanced quotient.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The auxiliary right action map as a linear map in the second tensor factor.
Equations
- mapMulProof.AoxFBSmulMAuxAux a = { toFun := fun (b : CrossProductAlgebra β) => mapMulProof.AoxFBSmulMAux a b, map_add' := ⋯, map_smul' := ⋯ }
Instances For
The right action of A ⊗[F] B on the balanced quotient module.
Equations
- mapMulProof.AoxFBSmulM = TensorProduct.lift { toFun := mapMulProof.AoxFBSmulMAuxAux, map_add' := ⋯, map_smul' := ⋯ }
Instances For
Equations
- One or more equations did not get rendered due to their size.
Equations
- mapMulProof.instMulActionMulOppositeTensorProductCrossProductAlgebraM = { toSMul := mapMulProof.instSMulMulOppositeTensorProductCrossProductAlgebraM, mul_smul := ⋯, one_smul := ⋯ }
Equations
- One or more equations did not get rendered due to their size.
Equations
- One or more equations did not get rendered due to their size.
The auxiliary left action of the product cross-product algebra on the balanced quotient.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The left action of the product cross-product algebra on the balanced quotient.
Equations
- mapMulProof.CSmul = { toFun := mapMulProof.CSmulAux, map_add' := ⋯, map_smul' := ⋯ }
Instances For
Equations
- mapMulProof.instSMulCrossProductAlgebraHMulForallProdAlgEquivUnitsM = { smul := fun (c : CrossProductAlgebra (α * β)) (x : mapMulProof.M α β) => (mapMulProof.CSmul c) x }
Equations
- mapMulProof.instMulActionCrossProductAlgebraHMulForallProdAlgEquivUnitsM = { toSMul := mapMulProof.instSMulCrossProductAlgebraHMulForallProdAlgEquivUnitsM, mul_smul := ⋯, one_smul := ⋯ }
Equations
- One or more equations did not get rendered due to their size.
Equations
- One or more equations did not get rendered due to their size.
Equations
- mapMulProof.instSMulWithZeroMulOppositeTensorProductCrossProductAlgebraM = { toSMulZeroClass := DistribMulAction.toDistribSMul.toSMulZeroClass, zero_smul := ⋯ }
The tensor-product action commutes with the cross-product action on M.
The representation of the opposite tensor product algebra by endomorphisms of M.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The map from the balanced quotient to the tensor product over K.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The additive map from the tensor product over K back to the balanced quotient.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The linear map from the tensor product over K back to the balanced quotient.
Equations
- mapMulProof.AoxKBToM = { toFun := (↑mapMulProof.AoxKBToMAux).toFun, map_add' := ⋯, map_smul' := ⋯ }
Instances For
The balanced quotient is linearly equivalent to the tensor product over K.
Equations
Instances For
A chosen simple module appearing in the Wedderburn decomposition of C.
Equations
- mapMulProof.SimpleMod α β = ⋯.choose
Instances For
Equations
Equations
The finite index set for the simple-module decomposition of C.
Equations
- mapMulProof.IndexingSet α β = ⋯.choose
Instances For
Equations
The decomposition of C as a finite direct sum of copies of the simple module.
Equations
Instances For
The direct-sum decomposition rewritten as functions on the finite index set.
Equations
Instances For
The direct-sum decomposition reindexed by Fin (Fintype.card ι).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Endomorphisms of a finite power are matrix algebras over endomorphisms of the summand.
Equations
- mapMulProof.isoDagger m = endVecAlgEquivMatrixEnd (Fin m) F (CrossProductAlgebra (α * β)) (mapMulProof.SimpleMod α β)
Instances For
The opposite algebra of C as endomorphisms of the regular C-module.
Equations
Instances For
Transport the regular-module endomorphism algebra across the simple-module decomposition.
Equations
Instances For
The matrix form of the opposite algebra of C.
Equations
Instances For
Move the matrix algebra description from the opposite algebra back to C.
Instances For
The final matrix-algebra model for the product cross-product algebra.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The finite index set for the simple-module decomposition of M.
Equations
- mapMulProof.IndexingSetM α β = ⋯.choose
Instances For
Equations
The decomposition of M as a finite direct sum of copies of the simple module.
Equations
Instances For
A linear equivalence from M to a finite power of the chosen simple module.
Equations
- mapMulProof.MIsoPow α β = ⋯.some
Instances For
The same finite-power equivalence over the base field.
Equations
Instances For
Conjugation by MIsoPow identifies endomorphism algebras over C.
Equations
Instances For
The endomorphism algebra of M as a matrix algebra over endomorphisms of SM.
Equations
- mapMulProof.endCMIso' α β = (mapMulProof.endCMIso α β).trans (mapMulProof.isoDagger (Module.finrank F K * Fintype.card (mapMulProof.IndexingSet α β)))
Instances For
The opposite tensor product algebra as endomorphisms of the balanced quotient.
Equations
Instances For
The tensor product algebra as the opposite of the endomorphism algebra of M.
Equations
Instances For
The tensor product algebra as an opposite matrix algebra over End_C(SM).
Equations
Instances For
The tensor product algebra as a matrix algebra over the opposite endomorphism algebra.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The additive form of the isomorphism between the relative Brauer group and second cohomology.