form of infinite order. In this case the ground forms, called also perpetuants, have been enumerated and actual representative seminvariant forms established. Putting equal to ∞, in a generating function obtained above, we find that the function, which enumerates the asyzygetic seminvariants of degree , is
that is to say, of the weight , we have one form corresponding to each non-unitary partition of into the parts 2, 3, 4,.... The extraordinary advantage of the transformation of to association with non-unitary symmetric functions is now apparent; for we may take, as representative forms, the symmetric functions which are symbolically denoted by the partitions referred to. Ex. gr., of degree 3 weight 8, we have the two forms , . If we wish merely to enumerate those whose partitions contain the figure , and do not therefore contain any power of as a factor, we have the generator
.
If , every form is obviously a ground form or perpetuant, and the series of forms is denoted by . Similarly, if , every form is a perpetuant. For these two cases the perpetuants are enumerated by
,
and
respectively.
When it is clear that no form, whose partition contains a part 3, can be reduced; but every form, whose partition is composed of the parts 4 and 2, is by elementary algebra reducible by means of perpetuants of degree 2. These latter forms are enumerated by ; hence the generator of quartic perpetuants must be
;
and the general form of perpetuants is .
When , the reducible forms are connected by syzygies which there is some difficulty in enumerating. Sylvester, Cayley and MacMahon succeeded, by a laborious process, in establishing the generators for , and , viz.:
,
;
but the true method of procedure is that of Stroh which we are about to explain.
Method of Stroh.—In the section on “Algebraic Forms” , it was noted that Stroh considers
,
where and symbolically, to be the fundamental form of seminvariant of degree and weight ; he observes that every form of this degree and weight is a linear function of such symbolic expressions. We may write
.
If we expand the symbolic expression by the multinomial theorem, and remember that any symbolic product
retains the same value, however the suffixes be permuted, we shall obtain a sum of terms, such as
,
which in real form is
;
and, if we express
in terms of , and arrange the whole as a linear function of products of , each coefficient will be a seminvariant, and the aggregate of the coefficients will give us the complete asyzygetic system of the given degree and weight.
When the proper degree is < a factor must be of course understood.
Ex. gr.
.
In general the coefficient, of any product , will have, as coefficient, a seminvariant which, when expressed by partitions, will have as leading partition (preceding in dictionary order all others) the partition . Now the symbolic expression of the seminvariant can be expanded by the binomial theorem so as to be exhibited as a sum of products of seminvariants, of lower degrees if can be broken up into any two portions
such that , for then
and each portion raised to any power denotes a seminvariant.
Stroh assumes that every reducible seminvariant can in this way be reduced. The existence of such a relation, as , necessitates the vanishing of a certain function of the coefficients , and as a consequence one product of these coefficients can be eliminated from the expanding form and no seminvariant, which appears as a coefficient to such a product (which may be the whole or only a part of the complete product, with which the seminvariant is associated), will be capable of reduction.
Ex. gr. for , ; either or will vanish if ; but every term, in the development, is of the form and therefore vanishes; so that none are left to undergo reduction. Therefore every form of degree 2, except of course that one whose weight is zero, is a perpetuant. The generating function is .
For , ; the condition is clearly , and since every seminvariant, of proper degree 3, is associated, as coefficient, with a product containing , all such are perpetuants.
The general form is and the generating function .
For , ; the condition is
.
Hence every product of , , , , which contains the product disappears before reduction; this means that every seminvariant, whose partition contains the parts 4, 3, is a perpetuant. The general form of perpetuant is and the generating function
.
In general when is even and , the condition is
;
and we can determine the lowest weight of a perpetuant; the degree in the quantities is
.
Again, if is uneven , the condition is
;
and the degree, in the quantities , is
.
Hence the lowest weight of a perpetuant is , when is >2. The generating function is thus
.
The actual form of a perpetuant of degree has been shown by MacMahon to be
,
being given any zero or positive integer values.
Simultaneous Seminvariants of two Binary Forms.—Taking the two forms to be
, ,
every leading coefficient of a simultaneous covariant vanishes by the operation of
.
Observe that we may employ the principle of suffix diminution to obtain from any seminvariant one appertaining to a and a , and that suffix augmentation produces a portion of a higher seminvariant, the degree in each case remaining unaltered. Remark, too, that we are in association with non-unitary symmetric functions of two systems of quantities which will be denoted by partitions in brackets , respectively. Solving the equation
,
by the ordinary theory of linear partial differential equations, we obtain independent solutions, of which appertain to , ; the remaining one is , the leading coefficient of the Jacobian of the two forms. This constitutes an algebraically complete system, and, in terms of its members, all seminvariants can be rationally expressed. A similar theorem holds in the case of any number of binary forms, the mixed seminvariants being derived from the Jacobians of the several pairs of forms. If the seminvariant be of degree in the coefficients, the forms of orders respectively, and the weight , the degree of the covariant in the variables will be , an easy generalization of the theorem connected with a single form.