Documentation

Atlas.LieGroups.code.KostantTheorem

noncomputable def qInteger (d : ) :
Instances For
    noncomputable def groupRingExp {P' : Type u_3} (α : P') :
    Instances For
      noncomputable def groupRingOneMinusExp {P' : Type u_3} [AddCommGroup P'] (α : P') :
      Instances For
        noncomputable def numeratorProd {P' : Type u_3} [AddCommGroup P'] (S : Finset P') :
        Instances For
          def groupRingCT {P' : Type u_3} [AddCommGroup P'] (f : AddMonoidAlgebra P') :
          Instances For
            noncomputable def singleFactorCoeff {P' : Type u_3} [AddCommGroup P'] (α : P') (n : ) :
            Instances For
              noncomputable def singleFactorPS {P' : Type u_3} [AddCommGroup P'] (α : P') :
              Instances For
                noncomputable def fullProductPS {P' : Type u_3} [AddCommGroup P'] (S : Finset P') :
                Instances For
                  noncomputable def geomFactorCoeff {P' : Type u_3} [AddCommGroup P'] (α : P') (n : ) :
                  Instances For
                    noncomputable def geomFactorPS {P' : Type u_3} [AddCommGroup P'] (α : P') :
                    Instances For
                      noncomputable def geomProductPS {P' : Type u_3} [AddCommGroup P'] (S : Finset P') :
                      Instances For
                        noncomputable def powerSeriesCT {P' : Type u_3} [AddCommGroup P'] (f : PowerSeries (AddMonoidAlgebra P')) :
                        Instances For
                          noncomputable def concreteCT_fullRoots {P' : Type u_3} [AddCommGroup P'] (roots : Finset P') :
                          Instances For
                            noncomputable def concreteCT_posRoots {P' : Type u_3} [AddCommGroup P'] (roots posRoots : Finset P') :
                            Instances For
                              noncomputable def concreteCT_fullRoots_char {P' : Type u_3} [AddCommGroup P'] (roots : Finset P') (chi : AddMonoidAlgebra P') :
                              Instances For
                                noncomputable def concreteCT_posRoots_lambda {P' : Type u_3} [AddCommGroup P'] (roots posRoots : Finset P') (wt : P') :
                                Instances For
                                  noncomputable def qIntegerProd (r : ) (degrees : Fin r) :
                                  Instances For
                                    Instances For
                                      structure KostantSetupData {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] :
                                      Type (max (max (max u_1 u_2) (u_4 + 1)) (u_5 + 1))
                                      Instances For
                                        theorem KostantSetupData.weylCharacter_CT {R : Type u_4} [CommRing R] {𝔤 : Type u_5} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (wt : ksd.P) :
                                        theorem KostantSetupData.weylCharacterFormula {R : Type u_4} [CommRing R] {𝔤 : Type u_5} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (wt : ksd.P) :
                                        wt ksd.dominantWeightsnumeratorProd ksd.posRoots * ksd.weylCharacter wt = w : ksd.W, ksd.signRep w Finsupp.single (ksd.actionW w (wt + ksd.rho) - ksd.rho) 1
                                        theorem KostantSetupData.gradedHomDim_zero_spec {R : Type u_4} [CommRing R] {𝔤 : Type u_5} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (n : ) :
                                        ksd.gradedHomDim 0 n = if n = 0 then 1 else 0
                                        theorem KostantSetupData.equation12_spec {R : Type u_4} [CommRing R] {𝔤 : Type u_5} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (wt : ksd.P) :
                                        theorem KostantSetupData.gradedHomDim_zero {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (n : ) :
                                        ksd.gradedHomDim 0 n = if n = 0 then 1 else 0
                                        theorem KostantSetupData.equation12_hilbert_series {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (wt : ksd.P) :
                                        def KostantSetupData.isDominant {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (μ : ksd.P) :
                                        Instances For
                                          def KostantSetupData.dotAction {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (w : ksd.W) (μ : ksd.P) :
                                          ksd.P
                                          Instances For
                                            theorem KostantSetupData.gradedHomDim_trivial {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (n : ) :
                                            ksd.gradedHomDim 0 n = if n = 0 then 1 else 0
                                            noncomputable def KostantSetupData.hilbertSeriesHomDual {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (wt : ksd.P) :
                                            Instances For
                                              def KostantSetupData.actualHilbertSeriesHom {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (wt : ksd.P) :
                                              Instances For
                                                theorem kostant_hilbert_series_core {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (wt : ksd.P) (hwt : wt ksd.dominantWeights) :
                                                theorem kostant_hilbert_series_genuine {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (wt : ksd.P) (hwt : wt ksd.dominantWeights) :
                                                theorem kostant_weylCharacter_zero {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                theorem kostant_qIntegerProd_mul_CT_posRoots_eq_one {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                (∏ i : Fin ksd.rank, qInteger (ksd.degrees i)) * concreteCT_posRoots ksd.roots ksd.posRoots = 1
                                                Instances For
                                                  Instances For
                                                    noncomputable def kostant_cst_tensor {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                    Instances For
                                                      theorem kostant_cst_free {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                      Instances For
                                                        noncomputable def kostant_Hom_Sg_linearEquiv {R : Type u_4} [CommRing R] {𝔤 : Type u_5} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (V : Type u_6) [AddCommGroup V] [Module R V] [Module.Finite R V] [LieRingModule 𝔤 V] [LieModule R 𝔤 V] [LieModule.IsIrreducible R 𝔤 V] [LieRingModule 𝔤 (SymmetricAlgebra R 𝔤)] [LieModule R 𝔤 (SymmetricAlgebra R 𝔤)] [Module (↥ksd.invariantSubalgebra) (V →ₗ⁅R,𝔤 SymmetricAlgebra R 𝔤)] :
                                                        Instances For
                                                          theorem nontrivial_of_irreducible_module (R : Type u_4) [CommRing R] (𝔤 : Type u_5) [LieRing 𝔤] [LieAlgebra R 𝔤] (V : Type u_6) [AddCommGroup V] [Module R V] [LieRingModule 𝔤 V] [LieModule R 𝔤 V] [LieModule.IsIrreducible R 𝔤 V] :
                                                          theorem kostant_Hom_Sg_free_helper {R : Type u_4} [CommRing R] {𝔤 : Type u_5} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (V : Type u_6) [AddCommGroup V] [Module R V] [Module.Finite R V] [LieRingModule 𝔤 V] [LieModule R 𝔤 V] [LieModule.IsIrreducible R 𝔤 V] [LieRingModule 𝔤 (SymmetricAlgebra R 𝔤)] [LieModule R 𝔤 (SymmetricAlgebra R 𝔤)] [Module (↥ksd.invariantSubalgebra) (V →ₗ⁅R,𝔤 SymmetricAlgebra R 𝔤)] :
                                                          theorem kostant_Hom_Sg_free {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (V : Type u_4) [AddCommGroup V] [Module R V] [Module.Finite R V] [LieRingModule 𝔤 V] [LieModule R 𝔤 V] [LieModule.IsIrreducible R 𝔤 V] [LieRingModule 𝔤 (SymmetricAlgebra R 𝔤)] [LieModule R 𝔤 (SymmetricAlgebra R 𝔤)] [Module (↥ksd.invariantSubalgebra) (V →ₗ⁅R,𝔤 SymmetricAlgebra R 𝔤)] :
                                                          noncomputable def kostant_Hom_Sg_tensorHom_equiv {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (V : Type u_4) [AddCommGroup V] [Module R V] [Module.Finite R V] [LieRingModule 𝔤 V] [LieModule R 𝔤 V] [LieModule.IsIrreducible R 𝔤 V] [LieRingModule 𝔤 (SymmetricAlgebra R 𝔤)] [LieModule R 𝔤 (SymmetricAlgebra R 𝔤)] [Module (↥ksd.invariantSubalgebra) (V →ₗ⁅R,𝔤 SymmetricAlgebra R 𝔤)] :
                                                          Instances For
                                                            Instances For
                                                              theorem powerSeries_zsmul_left_cancel {n : } (hn : n 0) {a b : PowerSeries } (h : n a = n b) :
                                                              a = b
                                                              theorem weylGroup_card_ne_zero {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                              (Fintype.card ksd.W) 0
                                                              theorem concreteCT_posRoots_lambda_zero {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) (roots posRoots : Finset ksd.P) :
                                                              concreteCT_posRoots_lambda roots posRoots 0 = concreteCT_posRoots roots posRoots
                                                              theorem kostant_hilbert_series_at_zero {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                              (∏ i : Fin ksd.rank, qInteger (ksd.degrees i)) * concreteCT_fullRoots ksd.roots = (Fintype.card ksd.W) 1
                                                              theorem kostant_cor_134_fullRoots {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                              (∏ i : Fin ksd.rank, qInteger (ksd.degrees i)) * concreteCT_fullRoots ksd.roots = (Fintype.card ksd.W) 1
                                                              noncomputable def kostant_center_is_polynomial {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                              Instances For
                                                                theorem pbw_mulMap_bijective {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                                @[reducible, inline]
                                                                Instances For
                                                                  theorem pbwHarmonicFreeUEA {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                                  theorem pbw_harmonicFree_UEA {R : Type u_1} [CommRing R] {𝔤 : Type u_2} [LieRing 𝔤] [LieAlgebra R 𝔤] [LieAlgebra.IsSemisimple R 𝔤] (ksd : KostantSetupData) :
                                                                  noncomputable def KostantFqSingleFactor (q : ) (z : ) :
                                                                  Instances For
                                                                    noncomputable def KostantFqProd {ι : Type u_4} {T : Type u_5} (posRoots : Finset ι) (φ : ιT) (q : ) (x : T) :
                                                                    Instances For
                                                                      theorem KostantFq_denom_ne_zero (q : ) (z : ) (hq : 0 q) (hq1 : q < 1) (hz : z = 1) :
                                                                      1 - q * z 0
                                                                      theorem KostantFq_normSq_bound (q : ) (z : ) (hq : 0 q) (hz : z = 1) :
                                                                      Complex.normSq (1 - z) 4 * Complex.normSq (1 - q * z)
                                                                      theorem KostantFq_single_tendsto_one (z : ) (hz1 : z 1) :
                                                                      Filter.Tendsto (fun (q : ) => (1 - z) / (1 - q * z)) (nhdsWithin 1 (Set.Ioo 0 1)) (nhds 1)
                                                                      theorem tendsto_norm_sq_sub_zero_complex {α : Type u_4} {l : Filter α} {f : α} {a : } (hf : Filter.Tendsto f l (nhds a)) :
                                                                      Filter.Tendsto (fun (x : α) => f x - a ^ 2) l (nhds 0)
                                                                      theorem kostant_lemma_13_2 {ι : Type u_4} {T : Type u_5} [MeasurableSpace T] {μ : MeasureTheory.Measure T} [MeasureTheory.IsFiniteMeasure μ] (posRoots : Finset ι) (φ : ιT) (hφ_norm : αposRoots, ∀ (x : T), φ α x = 1) (hφ_meas : αposRoots, Measurable (φ α)) (hφ_ne_one : αposRoots, μ {x : T | φ α x = 1} = 0) :
                                                                      Filter.Tendsto (fun (q : ) => (x : T), KostantFqProd posRoots φ q x - 1 ^ 2 μ) (nhdsWithin 1 (Set.Ioo 0 1)) (nhds 0)