about different kinds of substitutions
play

About different kinds of Substitutions Matthieu Deneufch atel S - PowerPoint PPT Presentation

About different kinds of Substitutions Matthieu Deneufch atel S eminaire CALIN, 18 Janvier 2011 Outline Commutative case 1 Non commutative case 2 Language theory Case of a finite alphabet Case of an infinite alphabet Substitutions,


  1. About different kinds of Substitutions Matthieu Deneufchˆ atel S´ eminaire CALIN, 18 Janvier 2011

  2. Outline Commutative case 1 Non commutative case 2 Language theory Case of a finite alphabet Case of an infinite alphabet Substitutions, graphs, Fa` a di Bruno’s formula and Bell polynomials 3 M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 2 / 19

  3. Commutative case Commutative substitution I Let R be a commutative ring and A be a R -associative algebra with unit. If X = ( X i ) i ∈ I is a set of indeterminates, R [ X ] denotes the algebra of polynomials with coefficients in R . Let x = ( x i ) i ∈ I be a set of pairwise commuting elements of A . Then there is only one morphism of AAU φ : R [ X ] → A such that φ ( X i ) = x i . If u ∈ R [ X ], we note φ ( u ) = u ( x ) = u (( x i ) i ∈ I ). ′ is a morphism of R -associative algebras with unit, one If λ : A → A has λ ( u ( x )) = u (( λ ( x i )) i ∈ I ) (1) ′ is such that X i �→ λ ( x i ). for λ ◦ φ : R [ X ] → A M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 3 / 19

  4. Commutative case Commutative substitution II Let Y = ( Y j ) j ∈ J be another set of indeterminates and take A = R [ Y ]. If u ∈ R [ X ] and ( g i ) i ∈ I ∈ R [ Y ] I , let u ( g ) ∈ R [ Y ] be the polynomial obtained by substitution of the g i ’s in u . ′ . Let y = ( y j ) j ∈ J be a set of pairwise commuting elements of A Applying (1) with ′ λ : A = R [ Y ] → A �→ g i ( y ) g i yields ( u ( g ))( y ) = u (( g i ( y )) i ∈ I ) . (2) Now if f = ( f i ) i ∈ I ∈ ( R [( X j ) j ∈ J ]) I and g = ( g j ) j ∈ J ∈ ( R [( Y k ) k ∈ K ]) J we denote by f ◦ g the family of polynomials ( f i ( g )) i ∈ I ∈ ( R [( Y k ) k ∈ K ]) I . Eq. (2) implies that ◦ is associative. M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 4 / 19

  5. Commutative case Lagrange inversion formula Let f be an analytic complex function such that f (0) = 0 and f ′ (0) � = 0. Then there exists an analytic function g such that g ( f ( z )) = z . If the Taylor series of f near 0 is f ( z ) = f 1 z + f 2 z 2 + . . . , the coefficients of (the Taylor expansion of) g (near 0) are given by �� d � n − 1 � z � n �� g n = 1 � . � n ! f ( z ) dz � � z =0 More generally, if f ( w ) = z is analytic at the point a with f ′ ( a ) � = 0, and if w = g ( z ) with g analytic at the point b = f ( a ), one has �� d � n − 1 � w − a ∞ � n � ( z − b ) n � g ( z ) = a + lim . dw f ( w ) − b n ! w → a n =1 M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 5 / 19

  6. Commutative case Substitutions and Hopf algebra 1/4 ∞ � � � G dif φ n x n +1 , φ n ∈ C uni = φ ( x ) = x + k =1 Formal diffeomorphisms (tangent to the unity) Structure of (non-abelian) group for the composition law � φ n ( ψ ( x )) n +1 φ ( ψ ( x )) = ψ ( x ) + n ≥ 1 Id( x ) = x Inverse of a series can be found by the Lagrange inversion formula. M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 6 / 19

  7. Commutative case Substitutions and Hopf algebra 1/4 ∞ � � � G dif φ n x n +1 , φ n ∈ C uni = φ ( x ) = x + k =1 Formal diffeomorphisms (tangent to the unity) Structure of (non-abelian) group for the composition law � φ n ( ψ ( x )) n +1 φ ( ψ ( x )) = ψ ( x ) + n ≥ 1 Id( x ) = x Inverse of a series can be found by the Lagrange inversion formula. C ( G dif uni ) : functions G dif uni → C which are in the algebra generated by some basic elements (i.e. are “polynomial” w.r.t. these elements). For example, one can choose the functions d n +1 φ (0) 1 a n : φ �→ = φ n , n ≥ 1 . dx n +1 ( n + 1)! M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 6 / 19

  8. Commutative case Substitutions and Hopf algebra 2/4 The group structure of G dif uni induces a Hopf algebra structure on C ( G dif uni ) : product : � µ ( a n ⊗ a m ) | φ ◦ ψ � = a n ( φ ) a m ( ψ ) ; coproduct : � ∆ dif a n | φ ⊗ ψ � = a n ( φ ◦ ψ ) ; ∞ a k x k +1 be the generating series of the a k ’s ( a 0 = 1). � Let A ( x ) = k =0 Then one has ∞ 1 ∆ dif a n x n = � z − 1 � A ( z ) ⊗ ∆ dif A ( x ) = � z − A ( x ) n =0 where � z − 1 � f denotes the coefficient of z − 1 in f . M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 7 / 19

  9. Commutative case Substitutions and Hopf algebra 3/4 Proof Note first that ∞ � a n | φ � x n +1 = φ ( x ) and � A m ( x ) | φ � = φ m ( x ) . � � A ( x ) | φ � = n =0 M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 8 / 19

  10. Commutative case Substitutions and Hopf algebra 3/4 Proof Note first that ∞ � a n | φ � x n +1 = φ ( x ) and � A m ( x ) | φ � = φ m ( x ) . � � A ( x ) | φ � = n =0 Then ∞ ∞ � � � ∆ Dif A ( x ) | φ ⊗ ψ � = � ∆ Dif a n | φ ⊗ ψ � = a n ( φ ◦ ψ ) x n +1 n =0 n =0 � � φ ( z ) 1 = � z − 1 � z − ψ ( x ) = � z − 1 � � A ( z ) | φ �� z − A ( x ) | ψ � M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 8 / 19

  11. Commutative case Substitutions and Hopf algebra 3/4 Proof Note first that ∞ � a n | φ � x n +1 = φ ( x ) and � A m ( x ) | φ � = φ m ( x ) . � � A ( x ) | φ � = n =0 Then ∞ ∞ � � � ∆ Dif A ( x ) | φ ⊗ ψ � = � ∆ Dif a n | φ ⊗ ψ � = a n ( φ ◦ ψ ) x n +1 n =0 n =0 � � φ ( z ) 1 = � z − 1 � z − ψ ( x ) = � z − 1 � � A ( z ) | φ �� z − A ( x ) | ψ � 1 = � z − 1 �� A ( z ) ⊗ z − A ( x ) | φ ⊗ ψ � , ∞ 1 � A ( x ) n z − n − 1 . with z − A ( x ) = n =0 M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 8 / 19

  12. Commutative case Substitutions and Hopf algebra 4/4 Link with the Fa` a di Bruno bi-algebra C ( G dif uni ) is the co-ordinate ring ([Brouder, Fabretti, Krattenthaler]) of the group G dif uni . The Fa` a di Bruno bi-algebra is the co-ordinate ring of the semigroup � ∞ � x n � φ ( x ) = n ! , φ n ∈ C φ n n =1 with φ 1 not necessarily equal to 1. M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 9 / 19

  13. Commutative case Substitutions and Hopf algebra 4/4 Link with the Fa` a di Bruno bi-algebra C ( G dif uni ) is the co-ordinate ring ([Brouder, Fabretti, Krattenthaler]) of the group G dif uni . The Fa` a di Bruno bi-algebra is the co-ordinate ring of the semigroup � ∞ � x n � φ ( x ) = n ! , φ n ∈ C φ n n =1 with φ 1 not necessarily equal to 1. Using the procedure described for C ( G dif uni ), one identifies the Fa` a di Bruno bi-algebra with C [ u 1 , u 2 , . . . ], deg( u n ) = n − 1, with coproduct n n ! u α 1 1 . . . u α n � � n ∆ u n = u k ⊗ 1! α 1 . . . n ! α n α 1 ! . . . α n ! k =1 α ⊢ k P n i =1 i α i = n and counit ǫ ( u n ) = δ n , 0 . M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 9 / 19

  14. Non commutative case Series with coefficient in the Boolean semiring Let B = { 0 , 1 } be the Boolean semiring and let L be a language over the alphabet A . � Characteristic series of the language L : the sum L = w ( ∈ B �� A �� ). w ∈ L If S is a series with coefficients α w ∈ B , S is the characteristic series of the language L = Supp ( α ). M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 10 / 19

  15. Non commutative case Series with coefficient in the Boolean semiring Let B = { 0 , 1 } be the Boolean semiring and let L be a language over the alphabet A . � Characteristic series of the language L : the sum L = w ( ∈ B �� A �� ). w ∈ L If S is a series with coefficients α w ∈ B , S is the characteristic series of the language L = Supp ( α ). The usual operations on languages are represented on their characteristic series as follows : L ∪ M = L + M ; L ∩ M = L ⊙ M where ⊙ denotes the Hadamard product of series; L · M = L · M where in the point in the lhs denotes the concatenation and in the rhs the Cauchy (or concatenation) product of two series. M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 10 / 19

  16. Non commutative case Let A and B be two languages and f : A → P ( B ∗ ). f is called a substitution. f can be extended as a morphism of monoids from ( A ∗ , conc) to ( P ( B ∗ ) , conc) and then as a sum-preserving application from P ( A ∗ ) to P ( B ∗ ) denoted by f : � � ∀ ( L i ) i ∈ I ∈ P ( A ∗ ) , f ( L i ) = f ( L i ) i ∈ I i ∈ I These substitutions are composable : if f : A → P ( B ∗ ) and g : B → P ( C ∗ ), one defines g ◦ f : A → P ( C ∗ ) as the composition g ◦ f : A → P ( B ∗ ) → P ( C ∗ ) . M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 11 / 19

  17. Non commutative case Let A be a finite alphabet and R a commutative ring with a unit. Substitution A substitution is a morphism of algebras from R �� A �� to R �� A �� such that φ ( A ) ⊆ R ≥ 1 �� A �� . Let φ : A → R ≥ 1 �� A �� be a substitution. We extend φ as a morphism of monoids from ( A ∗ , • ) to ( R ≥ 1 �� A �� , × ) where × denotes the Cauchy product : if w = a 1 · · · a n , φ ( w ) = φ ( a 1 ) × · · · × φ ( a n ) . Since A ∗ is a basis of R � A � , we can extend φ as an application from R � A � to R ≥ 1 �� A �� by linearity : � � φ ( S ) = φ ( � S | w � w ) = � S | w � φ ( w ) . w ∈ A ∗ w ∈ A ∗ M. Deneufchˆ atel (LIPN - P13) Substitutions 01/2010 12 / 19

Recommend


More recommend