**Reference:** **Higher Algebra by Bernard and Child.**

**I. Symmetric Functions. **

A function which is unaltered by the interchange of any two of the variables which it contains is said to be **symmetric with respect to (wrt) these two** variables.

Thus, and are symmetrical w.r.t. x, y, z.

The interchange of any two letters, x, y, z is called the transposition (xy).

Terms of an expression which are such that one can be changed into the other by one or more transpositions are said to be of the** same type.** Thus, all the terms of are of the same type, and the expression is symmetric with respect to x, y, z.

A symmetric function which is the sum of a number of terms of the same type is often written in an abbreviated form thus: Choose any one of the terms and place the letter (sigma) before it. For instance:

is represented by and by .

Again, .

**It is obvious that**

**(i) if a term of some particular type occurs in a symmetric function, then all terms of the same type will also occur.**

**(ii) The sum, difference, product and quotient of two symmetric functions are also symmetric functions.**

(PS: there is no need for a grand proof of the above; just apply the definitions of symmetric functions…check with some examples).

Considerations of symmetry greatly facilitate many algebraical processes as illustrated in the following examples:

**Example 1**: Expand .

**Solution 1:**

This expression is symmetric, homogeneous and of the third degree in x, y, z We may therefore assume that

, where a, b, c are independent of x, y, z. In this assumed identity:

(i) put , then

(ii) put , then , and so .

(iii) put , then and so .

Hence, the required product is .

**Example 2**: Expand . Test the result by putting .

**Solution 2**: the product is the sum of all terms of the product obtained by multiplying any one term of the first expression by any other term of the second expression. Hence, the result will have terms of the type : ,

The coefficient of in the product is 1; because this term is obtained as product of a and ab and in no other way.

The coefficient of abc is 3; because this term is obtained in each of the three ways .

Hence, the required answer is

Test: The number of terms of the type is 12 and the number of terms of the type abc is 4; hence, if , then and so that the test is satisfied.

**Example 3: **

Factorize .

**Solution 3:**

**Method I: **Brute force is really difficult (I did give it a shot …:-))

**Method II; **Some of you might try the binomial theorem for positive integral index, but to extract the factors is still ..a little bit like brute force method only.

**Method III:**

Check whether the given expression is symmetric wrt any two variables (namely, x & y; y & z; z & x; ) and whether it is homogeneous and if so, what is the degree. Also from observations of past solved problems, we need to check how many terms of each type are there:

Observations are as follows: the degree of the expression is five only; and the expression is also homogeneous with each term being of degree five; to check for symmetry, let us proceed as follows:

and switching x and y gives us . Quite clearly, the expression is symmetric w.r.t. x and y; y and z; and, z and x.

To factorize it, we use fundamental theorem of algebra or factor or remainder theorem. Substitute so that the expression is equal to so that is a factor of the expression. Similarly, the other factors are and . By the fundamental theorem of algebra, we still need a quadratic factor of x, y and z. This factor should be homogeneous also. Hence, let

, where A and B are pure numeric coefficients independent of x, y and z.

So, put , then and put , then so that .

So, .

**II Alternating Functions:**

If a function E of x, y, z …is transformed into -E by the interchange of any two of the set x, y, z, …, then E is called an alternating function of x, y, z…(Note that just as in the case of symmetric functions, we talk of alternating functions w.r.t. a pair of variables at a time.)

**((PS: **At this juncture, it behooves you to recall the definitions of even and odd functions, and also to recall the fact that every function can be expressed as a sum of an even function and an odd function. Compare all three now: symmetric, alternating and even/odd functions. ))

Such an alternating function is ; for, the interchange of any two letters, say x and y, transforms it into

.

* Observe that the product and the quotient of two alternating functions are symmetric functions. *(here, again, it does not require any grand proof…just pore over the definitions in your head…)

Thus, is symmetric w.r.t. x, y, and z. (PS: please do some scribbling and verify this little observation/fact).

**Example 1:**

Factorize : .

**Solution 1: **

Let

We know that when , and . Hence, the following is a factor of E: . As the given expression E is homogeneous of degree 4, it should have one more homogeneous linear factor. The only such factor possible is . So, now,

. To find K, the numerical coefficient independent of x, y, z, let us equate the coefficient of on each side; then, . (Alternatively, we could have substituted some numerical values for x, y, z and found K as it is an identity.)

Hence, .

**III. Cyclic Expressions:**

An algebraic expression is said to be cyclic with respect to the letters a, b, c, d, …, h, k * arranged in this order *when it remains the same if we replace a by b, b by c, c by d, …., h by k, and k by a.

This “cycle of interchange of letters” is called the cyclic substitution denoted by .

(PS this reminds you of the the right hand unit vectors i, j, k and their cross products).

Thus, the expression is cyclic with respect to a, b, c, and d *(in this order** only**)* because the cyclic substitution changes the first term to the second term, the second term to the third term and the fourth term to the first term.

It is clear that:

(i) If a term of some particular type occurs in a cyclic expression, then the term which can be derived from this by the cyclic interchange, must also occur; and, the coefficients of these terms must be equal.

(ii) The sum, difference, product and quotient of two cyclic expressions is also cyclic.

In writing a cyclic expression, it is unnecessary to write the whole expression or all the terms explicitly. Thus, instead of writing the full it suffices just to abbreviate it as . (Please note that the use of here has a different meaning than earlier.)

Sometimes, it is also written in short as .

**We need to be familiar with the following important basic cyclic identities:**

- .
- .
- .
- .
- .
- .

Note that identity 9 can be proved by at least three non-trivial ways 🙂

PS again :-)) It helps to prove the above identities from LHS to RHS and also from RHS to LHS !!

it will be proved later that

i) Any symmetric function of can be expressed in terms of , and .

ii) Any symmetric function of can be expressed in terms of , , , and .

In the above two cases, the notation is used in the sense of a symmetric function.

This mode of expression is extremely useful in factorizing symmetric functions, and in proving identities:

**Example 1:**

Factorize .

**Solution 1:**

PS: Comment: this is not easy. But, go through it and there is ample scope to improve via exercises in the next blog 🙂

Denoting the given expression by E, we have

, but from identity 7 above, we see that ;

Hence, we get

So, .

**IV. Substitutiions:**

We consider processes by which one arrangement (permutation) of a set of elements may be transformed into another:

Taking the permutations of a, b, c, d, the first is changed into the second by replacing a by c, b by a, c by b and leaving a unaltered. This process is represented by the **operator**

or

and, we write .

*Such a process and also the operator which affects it is called a* **substitution.**

As previously stated, the interchange of two elements a, b is called the * transposition *.

Also, a substitution such as in which each letter is replaced by the one immediately following it and the last by the first, is called a * cyclic substitution or cycle*, and is denoted by .

If two operators are connected by the sign =, the meaning is that one is equivalent to the other, thus .

Two or more substitutioins may be applied successively. This is indicated as follows, the *order of operations being from right to left.*

Let , , then and . Thus, and

This process is called * multiplication of substitutions, *and the resulting substitution is called the

**product.**Multiplication of this kind is not necessarily commutative, but if the substitutions have no common letter, it is commutative.

The operation indicated by , in which is performed twice, produces no change in the order of the letters, and is called an **identical substitution.**

Any substituion is cyclic or is the product of two or more cyclic substitutions which have no common element. As an instance, consider the substitution

Here, a is changed to c, c to f, f to a, thus completing the cycle . Also, b is changed to h, h to d, d to b, making the cycle . Next, c is changed to g, and g to e, giving the cycle . The element k is unchanged, and we write

or .

This expression for S in unique, and the order of the factors is indifferent. Moreover, the method applies universally, for in effecting any substitution, we must arrive at a stage when some letter is replaced by the first, thus completing a cycle. The same argument applies to the set of letters not contained in the cycle.

A cyclic substitution of n elements is the product of transpositions:

Consider

, , , and so on.

We also have equalities such as : and .

A substitution which deranges n letters and which is the product of r cycles is equivalent to transpositions.

This follows at once from our previous work. Thus, if , then

.

If we introduce the product , S is unaltered and the number of transpositions is increased by 2.

Thus, if a given substitutition is equivalent to j transpositions, the number j is not unique. We shall prove that : where r is a positive integer or zero.

**This is a very important theorem, and to prove it we introduce the notion of “inversions.”**

*** Taking the elements a, b, c, d, e choose some arrangement, as , and call it a *normal arrangement.*

Consider the arrangement . Here b precedes a, but follows it in the normal arrangement. On this account, we say that the pair ba constitutes an **inversion. **

Thus, contains five inversions, namely, .

**Theorem 1:**

If i is the number of inversions which are introduced or removed by a substitution which is equivalent to j transpositions, then i and j are both even or both odd.

**Proof of theorem 1:**

Consider the effect of a single transposition .

If f, g are consecutive elements, the transposition does not alter the position of f or g relative to the other elements. It therefore introduces or removes a single inversion due to the interchange of f, g.

If f, g are separated by n elements p, q, r, …, x, then f can be moved to the place occupied by g by interchanges of consecutive elements, and then g can be moved to the place originally occupied by f by n such interchanges.

Thus, the transposition can be effected by interchanges of consecutive elements. Therefore, any transposition introduces or removes an odd number of inversions, and the theorem follows. QED.

Again, for a given substitution, i is a fixed number, and therefore whatever value j may have, it must be even or odd, according as i is even or odd. Hence, we get the following:

**Theorem 2:**

If one arrangement A of a given set of elements is changed into another B by j transpositions, then j is always even or always odd. In other words: the number of transpositions which are equivalent to a given substitution is not unique, but is always even or always odd.

The minimum value of j is .

Thus, substitutions may be divided into two distinct classes. We say that a substitution is even or odd according as it is equivalent to an even or an odd number of transpositions.

Rule:

To determine the class of a substitution S we may express it as the product of cycles, and count the number of cycles with an even number of elements: then S is even or odd according as this number is even or odd.

Or, we can settle the question by counting the number of inversions, but this generally takes longer.

The tutorial exercises follow this blog.

Cheers,

Nalin Pithwa