Paper
The local realization of generating series of finite Lie rank
11 pages · 20 marked passages · pdflatex · download PDF · lax-825748
-
Convergent commutative power series
A real power series in commuting variables is convergent if its coefficients admit a geometric bound with . For finitely many variables this is equivalent to absolute convergence on a neighborhood of the origin. Dimension zero is included.
1 import Lax825748.FormalSeries 2 … module docstring, 11 lines 14 15 noncomputable section 16 17 namespace Lax825748.ConvergentSeries 18 19 open Lax825748.FormalSeries Lax825748.Monomials 20 21 def HasGeometricBound {d : ℕ} (f : StateSeries d) (α C : ℝ) : Prop := 22 ∀ I : Fin d →₀ ℕ, |MvPowerSeries.coeff I f| ≤ α * C ^ totalDegree I 23 24 def Convergent {d : ℕ} (f : StateSeries d) : Prop := 25 ∃ α : ℝ, 0 < α ∧ ∃ C : ℝ, 0 < C ∧ HasGeometricBound f α C 26 27 end Lax825748.ConvergentSeries 28 -
Analytic differential representations
A differential representation is analytic if its output series and every coefficient of each of its vector fields converge near the origin. Its generated coefficient at a word is the constant term of , with the vector fields acting on the right in the order of the letters. A series is analytically produced if such a representation exists in some finite dimension, including dimension zero.
Convergence of the vector fields is required explicitly. It is used in the proof and in the interpretation by analytic systems, although omitted from the printed Definition 1.
1 import Lax825748.ConvergentSeries 2 import Lax825748.DifferentialRepresentation 3 … module docstring, 16 lines 20 21 noncomputable section 22 23 namespace Lax825748.AnalyticRepresentations 24 25 open Lax825748.Series Lax825748.DifferentialRepresentation ConvergentSeries 26 27 def IsAnalytic {X : Type} {d : ℕ} (R : Representation X d) : Prop := 28 Convergent R.output ∧ ∀ x i, Convergent (R.fields x i) 29 30 def AnalyticallyProduced {X : Type} (g : NCSeries X) : Prop := 31 ∃ d, ∃ R : Representation X d, IsAnalytic R ∧ Represents R g 32 33 end Lax825748.AnalyticRepresentations 34 -
Noncommutative series and polynomial residuals
For an alphabet , a series is a function and a polynomial is a finite real linear combination of words. Polynomial multiplication is concatenation. The pairing is .
The two residuals are and . The empty word is the monoid identity. Agreement below degree means equality at every word of length less than .
1 import Mathlib.Algebra.MonoidAlgebra.Basic 2 import Mathlib.Algebra.FreeMonoid.Basic 3 import Mathlib.Data.Real.Basic 4 … module docstring, 13 lines 18 19 noncomputable section 20 21 namespace Lax825748.Series 22 23 abbrev Word (X : Type) := FreeMonoid X 24 abbrev NCSeries (X : Type) := Word X → ℝ 25 abbrev NCPolynomial (X : Type) := MonoidAlgebra ℝ (Word X) 26 27 noncomputable def pairing {X : Type} (S : NCSeries X) (P : NCPolynomial X) : ℝ := 28 P.coeff.sum fun w a => a * S w 29 30 noncomputable def wordPolynomial {X : Type} (w : Word X) : NCPolynomial X := 31 MonoidAlgebra.single w 1 32 33 noncomputable def letter {X : Type} (x : X) : NCPolynomial X := 34 wordPolynomial (FreeMonoid.of x) 35 36 noncomputable def rightResidual {X : Type} (S : NCSeries X) 37 (P : NCPolynomial X) : NCSeries X := 38 fun w => pairing S (P * wordPolynomial w) 39 40 noncomputable def leftResidual {X : Type} (P : NCPolynomial X) 41 (S : NCSeries X) : NCSeries X := 42 fun w => pairing S (wordPolynomial w * P) 43 44 noncomputable def constantSeries {X : Type} (a : ℝ) : NCSeries X := by 45 classical 46 exact fun w => if w = 1 then a else 0 47 48 def AgreeBelow {X : Type} (N : ℕ) (S T : NCSeries X) : Prop := 49 ∀ w, w.toList.length < N → S w = T w 50 51 def FormallyContinuous {X Y : Type} (F : NCSeries X → NCSeries Y) : Prop := 52 ∀ N, ∃ M, ∀ S T, AgreeBelow M S T → AgreeBelow N (F S) (F T) 53 54 end Lax825748.Series 55 -
Lie polynomials and Lie rank
The Lie polynomials form the Lie subalgebra of generated by the letters, with bracket . The Lie residual space of is the linear span of the series for Lie polynomials . The assertion that has Lie rank includes finite dimensionality; in particular an infinite-dimensional space never has rank zero by convention.
1 import Lax825748.Series 2 import Mathlib.Algebra.Lie.OfAssociative 3 import Mathlib.Algebra.Lie.Subalgebra 4 import Mathlib.LinearAlgebra.Dimension.Finite 5 … module docstring, 12 lines 18 19 noncomputable section 20 21 namespace Lax825748.LieRank 22 23 open Series 24 25 instance polynomialLieRing {X : Type} : LieRing (NCPolynomial X) := 26 LieRing.ofAssociativeRing 27 28 def liePolynomials (X : Type) : LieSubalgebra ℝ (NCPolynomial X) := 29 LieSubalgebra.lieSpan ℝ (NCPolynomial X) (Set.range letter) 30 31 abbrev LiePolynomial (X : Type) := liePolynomials X 32 33 noncomputable def residualSpace {X : Type} (g : NCSeries X) : 34 Submodule ℝ (NCSeries X) := 35 Submodule.span ℝ {S | ∃ P : LiePolynomial X, S = leftResidual P.val g} 36 37 def HasLieRank {X : Type} (g : NCSeries X) (d : ℕ) : Prop := 38 Module.Finite ℝ (residualSpace g) ∧ Module.finrank ℝ (residualSpace g) = d 39 40 def FiniteLieRank {X : Type} (g : NCSeries X) : Prop := ∃ d, HasLieRank g d 41 42 end Lax825748.LieRank 43 -
The convergence hypothesis on Lie polynomials
Condition (C) requires that, for every finite ordered family of Lie polynomials , there are such that
The constants may depend on the family, but not on the exponents.
The inequalities show that replacing by gives the same condition. Empty families are allowed.
- def✓
Lax825748.ConvergenceHypothesis(1st statement) - def✓
Lax825748.ConvergenceHypothesis(2nd statement)
1 import Lax825748.LieRank 2 import Lax825748.Monomials 3 … module docstring, 13 lines 17 18 noncomputable section 19 20 namespace Lax825748.ConvergenceHypothesis 21 22 open Lax825748.Series Lax825748.LieRank Lax825748.Monomials 23 24 def Holds {X : Type} (g : NCSeries X) : Prop := 25 ∀ (q : ℕ) (P : Fin q → LiePolynomial X), 26 ∃ α : ℝ, 0 < α ∧ ∃ C : ℝ, 0 < C ∧ 27 ∀ I : Fin q → ℕ, 28 |pairing g (orderedPowers (fun j => (P j).val) I)| ≤ 29 α * C ^ totalDegree I * (multiFactorial I : ℝ) 30 31 def HoldsWithTotalFactorial {X : Type} (g : NCSeries X) : Prop := 32 ∀ (q : ℕ) (P : Fin q → LiePolynomial X), 33 ∃ α : ℝ, 0 < α ∧ ∃ C : ℝ, 0 < C ∧ 34 ∀ I : Fin q → ℕ, 35 |pairing g (orderedPowers (fun j => (P j).val) I)| ≤ 36 α * C ^ totalDegree I * ((totalDegree I).factorial : ℝ) 37 38 axiom factorial_comparison {q : ℕ} (I : Fin q → ℕ) : 39 multiFactorial I ≤ (totalDegree I).factorial ∧ 40 (totalDegree I).factorial ≤ q ^ totalDegree I * multiFactorial I 41 42 axiom total_factorial_iff {X : Type} (g : NCSeries X) : 43 Holds g ↔ HoldsWithTotalFactorial g 44 45 end Lax825748.ConvergenceHypothesis 46 - def✓
-
Local analytic realization of generating series
For a finite alphabet, a real noncommutative series admits an analytic differential representation if and only if it has finite Lie rank and satisfies (C). If its Lie rank is , a representation of dimension exactly exists.
The realization is obtained in the normalized residual coordinates . Convergence of the output and of the vector-field coefficients follows from their convergent coordinate expansions.
1 import Lax825748.AnalyticRepresentations 2 import Lax825748.NecessaryConvergence 3 import Lax825748.ResidualConvergence 4 import Lax825748.AnalyticCoordinates 5 import Lax825748.FormalMinimality 6 … module docstring, 14 lines 21 22 noncomputable section 23 24 namespace Lax825748.Realization 25 26 open Lax825748.Series Lax825748.LieRank Lax825748.DifferentialRepresentation 27 open AnalyticRepresentations 28 29 axiom existence {X : Type} [Finite X] (g : NCSeries X) (d : ℕ) 30 (hr : HasLieRank g d) (hC : ConvergenceHypothesis.Holds g) : 31 ∃ R : Representation X d, IsAnalytic R ∧ Represents R g 32 33 axiom characterization {X : Type} [Finite X] (g : NCSeries X) : 34 AnalyticallyProduced g ↔ FiniteLieRank g ∧ ConvergenceHypothesis.Holds g 35 36 end Lax825748.Realization 37 -
Lie rank is the least analytic realization dimension
A series has Lie rank and satisfies (C) if and only if is the least dimension of its analytic differential representations. The least dimension is attained. Constant series are included with dimension zero.
1 import Lax825748.Realization 2 … module docstring, 9 lines 12 13 noncomputable section 14 15 namespace Lax825748.Minimality 16 17 open Lax825748.Series Lax825748.LieRank Lax825748.DifferentialRepresentation 18 open AnalyticRepresentations 19 20 def IsLeastDimension {X : Type} (g : NCSeries X) (d : ℕ) : Prop := 21 (∃ R : Representation X d, IsAnalytic R ∧ Represents R g) ∧ 22 ∀ e, (∃ R : Representation X e, IsAnalytic R ∧ Represents R g) → d ≤ e 23 24 axiom least_dimension {X : Type} [Finite X] (g : NCSeries X) (d : ℕ) : 25 (HasLieRank g d ∧ ConvergenceHypothesis.Holds g) ↔ IsLeastDimension g d 26 27 end Lax825748.Minimality 28 -
Analytic equivalence of minimal realizations
Two analytic differential representations of a series of Lie rank , both of dimension , are related by an analytic change of coordinates fixing the origin. This change sends the first output to the second and intertwines the action of every word on every state series. Its inverse is also convergent and formally continuous.
1 import Lax825748.Minimality 2 import Lax825748.AnalyticChanges 3 import Lax825748.FormalUniqueness 4 … module docstring, 11 lines 16 17 noncomputable section 18 19 namespace Lax825748.Uniqueness 20 21 open Lax825748.Series Lax825748.LieRank Lax825748.FormalSeries 22 open Lax825748.DifferentialRepresentation AnalyticRepresentations AnalyticChanges 23 24 axiom minimal_realizations_equivalent {X : Type} [Finite X] {d : ℕ} 25 (g : NCSeries X) (hr : HasLieRank g d) 26 (R R' : Representation X d) (hR : Represents R g) (hR' : Represents R' g) 27 (ha : IsAnalytic R) (ha' : IsAnalytic R') : 28 ∃ φ : AnalyticChange d, 29 φ.toAlgEquiv R.output = R'.output ∧ 30 ∀ (k : StateSeries d) (w : Word X), 31 φ.toAlgEquiv (act R k w) = act R' (φ.toAlgEquiv k) w 32 33 end Lax825748.Uniqueness 34 -
Shuffle multiplication
The coefficient of in the shuffle of and is the sum of over subsets of the positions of . Repeated letters retain their multiplicities. This product is associative and commutative, with unit the series supported at the empty word. No concatenation product on series is used here.
- def✓
Lax825748.Shuffle(1st statement) - def✓
Lax825748.Shuffle(2nd statement) - def✓
Lax825748.Shuffle(3rd statement)
1 import Lax825748.Series 2 … module docstring, 11 lines 14 15 noncomputable section 16 17 namespace Lax825748.Shuffle 18 19 open Series 20 21 def unshuffles {X : Type} : List X → List (List X × List X) 22 | [] => [([], [])] 23 | x :: w => (unshuffles w).flatMap fun p => 24 [(x :: p.1, p.2), (p.1, x :: p.2)] 25 26 noncomputable def shuffle {X : Type} (S T : NCSeries X) : NCSeries X := 27 fun w => ((unshuffles w.toList).map fun p => 28 S (FreeMonoid.ofList p.1) * T (FreeMonoid.ofList p.2)).sum 29 30 noncomputable def shuffleList {X : Type} : List (NCSeries X) → NCSeries X 31 | [] => constantSeries 1 32 | S :: l => shuffle S (shuffleList l) 33 34 noncomputable def shufflePow {X : Type} (S : NCSeries X) (n : ℕ) : NCSeries X := 35 shuffleList (List.replicate n S) 36 37 axiom commutative {X : Type} (S T : NCSeries X) : shuffle S T = shuffle T S 38 39 axiom associative {X : Type} (R S T : NCSeries X) : 40 shuffle (shuffle R S) T = shuffle R (shuffle S T) 41 42 axiom unit {X : Type} (S : NCSeries X) : shuffle (constantSeries 1) S = S 43 44 end Lax825748.Shuffle 45 - def✓
-
Coproduct and shuffle identities
Lemmas 1–5. The -fold coproduct assigns each position of a word to one of tensor factors. Tensor polynomials are represented by finite linear combinations of -tuples of words. Its value on a letter is the sum of the placements of that letter, and Lie polynomials are primitive.
Pairing with this coproduct computes the shuffle product. Letter residuals are derivations. A shuffle product of zero-constant series vanishes on a product of fewer than Lie polynomials. For equal numbers of factors, the pairing is the sum over permutations of pairwise evaluations.
For normalized coordinate series, equal-degree monomials have diagonal pairing and off-diagonal pairing zero. This corrects the printed in Lemma 5(ii).
- thm✓
Lax825748.ShuffleIdentities(1st statement) - thm✓
Lax825748.ShuffleIdentities(2nd statement) - thm✓
Lax825748.ShuffleIdentities(3rd statement) - thm✓
Lax825748.ShuffleIdentities(4th statement) - thm✓
Lax825748.ShuffleIdentities(5th statement) - thm✓
Lax825748.ShuffleIdentities(6th statement) - thm✓
Lax825748.ShuffleIdentities(7th statement)
1 import Lax825748.Shuffle 2 import Lax825748.LieRank 3 import Lax825748.Monomials 4 import Mathlib.Data.Fintype.Perm 5 … module docstring, 19 lines 25 26 noncomputable section 27 28 namespace Lax825748.ShuffleIdentities 29 30 open Series Shuffle LieRank Monomials 31 open scoped BigOperators 32 33 abbrev TensorPolynomial (X : Type) (p : ℕ) := 34 MonoidAlgebra ℝ (Fin p → Word X) 35 36 def distributions {X : Type} (p : ℕ) : List X → List (Fin p → List X) 37 | [] => [fun _ => []] 38 | x :: w => (distributions p w).flatMap fun v => 39 List.ofFn fun i : Fin p => Function.update v i (x :: v i) 40 41 noncomputable def coproduct {X : Type} (p : ℕ) (P : NCPolynomial X) : 42 TensorPolynomial X p := 43 P.coeff.sum fun w a => ((distributions p w.toList).map fun v => 44 MonoidAlgebra.single (fun i => FreeMonoid.ofList (v i)) a).sum 45 46 noncomputable def tensorPairing {X : Type} {p : ℕ} (S : Fin p → NCSeries X) 47 (P : TensorPolynomial X p) : ℝ := 48 P.coeff.sum fun v a => a * ∏ i, S i (v i) 49 50 noncomputable def insertFactor {X : Type} {p : ℕ} (i : Fin p) 51 (P : NCPolynomial X) : TensorPolynomial X p := 52 P.coeff.sum fun w a => MonoidAlgebra.single (fun j => if j = i then w else 1) a 53 54 axiom coproduct_multiplicative {X : Type} (p : ℕ) (P Q : NCPolynomial X) : 55 coproduct p (P * Q) = coproduct p P * coproduct p Q 56 57 axiom pairing_coproduct {X : Type} {p : ℕ} (S : Fin p → NCSeries X) 58 (P : NCPolynomial X) : 59 pairing (shuffleList (List.ofFn S)) P = tensorPairing S (coproduct p P) 60 61 axiom lie_primitive {X : Type} (p : ℕ) (P : LiePolynomial X) : 62 coproduct p P.val = ∑ i : Fin p, insertFactor i P.val 63 64 axiom residual_derivation {X : Type} (x : X) (S T : NCSeries X) : 65 rightResidual (shuffle S T) (letter x) = 66 shuffle (rightResidual S (letter x)) T + shuffle S (rightResidual T (letter x)) 67 68 axiom vanishing {X : Type} {i j : ℕ} (hji : j < i) 69 (T : Fin i → NCSeries X) (hT : ∀ k, T k 1 = 0) 70 (Q : Fin j → LiePolynomial X) : 71 pairing (shuffleList (List.ofFn T)) ((List.ofFn fun k => (Q k).val).prod) = 0 72 73 axiom permutation_pairing {X : Type} {n : ℕ} 74 (T : Fin n → NCSeries X) (hT : ∀ k, T k 1 = 0) 75 (Q : Fin n → LiePolynomial X) : 76 pairing (shuffleList (List.ofFn T)) ((List.ofFn fun k => (Q k).val).prod) = 77 ∑ σ : Equiv.Perm (Fin n), ∏ k, pairing (T k) (Q (σ k)).val 78 79 noncomputable def shuffleMonomial {X : Type} {d : ℕ} (S : Fin d → NCSeries X) 80 (I : Fin d → ℕ) : NCSeries X := 81 shuffleList (List.ofFn fun i => shufflePow (S i) (I i)) 82 83 axiom triangular_pairing {X : Type} {d : ℕ} (S : Fin d → NCSeries X) 84 (P : Fin d → LiePolynomial X) (hS : ∀ i, S i 1 = 0) 85 (hSP : ∀ i j, pairing (S i) (P j).val = if i = j then 1 else 0) 86 (I J : Fin d → ℕ) : 87 (totalDegree J < totalDegree I → 88 pairing (shuffleMonomial S I) (orderedPowers (fun i => (P i).val) J) = 0) ∧ 89 (totalDegree I = totalDegree J → 90 pairing (shuffleMonomial S I) (orderedPowers (fun i => (P i).val) J) = 91 if I = J then (multiFactorial I : ℝ) else 0) 92 93 end Lax825748.ShuffleIdentities 94 - thm✓
-
thm✓
Lax825748.PBWPoincaré–Birkhoff–Witt for Lie polynomials
Given any totally ordered basis of the Lie polynomials, the nondecreasing products of its basis elements, including the empty product, form a basis of the concatenation algebra . Linear independence and spanning are stated separately in the conjunction.
1 import Lax825748.LieRank 2 import Mathlib.LinearAlgebra.Basis.Defs 3 … module docstring, 10 lines 14 15 noncomputable section 16 17 namespace Lax825748.PBW 18 19 open Series LieRank 20 21 abbrev OrderedWord (ι : Type) [LinearOrder ι] := 22 {l : List ι // l.Pairwise (· ≤ ·)} 23 24 noncomputable def monomial {X ι : Type} [LinearOrder ι] 25 (b : Module.Basis ι ℝ (LiePolynomial X)) (l : OrderedWord ι) : NCPolynomial X := 26 (l.val.map fun i => (b i).val).prod 27 28 axiom basis {X ι : Type} [LinearOrder ι] (b : Module.Basis ι ℝ (LiePolynomial X)) : 29 LinearIndependent ℝ (monomial b) ∧ 30 Submodule.span ℝ (Set.range (monomial b)) = ⊤ 31 32 end Lax825748.PBW 33 -
Factorial estimates for iterated analytic vector fields
Suppose the output and all vector-field coefficients admit the same bound , where . For a word of length , its generated coefficient has absolute value at most . Consequently every analytic representation on a finite alphabet has a uniform factorial bound on its word coefficients.
The central binomial estimate used in the majorant calculation is , rather than the printed .
1 import Lax825748.AnalyticRepresentations 2 … module docstring, 14 lines 17 18 noncomputable section 19 20 namespace Lax825748.FactorialEstimate 21 22 open Lax825748.Series Lax825748.DifferentialRepresentation 23 open ConvergentSeries AnalyticRepresentations 24 25 def HasFactorialBound {X : Type} (g : NCSeries X) : Prop := 26 ∃ α : ℝ, 0 < α ∧ ∃ C : ℝ, 0 < C ∧ ∀ w : Word X, 27 |g w| ≤ α * C ^ w.toList.length * (w.toList.length.factorial : ℝ) 28 29 axiom word_majorant {X : Type} {d : ℕ} (R : Representation X d) 30 (α C : ℝ) (hα : 0 < α) (hC : 0 < C) 31 (hh : HasGeometricBound R.output α C) 32 (hA : ∀ x i, HasGeometricBound (R.fields x i) α C) (w : Word X) : 33 |generatingSeries R w| ≤ 34 α * (2 * (d : ℝ) * α * C) ^ w.toList.length * (w.toList.length.factorial : ℝ) 35 36 axiom factorial_bound {X : Type} [Finite X] {d : ℕ} 37 (R : Representation X d) (hR : IsAnalytic R) : 38 HasFactorialBound (generatingSeries R) 39 40 end Lax825748.FactorialEstimate 41 -
Analytic representations satisfy the convergence hypothesis
The generating series of an analytic differential representation satisfies condition (C). A finite family of Lie polynomials acts by analytic vector fields. Applying the factorial estimate to these new fields, and comparing the total factorial with the product of factorials, gives the assertion.
1 import Lax825748.FactorialEstimate 2 import Lax825748.AnalyticCalculus 3 import Lax825748.ConvergenceHypothesis 4 … module docstring, 10 lines 15 16 noncomputable section 17 18 namespace Lax825748.NecessaryConvergence 19 20 open Lax825748.DifferentialRepresentation AnalyticRepresentations 21 22 axiom convergence {X : Type} {d : ℕ} (R : Representation X d) 23 (hR : IsAnalytic R) : 24 ConvergenceHypothesis.Holds (generatingSeries R) 25 26 end Lax825748.NecessaryConvergence 27 -
Formal coordinates on the annihilator of a Lie subalgebra
Proposition 1. Let be a Lie subalgebra of the Lie polynomials and let represent a basis modulo . Set . If the zero-constant series vanish on and satisfy , substitution of the into commutative formal series is a bijection onto .
Substitution is defined coefficient by coefficient using a finite truncation: at a word of length , only monomials of degree at most contribute. There exist such coordinates dual to the degree-one PBW monomials. For these coordinates the coefficient of in is . The annihilator is closed under the shuffle and all right residuals.
- thm✓
Lax825748.Annihilator(1st statement) - thm✓
Lax825748.Annihilator(2nd statement) - thm✓
Lax825748.Annihilator(3rd statement) - thm✓
Lax825748.Annihilator(4th statement) - thm✓
Lax825748.Annihilator(5th statement)
1 import Lax825748.PBW 2 import Lax825748.ShuffleIdentities 3 import Lax825748.FormalSeries 4 import Mathlib.RingTheory.Ideal.Span 5 … module docstring, 17 lines 23 24 noncomputable section 25 26 namespace Lax825748.Annihilator 27 28 open Series LieRank Monomials Shuffle ShuffleIdentities FormalSeries 29 30 abbrev LieSubalgebraOfPolynomials (X : Type) := LieSubalgebra ℝ (LiePolynomial X) 31 32 noncomputable def generatedIdeal {X : Type} (K : LieSubalgebraOfPolynomials X) : 33 Ideal (NCPolynomial X) := 34 Ideal.span {P | ∃ k : K, P = k.val.val} 35 36 def InAnnihilator {X : Type} (K : LieSubalgebraOfPolynomials X) (S : NCSeries X) : Prop := 37 ∀ P ∈ generatedIdeal K, pairing S P = 0 38 39 def IsComplement {X : Type} {d : ℕ} (K : LieSubalgebraOfPolynomials X) 40 (P : Fin d → LiePolynomial X) : Prop := 41 LinearIndependent ℝ (fun i => K.toSubmodule.mkQ (P i)) ∧ 42 Submodule.span ℝ (Set.range fun i => K.toSubmodule.mkQ (P i)) = ⊤ 43 44 def IsCoordinateFamily {X : Type} {d : ℕ} (K : LieSubalgebraOfPolynomials X) 45 (P : Fin d → LiePolynomial X) (S : Fin d → NCSeries X) : Prop := 46 (∀ i, S i 1 = 0) ∧ (∀ i, InAnnihilator K (S i)) ∧ 47 ∀ i j, pairing (S i) (P j).val = if i = j then 1 else 0 48 49 noncomputable def substituteShuffle {X : Type} {d : ℕ} 50 (S : Fin d → NCSeries X) (f : StateSeries d) : NCSeries X := 51 fun w => (AddMonoidAlgebra.coeff 52 (MvPowerSeries.truncTotal (w.toList.length + 1) f)).sum 53 fun I a => a * shuffleMonomial S I w 54 55 def IsPBWCoordinateFamily {X : Type} {d : ℕ} 56 (P : Fin d → LiePolynomial X) (S : Fin d → NCSeries X) : Prop := 57 ∀ i (I : Fin d →₀ ℕ), 58 pairing (S i) (orderedPowers (fun j => (P j).val) I) = 59 if I = Finsupp.single i 1 then 1 else 0 60 61 axiom coordinates_exist {X : Type} {d : ℕ} (K : LieSubalgebraOfPolynomials X) 62 (P : Fin d → LiePolynomial X) (hP : IsComplement K P) : 63 ∃ S : Fin d → NCSeries X, IsCoordinateFamily K P S ∧ IsPBWCoordinateFamily P S 64 65 axiom formal_coordinates {X : Type} {d : ℕ} (K : LieSubalgebraOfPolynomials X) 66 (P : Fin d → LiePolynomial X) (hP : IsComplement K P) 67 (S : Fin d → NCSeries X) (hS : IsCoordinateFamily K P S) : 68 ∀ T : NCSeries X, InAnnihilator K T ↔ ∃! f : StateSeries d, substituteShuffle S f = T 69 70 axiom pbw_expansion {X : Type} {d : ℕ} (K : LieSubalgebraOfPolynomials X) 71 (P : Fin d → LiePolynomial X) (hP : IsComplement K P) 72 (S : Fin d → NCSeries X) (hS : IsCoordinateFamily K P S) 73 (hPBW : IsPBWCoordinateFamily P S) (T : NCSeries X) (hT : InAnnihilator K T) : 74 ∃ f : StateSeries d, substituteShuffle S f = T ∧ 75 ∀ I : Fin d →₀ ℕ, MvPowerSeries.coeff I f = 76 pairing T (orderedPowers (fun j => (P j).val) I) / (multiFactorial I : ℝ) 77 78 axiom closed_shuffle {X : Type} (K : LieSubalgebraOfPolynomials X) 79 (S T : NCSeries X) (hS : InAnnihilator K S) (hT : InAnnihilator K T) : 80 InAnnihilator K (shuffle S T) 81 82 axiom closed_residual {X : Type} (K : LieSubalgebraOfPolynomials X) 83 (S : NCSeries X) (hS : InAnnihilator K S) (P : NCPolynomial X) : 84 InAnnihilator K (rightResidual S P) 85 86 end Lax825748.Annihilator 87 - thm✓
-
Convergence of PBW coordinate expansions
Let be a basis modulo a Lie subalgebra , and let be the associated PBW coordinates of , where . If satisfies (C), its coordinate expansion is convergent. The coefficient of is , so (C) is precisely the required geometric bound for this expansion.
1 import Lax825748.ConvergentSeries 2 import Lax825748.ConvergenceHypothesis 3 import Lax825748.Annihilator 4 … module docstring, 12 lines 17 18 noncomputable section 19 20 namespace Lax825748.PBWConvergence 21 22 open Lax825748.Series Lax825748.LieRank Lax825748.Annihilator 23 open Lax825748.FormalSeries ConvergentSeries 24 25 axiom expansion_converges {X : Type} {d : ℕ} 26 (K : LieSubalgebraOfPolynomials X) (P : Fin d → LiePolynomial X) 27 (hP : IsComplement K P) (S : Fin d → NCSeries X) 28 (hS : IsCoordinateFamily K P S) (hPBW : IsPBWCoordinateFamily P S) 29 (T : NCSeries X) (hT : InAnnihilator K T) 30 (hC : ConvergenceHypothesis.Holds T) : 31 ∃ f : StateSeries d, Convergent f ∧ substituteShuffle S f = T 32 33 end Lax825748.PBWConvergence 34 -
Convergence under polynomial residuals
If satisfies (C), so do and its centered series for every noncommutative polynomial . In particular the normalized observation coordinates used in part b) and all their letter residuals satisfy (C).
1 import Lax825748.ConvergenceHypothesis 2 … module docstring, 10 lines 13 14 noncomputable section 15 16 namespace Lax825748.ResidualConvergence 17 18 open Lax825748.Series ConvergenceHypothesis 19 20 axiom right_residual {X : Type} (g : NCSeries X) (hg : Holds g) 21 (Q : NCPolynomial X) : 22 Holds (rightResidual g Q) 23 24 axiom centered_residual {X : Type} (g : NCSeries X) (hg : Holds g) 25 (Q : NCPolynomial X) : 26 Holds (rightResidual g Q - constantSeries (pairing g Q)) 27 28 end Lax825748.ResidualConvergence 29 -
Analytic changes of coordinates
An analytic change of coordinates is a formally continuous real algebra automorphism fixing the origin whose coordinate images, in both directions, are convergent power series.
The analytic inverse function theorem implies that a formal change of coordinates with convergent coordinate images has convergent inverse images. This is the implicit function theorem used in part b) of the paper.
1 import Lax825748.ConvergentSeries 2 import Lax825748.CoordinateChange 3 … module docstring, 13 lines 17 18 noncomputable section 19 20 namespace Lax825748.AnalyticChanges 21 22 open Lax825748.FormalSeries Lax825748.CoordinateChange ConvergentSeries 23 24 structure AnalyticChange (d : ℕ) extends FormalChange d where 25 convergent_toFun : ∀ i, Convergent (toAlgEquiv (MvPowerSeries.X i)) 26 convergent_invFun : ∀ i, Convergent (toAlgEquiv.symm (MvPowerSeries.X i)) 27 28 axiom inverse_convergent {d : ℕ} (φ : FormalChange d) 29 (hφ : ∀ i, Convergent (φ.toAlgEquiv (MvPowerSeries.X i))) : 30 ∀ i, Convergent (φ.toAlgEquiv.symm (MvPowerSeries.X i)) 31 32 end Lax825748.AnalyticChanges 33 -
Convergent coordinates on an annihilator
Let be normalized, zero-constant coordinates on as in Proposition 1, each satisfying (C). Every element of satisfying (C) is a convergent series in the .
Indeed, the are convergent series in PBW coordinates and have identity linear part. Their inverse change of coordinates is convergent by the analytic inverse function theorem.
1 import Lax825748.PBWConvergence 2 import Lax825748.AnalyticCalculus 3 import Lax825748.AnalyticChanges 4 … module docstring, 13 lines 18 19 noncomputable section 20 21 namespace Lax825748.AnalyticCoordinates 22 23 open Lax825748.Series Lax825748.LieRank Lax825748.Annihilator 24 open Lax825748.FormalSeries ConvergentSeries 25 26 axiom expansion_converges {X : Type} {d : ℕ} 27 (K : LieSubalgebraOfPolynomials X) (P : Fin d → LiePolynomial X) 28 (hP : IsComplement K P) (T : Fin d → NCSeries X) 29 (hT : IsCoordinateFamily K P T) 30 (hCT : ∀ i, ConvergenceHypothesis.Holds (T i)) 31 (U : NCSeries X) (hU : InAnnihilator K U) 32 (hCU : ConvergenceHypothesis.Holds U) : 33 ∃ f : StateSeries d, Convergent f ∧ substituteShuffle T f = U 34 35 end Lax825748.AnalyticCoordinates 36 -
The series homomorphism of a differential representation
Lemma 6. The map is a formally continuous real algebra homomorphism from the state series to the shuffle series, and . Algebra preservation is expressed by its scalar, additive, and multiplicative identities, with shuffle multiplication written explicitly.
- thm✓
Lax825748.RepresentationMap(1st statement) - thm✓
Lax825748.RepresentationMap(2nd statement) - thm✓
Lax825748.RepresentationMap(3rd statement)
1 import Lax825748.DifferentialRepresentation 2 import Lax825748.Shuffle 3 … module docstring, 11 lines 15 16 noncomputable section 17 18 namespace Lax825748.RepresentationMap 19 20 open Series FormalSeries DifferentialRepresentation Shuffle 21 22 noncomputable def eta {X : Type} {d : ℕ} (R : Representation X d) 23 (k : StateSeries d) : NCSeries X := 24 fun w => MvPowerSeries.constantCoeff (act R k w) 25 26 axiom algebra_homomorphism {X : Type} {d : ℕ} (R : Representation X d) : 27 (∀ a : ℝ, eta R (MvPowerSeries.C a) = constantSeries a) ∧ 28 (∀ f k, eta R (f + k) = eta R f + eta R k) ∧ 29 (∀ f k, eta R (f * k) = shuffle (eta R f) (eta R k)) 30 31 axiom continuous {X : Type} {d : ℕ} (R : Representation X d) : 32 ∀ N, ∃ M, ∀ f k, FormalSeries.AgreeBelow M f k → 33 Series.AgreeBelow N (eta R f) (eta R k) 34 35 axiom intertwining {X : Type} {d : ℕ} (R : Representation X d) 36 (k : StateSeries d) (w : Word X) : 37 eta R (act R k w) = rightResidual (eta R k) (wordPolynomial w) 38 39 end Lax825748.RepresentationMap 40 - thm✓
-
The PBW coordinate projection
Lemma 7. For the PBW coordinates of a finite-codimension Lie subalgebra,
is a formally continuous shuffle algebra homomorphism. It maps onto and is the identity there.
1 import Lax825748.Annihilator 2 … module docstring, 10 lines 13 14 noncomputable section 15 16 namespace Lax825748.Projection 17 18 open Series LieRank Monomials Shuffle FormalSeries Annihilator 19 20 noncomputable def theta {X : Type} {d : ℕ} (P : Fin d → LiePolynomial X) 21 (S : Fin d → NCSeries X) (T : NCSeries X) : NCSeries X := 22 substituteShuffle S (fun I => 23 pairing T (orderedPowers (fun j => (P j).val) I) / (multiFactorial I : ℝ)) 24 25 axiom projection {X : Type} {d : ℕ} (K : LieSubalgebraOfPolynomials X) 26 (P : Fin d → LiePolynomial X) (hP : IsComplement K P) 27 (S : Fin d → NCSeries X) (hS : IsCoordinateFamily K P S) 28 (hPBW : IsPBWCoordinateFamily P S) : 29 Series.FormallyContinuous (theta P S) ∧ 30 (∀ a : ℝ, theta P S (constantSeries a) = constantSeries a) ∧ 31 (∀ T U, theta P S (T + U) = theta P S T + theta P S U) ∧ 32 (∀ T U, theta P S (shuffle T U) = shuffle (theta P S T) (theta P S U)) ∧ 33 (∀ T, InAnnihilator K (theta P S T)) ∧ 34 (∀ T, InAnnihilator K T → theta P S T = T) 35 36 end Lax825748.Projection 37