Symbolic Method Of Invariant Theory

In mathematics, the symbolic method in invariant theory is a highly formal algorithm developed in the 19th century for computing form invariantsinvariants of algebraic forms. It is based on repeated applications of the "Cayley Omega process" (which involves symbolic partial differentiation -- hence the name) to increase the number of variables of a homogeneous form while decreasing the degree. By clever mathematics, the invariant of the form is then reduced to a vector invariant of many dependent variables, most of which then cancel out. In the classical 19th century definition, a form invariant is a function of the coefficients of a (usually binary) form. It is invariant if it remains the same under any transformation in the transformation group in question. The simplest classic examples of form invariants are the trace and discriminant of conic sections. These are functions of the coefficients of the general conic,
ax2 + bxy + cy2 + dx + ey = 0.
The transformation group is the group of translations, reflections and rotations.

References

  • Koh, Invariant Theory
  • Weyl, The Classical Groups

 

<< PreviousWord BrowserNext >>
extrinsic value
dotted note
hawkesbury, ontario
joyce
hundred twenty eighth note
"nature boy" buddy rogers
riva 128
theodore davie
john n. little
riva tnt
okapi wildlife reserve
number nine
whopper
mad libs
hawkwind (album)
riva tnt2
lactid acid bacteria
robert moses state park thousand islands
jacques cartier state park
kring point state park
yamcha
ovadia yosef
cedar island state park
graham farmer
wellesley island state park
burnt over district
economic materialism
canoe picnic point state park
rice milk
small pieces loosely joined
southwick beach state park
hasan paksoy
the yards
selkirk shores state park
fair haven beach state park
polyheme
chimney bluffs state park
georgia national rugby union team
1936 in aviation
long point state park finger lakes
kim polese
rogers cup
1938 in aviation
hudson river islands state park