XS1, XS2, Xa1, Xa2 - Sets, group axioms and examples
A group records a collection of objects together with a way to combine them. XS1 and XS2 make the set and number language precise; Xa1 gives the four group axioms, and Xa2 tests them in arithmetic, complex numbers, matrices and geometric symmetries.
Specify the set before the operation
If multiplication works perfectly for every non-zero rational number, why can adding just one more number destroy the group? The newcomer is zero. To see what goes wrong, we need to specify exactly which objects are allowed.
You already know
Rational numbers are ratios of integers with non-zero denominator. Real numbers include rational and irrational numbers; complex numbers include the reals. Matrix products and compositions act from right to left, and multiplication by a unit complex number rotates the Argand plane.
A set lists objects without counting repetitions or imposing an order: . Membership concerns one object; containment concerns a whole set.
| Notation | Meaning |
|---|---|
| , | is, or is not, an element of . |
| Every element of is in ; equality is allowed. | |
| is a proper subset: and . | |
| Some element of is not in . | |
| The empty set, containing no elements. | |
| , | Elements in at least one set, or in both sets. |
| The complement of in a stated universal set . | |
| Elements in but not in . | |
| $n(A)= | A |
Every set satisfies and . If , then . In particular, and differ: the latter contains one object, the empty set.
Worked example 1: overlapping finite sets
Question. Let , and . Find , and decide whether .
Plan. Test membership against the two lists, using only for the complement.
Why this step? A complement depends on the universal set; a difference such as depends only on the two named sets.
Answer. The four sets are displayed above; .
Check. and ; their sizes are .
Change only to . Its relationship with changes from overlapping to contained.
Worked example 2: a proper subset
Question. With the same and the new , find and . State the subset relationship and .
Plan. Use the fact that every element of the new is already in .
Why this step? also requires ; here establishes that difference.
Answer. , , differences and ; is a proper subset of , with two elements.
Check. .
Set-builder notation gives a rule rather than a finite list. The colon means “such that”. These standard sets will recur throughout the lesson.
| Set | Meaning |
|---|---|
| , | Positive integers; non-negative integers. |
| All integers. | |
| Rational numbers. | |
| , | Real numbers; complex numbers. |
| Positive rational numbers. | |
| Non-negative real numbers. |
Thus ; irrational numbers form . This notation is not printed in the formula booklet.
Watch out
Wrong: for and .
Why: the elements of are numbers; the set is not one of them.
Right: . Every element of belongs to , and the sets differ.
Use membership to compare an object with a set, and containment to compare two sets. The next check asks for the resulting sets themselves.
Reason about rational and irrational results
The sum, difference and product of two rational numbers are rational. Their quotient is rational when the divisor is non-zero. This follows by writing both as fractions and combining integer numerators and denominators.
There is no corresponding rule that two irrational inputs must give an irrational output. Cancellation can change the type of number. Use an argument or an exact example rather than a decimal approximation.
Worked example 3: rational plus irrational
Question. Let and . Prove that is irrational. Explain what happens to when .
Plan. Suppose the result were rational and rearrange to make rational.
Why this step? Rational numbers stay rational under the subtraction and non-zero division used to isolate .
Answer. Both and , for , are irrational. If , the product is the rational number zero.
Check. and fit the result, whereas explains the exception.
Change the rational input to another irrational number. Now neither a rational nor an irrational result is forced.
Worked example 4: two irrational inputs
Question. Give examples showing that the sum of two irrational numbers may be rational or irrational. Do the same for their product.
Plan. Use the known irrational number , arranging cancellation in one case and a non-zero rational multiple in another.
Why this step? is irrational by the first example; both inputs in the last product really are irrational.
Answer. Each outcome is possible, with the exact examples shown.
Check. No assertion depends on rounded digits: the conclusions follow from exact identities and the irrationality of .
These number properties are not printed in the formula booklet. They help with closure: one counterexample disproves a universal claim that an operation always stays in a proposed set.
Watch out
Wrong: , because both inputs are irrational.
Why: irrational inputs can cancel; their types alone do not determine the sum's type.
Right: . Simplify exactly before classifying the result.
For a closure claim, choose inputs from the proposed set and check whether their exact result stays there.
Separate the four group axioms
A binary operation combines an ordered pair of objects into one result. In a group it maps into , so the result stays in the set. The pair specifies both the objects and the operation; changing either can change the answer.
Group
A non-empty set with an operation is a group when all four conditions hold:
| Axiom | Required statement |
|---|---|
| Closure | for every . |
| Associativity | for every . |
| Identity | There is with for every . |
| Inverses | For every , there is with . |
The group is abelian if it is also commutative: for all .
Associativity moves brackets without changing the order of the inputs. Commutativity exchanges inputs. A group need not be abelian. To prove an axiom, use arbitrary elements; one numerical example can disprove an axiom but cannot prove it for every input.
An inverse undoes the stated operation. Under addition the identity is and the inverse of is ; under ordinary multiplication the identity is and a non-zero number's inverse is . Do not transfer either rule blindly to a newly defined operation.
For example, is an infinite abelian group: sums of integers are integers, addition is associative, zero is the identity, and for every integer . A group can equally have finitely many elements. The axioms and this vocabulary are not supplied in the formula booklet.
Test a newly defined operation
Use the operation's definition every time its symbol appears. For a general associativity proof, expand the two bracketings separately, then state their equality and the conclusion. Determine an identity from its defining equation before solving for inverses.
Worked example 5: an unfamiliar identity
Question. On , define . Show that is an abelian group.
Plan. Verify closure and associativity, solve for the identity, then find each element's inverse under this operation.
The two bracketings are equal for all , so is associative. Also , so the operation is commutative. The identity and inverse equations hold in both directions.
Why this step? The inverse must give , not the identity of ordinary multiplication.
Answer. All four axioms hold, and the group is abelian; and under .
Check. The inverse of is , since .
Change only the set by allowing zero: take . This is the opening newcomer.
Worked example 6: one extra element breaks an axiom
Question. Determine whether , with the same rule , is a group.
Plan. Retain the valid closure, associativity and identity arguments, then test the new element against the inverse requirement.
Why this step? The group axiom requires an inverse for every element; zero is one specific element for which no candidate can work.
Answer. It is not a group: zero has no inverse under .
Check. Non-zero elements still have inverses. That does not repair the failed universal requirement.
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account