fbpx
Wikipedia

Symbolic method

In mathematics, the symbolic method in invariant theory is an algorithm developed by Arthur Cayley,[1] Siegfried Heinrich Aronhold,[2] Alfred Clebsch,[3] and Paul Gordan[4] in the 19th century for computing invariants of algebraic forms. It is based on treating the form as if it were a power of a degree one form, which corresponds to embedding a symmetric power of a vector space into the symmetric elements of a tensor product of copies of it.

Symbolic notation edit

The symbolic method uses a compact, but rather confusing and mysterious notation for invariants, depending on the introduction of new symbols a, b, c, ... (from which the symbolic method gets its name) with apparently contradictory properties.

Example: the discriminant of a binary quadratic form edit

These symbols can be explained by the following example from Gordan.[5] Suppose that

 

is a binary quadratic form with an invariant given by the discriminant

 

The symbolic representation of the discriminant is

 

where a and b are the symbols. The meaning of the expression (ab)2 is as follows. First of all, (ab) is a shorthand form for the determinant of a matrix whose rows are a1, a2 and b1, b2, so

 

Squaring this we get

 

Next we pretend that

 

so that

 

and we ignore the fact that this does not seem to make sense if f is not a power of a linear form. Substituting these values gives

 

Higher degrees edit

More generally if

 

is a binary form of higher degree, then one introduces new variables a1, a2, b1, b2, c1, c2, with the properties

 

What this means is that the following two vector spaces are naturally isomorphic:

  • The vector space of homogeneous polynomials in A0,...An of degree m
  • The vector space of polynomials in 2m variables a1, a2, b1, b2, c1, c2, ... that have degree n in each of the m pairs of variables (a1, a2), (b1, b2), (c1, c2), ... and are symmetric under permutations of the m symbols a, b, ....,

The isomorphism is given by mapping anj
1
aj
2
, bnj
1
bj
2
, .... to Aj. This mapping does not preserve products of polynomials.

More variables edit

The extension to a form f in more than two variables x1, x2, x3,... is similar: one introduces symbols a1, a2, a3 and so on with the properties

 

Symmetric products edit

The rather mysterious formalism of the symbolic method corresponds to embedding a symmetric product Sn(V) of a vector space V into a tensor product of n copies of V, as the elements preserved by the action of the symmetric group. In fact this is done twice, because the invariants of degree n of a quantic of degree m are the invariant elements of SnSm(V), which gets embedded into a tensor product of mn copies of V, as the elements invariant under a wreath product of the two symmetric groups. The brackets of the symbolic method are really invariant linear forms on this tensor product, which give invariants of SnSm(V) by restriction.

See also edit

References edit

  • Gordan, Paul (1987) [1887]. Kerschensteiner, Georg (ed.). Vorlesungen über Invariantentheorie (2nd ed.). New York York: AMS Chelsea Publishing. ISBN 9780828403283. MR 0917266.

Footnotes

  1. ^ Cayley, Arthur (1846). "On linear transformations". Cambridge and Dublin Mathematical Journal: 104–122.
  2. ^ Aronhold, Siegfried Heinrich (1858). "Theorie der homogenen Functionen dritten Grades von drei Veränderlichen". Journal für die reine und angewandte Mathematik (in German). 1858 (55): 97–191. doi:10.1515/crll.1858.55.97. ISSN 0075-4102. S2CID 122247157.
  3. ^ Clebsch, A. (1861). "Ueber symbolische Darstellung algebraischer Formen". Journal für die Reine und Angewandte Mathematik (in German). 1861 (59): 1–62. doi:10.1515/crll.1861.59.1. ISSN 0075-4102. S2CID 119389672.
  4. ^ Gordan 1887.
  5. ^ Gordan 1887, v. 2, p.g. 1-3.

Further reading edit

symbolic, method, method, analytic, combinatorics, combinatorics, mathematics, symbolic, method, invariant, theory, algorithm, developed, arthur, cayley, siegfried, heinrich, aronhold, alfred, clebsch, paul, gordan, 19th, century, computing, invariants, algebr. For the method in analytic combinatorics see Symbolic method combinatorics In mathematics the symbolic method in invariant theory is an algorithm developed by Arthur Cayley 1 Siegfried Heinrich Aronhold 2 Alfred Clebsch 3 and Paul Gordan 4 in the 19th century for computing invariants of algebraic forms It is based on treating the form as if it were a power of a degree one form which corresponds to embedding a symmetric power of a vector space into the symmetric elements of a tensor product of copies of it Contents 1 Symbolic notation 1 1 Example the discriminant of a binary quadratic form 1 2 Higher degrees 1 3 More variables 2 Symmetric products 3 See also 4 References 5 Further readingSymbolic notation editThe symbolic method uses a compact but rather confusing and mysterious notation for invariants depending on the introduction of new symbols a b c from which the symbolic method gets its name with apparently contradictory properties Example the discriminant of a binary quadratic form edit These symbols can be explained by the following example from Gordan 5 Suppose that f x A 0 x 1 2 2 A 1 x 1 x 2 A 2 x 2 2 displaystyle displaystyle f x A 0 x 1 2 2A 1 x 1 x 2 A 2 x 2 2 nbsp is a binary quadratic form with an invariant given by the discriminant D A 0 A 2 A 1 2 displaystyle displaystyle Delta A 0 A 2 A 1 2 nbsp The symbolic representation of the discriminant is 2 D a b 2 displaystyle displaystyle 2 Delta ab 2 nbsp where a and b are the symbols The meaning of the expression ab 2 is as follows First of all ab is a shorthand form for the determinant of a matrix whose rows are a1 a2 and b1 b2 so a b a 1 b 2 a 2 b 1 displaystyle displaystyle ab a 1 b 2 a 2 b 1 nbsp Squaring this we get a b 2 a 1 2 b 2 2 2 a 1 a 2 b 1 b 2 a 2 2 b 1 2 displaystyle displaystyle ab 2 a 1 2 b 2 2 2a 1 a 2 b 1 b 2 a 2 2 b 1 2 nbsp Next we pretend that f x a 1 x 1 a 2 x 2 2 b 1 x 1 b 2 x 2 2 displaystyle displaystyle f x a 1 x 1 a 2 x 2 2 b 1 x 1 b 2 x 2 2 nbsp so that A i a 1 2 i a 2 i b 1 2 i b 2 i displaystyle displaystyle A i a 1 2 i a 2 i b 1 2 i b 2 i nbsp and we ignore the fact that this does not seem to make sense if f is not a power of a linear form Substituting these values gives a b 2 A 2 A 0 2 A 1 A 1 A 0 A 2 2 D displaystyle displaystyle ab 2 A 2 A 0 2A 1 A 1 A 0 A 2 2 Delta nbsp Higher degrees edit More generally if f x A 0 x 1 n n 1 A 1 x 1 n 1 x 2 A n x 2 n displaystyle displaystyle f x A 0 x 1 n binom n 1 A 1 x 1 n 1 x 2 cdots A n x 2 n nbsp is a binary form of higher degree then one introduces new variables a1 a2 b1 b2 c1 c2 with the properties f x a 1 x 1 a 2 x 2 n b 1 x 1 b 2 x 2 n c 1 x 1 c 2 x 2 n displaystyle f x a 1 x 1 a 2 x 2 n b 1 x 1 b 2 x 2 n c 1 x 1 c 2 x 2 n cdots nbsp What this means is that the following two vector spaces are naturally isomorphic The vector space of homogeneous polynomials in A0 An of degree m The vector space of polynomials in 2m variables a1 a2 b1 b2 c1 c2 that have degree n in each of the m pairs of variables a1 a2 b1 b2 c1 c2 and are symmetric under permutations of the m symbols a b The isomorphism is given by mapping an j1 aj2 bn j1 bj2 to Aj This mapping does not preserve products of polynomials More variables edit The extension to a form f in more than two variables x1 x2 x3 is similar one introduces symbols a1 a2 a3 and so on with the properties f x a 1 x 1 a 2 x 2 a 3 x 3 n b 1 x 1 b 2 x 2 b 3 x 3 n c 1 x 1 c 2 x 2 c 3 x 3 n displaystyle f x a 1 x 1 a 2 x 2 a 3 x 3 cdots n b 1 x 1 b 2 x 2 b 3 x 3 cdots n c 1 x 1 c 2 x 2 c 3 x 3 cdots n cdots nbsp Symmetric products editThe rather mysterious formalism of the symbolic method corresponds to embedding a symmetric product Sn V of a vector space V into a tensor product of n copies of V as the elements preserved by the action of the symmetric group In fact this is done twice because the invariants of degree n of a quantic of degree m are the invariant elements of SnSm V which gets embedded into a tensor product of mn copies of V as the elements invariant under a wreath product of the two symmetric groups The brackets of the symbolic method are really invariant linear forms on this tensor product which give invariants of SnSm V by restriction See also editUmbral calculusReferences editGordan Paul 1987 1887 Kerschensteiner Georg ed Vorlesungen uber Invariantentheorie 2nd ed New York York AMS Chelsea Publishing ISBN 9780828403283 MR 0917266 Footnotes Cayley Arthur 1846 On linear transformations Cambridge and Dublin Mathematical Journal 104 122 Aronhold Siegfried Heinrich 1858 Theorie der homogenen Functionen dritten Grades von drei Veranderlichen Journal fur die reine und angewandte Mathematik in German 1858 55 97 191 doi 10 1515 crll 1858 55 97 ISSN 0075 4102 S2CID 122247157 Clebsch A 1861 Ueber symbolische Darstellung algebraischer Formen Journal fur die Reine und Angewandte Mathematik in German 1861 59 1 62 doi 10 1515 crll 1861 59 1 ISSN 0075 4102 S2CID 119389672 Gordan 1887 Gordan 1887 v 2 p g 1 3 Further reading editDieudonne Jean Carrell James B 1970 Invariant theory old and new Advances in Mathematics 4 1 80 doi 10 1016 0001 8708 70 90015 0 pp 32 7 Invariants of n ary forms the symbolic method Reprinted as Dieudonne Jean Carrell James B 1971 Invariant theory old and new Academic Press ISBN 0 12 215540 8 Dolgachev Igor 2003 Lectures on invariant theory London Mathematical Society Lecture Note Series Vol 296 Cambridge University Press doi 10 1017 CBO9780511615436 ISBN 978 0 521 52548 0 MR 2004511 S2CID 118144995 Grace John Hilton Young Alfred 1903 The Algebra of invariants Cambridge University Press Hilbert David 1993 1897 Theory of algebraic invariants Cambridge University Press ISBN 9780521444576 MR 1266168 Koh Sebastian S ed 2009 1987 Invariant Theory Lecture Notes in Mathematics Vol 1278 Springer ISBN 9783540183600 Kung Joseph P S Rota Gian Carlo 1984 The invariant theory of binary forms Bulletin of the American Mathematical Society New Series 10 1 27 85 doi 10 1090 S0273 0979 1984 15188 7 ISSN 0002 9904 MR 0722856 Retrieved from https en wikipedia org w index php title Symbolic method amp oldid 1181916848, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.