Documentation

LeanPool.MetricCodes.Rigidity

All-rank harmonic rigidity #

Completion of the root complex and rigidity of harmonic highest-weight vectors.

theorem MetricCodes.Spherical.HigherHarmonicYoung.UniversalBGGRootComplex.fullRootExteriorBracketAtom_single_apply {r n k : } (S : RootWedge r (k + 1)) (T : RootWedge r k) (α β γ : PositiveRoot r) (p : PolynomialSpace r n) :
(fullRootExteriorBracketAtom r n α β γ) (Pi.single (↑S) p) T = if α S β (↑S).erase α γ((↑S).erase α).erase β T = insert γ (((↑S).erase α).erase β) then (realExteriorRootSign (↑S) α * realExteriorRootSign ((↑S).erase α) β * realExteriorRootSign (↑T) γ) p else 0
theorem MetricCodes.Spherical.HigherHarmonicYoung.UniversalBGGRootComplex.two_smul_sum_mul_sum_eq_sum_anticommutator {ι : Type u_1} {V : Type u_2} [Fintype ι] [AddCommGroup V] [Module V] (A : ιModule.End V) :
2 ((∑ i : ι, A i) * i : ι, A i) = i : ι, j : ι, (A i * A j + A j * A i)
theorem MetricCodes.Spherical.HigherHarmonicYoung.UniversalBGGRootComplex.rootJointHarmonicActionUpperRootStructureCross_apply_coe {r n k : } (lam : Fin (r + 1)) (f : RootJointHarmonicChain n lam k) (S : AdmissibleRootWedge lam k) :
((rootJointHarmonicActionUpperRootStructureCross n lam k) f S) = α : PositiveRoot r, if hα : α S then β : PositiveRoot r, if hβ : β S then 0 else if hadm : ∀ (i : Fin (r + 1)), 0 signedRootWeight lam (insert β ((↑S).erase α)) i then γ : PositiveRoot r, if _hγ : rootStructureConstant β γ α = 0 then 0 else (rootSwapExteriorHodgeSign S α β * rootStructureConstant β γ α) (polarization r n (positiveRootFirst γ) (positiveRootSecond γ)) (f (rootAdmissibleSwap lam S α β hadm)) else 0 else 0
theorem MetricCodes.Spherical.HigherHarmonicYoung.UniversalBGGRootComplex.sum_root_pairs_eq_ordered_add_reverse {r : } {V : Type u_1} [AddCommGroup V] (F : PositiveRoot rPositiveRoot rV) (hzero : ∀ (α β : PositiveRoot r), ¬α < β¬β < αF α β = 0) :
α : PositiveRoot r, β : PositiveRoot r, F α β = α : PositiveRoot r, β : PositiveRoot r, if α < β then F α β + F β α else 0
theorem MetricCodes.Spherical.HigherHarmonicYoung.fischerCore_injective_of_coercive_add_adjoint_squares {E : Type u_1} {F : Type u_2} {G : Type u_3} [AddCommGroup E] [Module E] [AddCommGroup F] [Module F] [AddCommGroup G] [Module G] (cE : InnerProductSpace.Core E) (cF : InnerProductSpace.Core F) (cG : InnerProductSpace.Core G) (L : F →ₗ[] F) (B : F →ₗ[] E) (Bstar : E →ₗ[] F) (C : G →ₗ[] F) (Cstar : F →ₗ[] G) (hBstar : ∀ (x : E) (y : F), inner (Bstar x) y = inner x (B y)) (hCstar : ∀ (x : F) (y : G), inner (Cstar x) y = inner x (C y)) (hL : ∀ (x : F), x 00 < inner x (L x)) :
Function.Injective ⇑(L + Bstar ∘ₗ B + C ∘ₗ Cstar)
theorem MetricCodes.Spherical.HigherHarmonicYoung.UniversalBGGRootComplex.bgg_chain_range_eq_ker_of_coercive_add_adjoint_squares {r n k : } (lam : Fin (r + 1)) (d : RootJointHarmonicChain n lam (k + 1) →ₗ[] RootJointHarmonicChain n lam k) (dStar : RootJointHarmonicChain n lam k →ₗ[] RootJointHarmonicChain n lam (k + 1)) (e : RootJointHarmonicChain n lam (k + 1 + 1) →ₗ[] RootJointHarmonicChain n lam (k + 1)) (eStar : RootJointHarmonicChain n lam (k + 1) →ₗ[] RootJointHarmonicChain n lam (k + 1 + 1)) (L : RootJointHarmonicChain n lam (k + 1) →ₗ[] RootJointHarmonicChain n lam (k + 1)) (B : RootJointHarmonicChain n lam (k + 1) →ₗ[] RootJointHarmonicChain n lam k) (Bstar : RootJointHarmonicChain n lam k →ₗ[] RootJointHarmonicChain n lam (k + 1)) (C : RootJointHarmonicChain n lam (k + 1 + 1) →ₗ[] RootJointHarmonicChain n lam (k + 1)) (Cstar : RootJointHarmonicChain n lam (k + 1) →ₗ[] RootJointHarmonicChain n lam (k + 1 + 1)) (hdStar : ∀ (x : RootJointHarmonicChain n lam k) (y : RootJointHarmonicChain n lam (k + 1)), inner (dStar x) y = inner x (d y)) (heStar : ∀ (x : RootJointHarmonicChain n lam (k + 1)) (y : RootJointHarmonicChain n lam (k + 1 + 1)), inner (eStar x) y = inner x (e y)) (hBstar : ∀ (x : RootJointHarmonicChain n lam k) (y : RootJointHarmonicChain n lam (k + 1)), inner (Bstar x) y = inner x (B y)) (hCstar : ∀ (x : RootJointHarmonicChain n lam (k + 1)) (y : RootJointHarmonicChain n lam (k + 1 + 1)), inner (Cstar x) y = inner x (C y)) (hchain : d ∘ₗ e = 0) (hdecomposition : dStar ∘ₗ d + e ∘ₗ eStar = L + Bstar ∘ₗ B + C ∘ₗ Cstar) (hL : ∀ (x : RootJointHarmonicChain n lam (k + 1)), x 00 < inner x (L x)) :
e.range = d.ker
theorem MetricCodes.Spherical.HigherYoungArbitraryRankTriangularMarginDominance.sourceMargins_eq_of_upper_and_lower {m : } (lam nu : Fin m) (dUpper dLower : Fin m × Fin m →₀ ) (hupper : ∀ (i j : Fin m), j < idUpper (i, j) = 0) (hlower : ∀ (i j : Fin m), i < jdLower (i, j) = 0) (hupperRow : ∀ (i : Fin m), HigherHarmonicYoung.BideterminantHighestLine.sourceRowDegree dUpper i = lam i) (hupperColumn : ∀ (i : Fin m), HigherHarmonicYoung.BideterminantHighestLine.sourceColumnDegree dUpper i = nu i) (hlowerRow : ∀ (i : Fin m), HigherHarmonicYoung.BideterminantHighestLine.sourceRowDegree dLower i = lam i) (hlowerColumn : ∀ (i : Fin m), HigherHarmonicYoung.BideterminantHighestLine.sourceColumnDegree dLower i = nu i) :
lam = nu
theorem MetricCodes.Spherical.HigherHarmonicYoung.ArbitraryRankIsotropicSupportCartanWeight.source_rowWeight_eq_columnWeight_of_biHighest {m : } (lam nu : Fin m) (p : BideterminantHighestLine.SourceMatrix m) (hp : p 0) (hrow : ∀ (i : Fin m), (BideterminantHighestLine.sourceRowRoot i i) p = (lam i) p) (hcolumn : ∀ (i : Fin m), (BideterminantHighestLine.sourceColumnRoot i i) p = (nu i) p) (hrowHighest : ∀ (i j : Fin m), i < j(BideterminantHighestLine.sourceRowRoot i j) p = 0) (hcolumnHighest : ∀ (i j : Fin m), i < j(BideterminantHighestLine.sourceColumnRoot i j) p = 0) :
lam = nu
theorem MetricCodes.Spherical.HigherYoungAllRankHarmonicRootEnergyTraceRowCancellation.shortRoot_mixedRemainder_eq_neg_rowDerivation_add_isotropic_traces {r n : } (h : 2 * (r + 1) n) (lam : Fin (r + 1)) {f : MvPolynomial (Fin ((r + 1) * n)) } (hf : f HigherYoungTwoRowLieIrreducibility.fullYoungComplexPolynomialSpan lam) (b p : Fin (r + 1)) :
tMetricCodes.Spherical.HigherYoungAllRankHarmonicHighestRootEnergyIdentity.unusedAmbientCoordinates✝, a : Fin (r + 1), (HigherHarmonicYoung.DeterminantVectors.isotropicVariable h a p * (MvPolynomial.pderiv (HigherHarmonicYoung.variableIndex b t)) ((MvPolynomial.pderiv (HigherHarmonicYoung.variableIndex a t)) f) - MvPolynomial.X (HigherHarmonicYoung.variableIndex a t) * (MvPolynomial.pderiv (HigherHarmonicYoung.variableIndex b t)) ((HigherHarmonicYoung.DeterminantVectors.antiholomorphicDerivative h a p) f)) = -a : Fin (r + 1), (HigherHarmonicYoung.DeterminantVectors.rowDerivation a b) ((HigherHarmonicYoung.DeterminantVectors.antiholomorphicDerivative h a p) f) + 2⁻¹ q : Fin (r + 1), a : Fin (r + 1), (HigherHarmonicYoung.DeterminantVectors.isotropicVariable h a q * (MetricCodes.Spherical.HigherYoungIsotropicComplexTraceDecomposition.holomorphicDerivative✝ h b q) ((HigherHarmonicYoung.DeterminantVectors.antiholomorphicDerivative h a p) f) + HigherHarmonicYoung.DeterminantVectors.conjugateIsotropicVariable h a q * (HigherHarmonicYoung.DeterminantVectors.antiholomorphicDerivative h b q) ((HigherHarmonicYoung.DeterminantVectors.antiholomorphicDerivative h a p) f) - HigherHarmonicYoung.DeterminantVectors.isotropicVariable h a p * (MetricCodes.Spherical.HigherYoungIsotropicComplexTraceDecomposition.holomorphicDerivative✝ h b q) ((HigherHarmonicYoung.DeterminantVectors.antiholomorphicDerivative h a q) f) - HigherHarmonicYoung.DeterminantVectors.isotropicVariable h a p * (HigherHarmonicYoung.DeterminantVectors.antiholomorphicDerivative h b q) ((MetricCodes.Spherical.HigherYoungIsotropicComplexTraceDecomposition.holomorphicDerivative✝ h a q) f))
theorem MetricCodes.Spherical.HigherYoungAllRankHarmonicHighestTriangularScalarBookkeeping.sum_rowHighest_scalar {r : } (lam : Fin (r + 1)) (b : Fin (r + 1)) :
(∑ a : Fin (r + 1), if a < b then -1 else if a = b then (lam b) - 1 else 0) = (lam b) - 1 - b
theorem MetricCodes.Spherical.HigherYoungAllRankHarmonicHighestTriangularScalarBookkeeping.sum_differenceHighest_scalar {r : } (mu : Fin (r + 1)) (p : Fin (r + 1)) :
(∑ q : Fin (r + 1), if q < p then 0 else if q = p then ↑(2 * mu p) + 2 else 2) = ↑(2 * mu p) + 2 + 2 * ↑(r - p)
theorem MetricCodes.Spherical.HigherYoungFiniteDescendingAscendingInduction.fin_descending_ascending_induction {m : } {P : Fin mFin mProp} (hstep : ∀ (b p : Fin m), (∀ (a : Fin m), b < a∀ (q : Fin m), P a q)(∀ q < p, P b q)P b p) (b p : Fin m) :
P b p
theorem MetricCodes.Spherical.HigherYoungArbitraryRankSignedDiagonalDerivation.signedWeight_apply {ι : Type u_1} [Fintype ι] {m : } (w : ιFin m) (d : ι →₀ ) (p : Fin m) :
(Finsupp.weight w) d p = i : ι, (d i) * w i p

The ambient signed weight support used in the spherical-code argument.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem MetricCodes.Spherical.HigherYoungFiniteJointWeightProjectorInvariant.jointEigenComponent_mem_of_invariant_sum {K : Type u_1} {V : Type u_2} {α : Type u_3} {ι : Type u_4} [Field K] [AddCommGroup V] [Module K V] (T : ιV →ₗ[K] V) (W : Submodule K V) (hW : ∀ (i : ι), xW, (T i) x W) (S : Finset α) (v : αV) (eigen : αιK) (heigen : aS, ∀ (i : ι), (T i) (v a) = eigen a i v a) (hseparated : aS, bS, a b∃ (i : ι), eigen a i eigen b i) (hsum : aS, v a W) (a : α) (ha : a S) :
    v a W

    The ambient signed weight support used in the spherical-code argument.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For