XS1, XS2, Xa1, Xa2 - Sets, group axioms and examples

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: {1,2,2}={2,1}\{1,2,2\}=\{2,1\}. Membership concerns one object; containment concerns a whole set.

NotationMeaning
x∈Ax\in A, x∉Ax\notin Axx is, or is not, an element of AA.
A⊆BA\subseteq BEvery element of AA is in BB; equality is allowed.
A⊂BA\subset BAA is a proper subset: A⊆BA\subseteq B and A≠BA\ne B.
A⊈BA\nsubseteq BSome element of AA is not in BB.
∅\varnothingThe empty set, containing no elements.
A∪BA\cup B, A∩BA\cap BElements in at least one set, or in both sets.
A′=U∖AA'=U\setminus AThe complement of AA in a stated universal set UU.
A∖BA\setminus BElements in AA but not in BB.
$n(A)=A

Every set satisfies A⊆AA\subseteq A and ∅⊆A\varnothing\subseteq A. If A≠∅A\ne\varnothing, then ∅⊂A\varnothing\subset A. In particular, ∅\varnothing and {∅}\{\varnothing\} differ: the latter contains one object, the empty set.

Worked example 1: overlapping finite sets

Question. Let U={0,1,2,3,4,5,6}U=\{0,1,2,3,4,5,6\}, A={0,2,4,6}A=\{0,2,4,6\} and B={2,3,5}B=\{2,3,5\}. Find A∩B,A∪B,A∖B,A′A\cap B,A\cup B,A\setminus B,A', and decide whether B⊆AB\subseteq A.

Plan. Test membership against the two lists, using UU only for the complement.

A∩B={2}in bothA∪B={0,2,3,4,5,6}in either; no repetitionsA∖B={0,4,6}in A onlyA′={1,3,5}in U but not A3∈B,3∉Aone counterexample to containment\begin{aligned} A\cap B&=\{2\} &&\text{in both}\\ A\cup B&=\{0,2,3,4,5,6\} &&\text{in either; no repetitions}\\ A\setminus B&=\{0,4,6\} &&\text{in }A\text{ only}\\ A'&=\{1,3,5\} &&\text{in }U\text{ but not }A\\ 3&\in B,\quad3\notin A &&\text{one counterexample to containment} \end{aligned}

Why this step? A complement depends on the universal set; a difference such as A∖BA\setminus B depends only on the two named sets.

Answer. The four sets are displayed above; B⊈AB\nsubseteq A.

Check. A∩A′=∅A\cap A'=\varnothing and A∪A′=UA\cup A'=U; their sizes are 4+3=74+3=7.

Change only BB to {2,4}\{2,4\}. Its relationship with AA changes from overlapping to contained.

Worked example 2: a proper subset

Question. With the same U,AU,A and the new BB, find A∩B,A∪B,A∖BA\cap B,A\cup B,A\setminus B and B∖AB\setminus A. State the subset relationship and n(B)n(B).

Plan. Use the fact that every element of the new BB is already in AA.

A∩B={2,4}=Bboth elements are sharedA∪B=Ano new elementsA∖B={0,6},B∖A=∅difference is directionalB⊂A,n(B)=2containment is strict\begin{aligned} A\cap B&=\{2,4\}=B &&\text{both elements are shared}\\ A\cup B&=A &&\text{no new elements}\\ A\setminus B&=\{0,6\},\quad B\setminus A=\varnothing &&\text{difference is directional}\\ B&\subset A,\qquad n(B)=2 &&\text{containment is strict} \end{aligned}

Why this step? B⊂AB\subset A also requires B≠AB\ne A; here 0∈A∖B0\in A\setminus B establishes that difference.

Answer. A∩B=BA\cap B=B, A∪B=AA\cup B=A, differences {0,6}\{0,6\} and ∅\varnothing; BB is a proper subset of AA, with two elements.

Check. n(A∖B)+n(B)=2+2=4=n(A)n(A\setminus B)+n(B)=2+2=4=n(A).

Set-builder notation gives a rule rather than a finite list. The colon means “such that”. These standard sets will recur throughout the lesson.

SetMeaning
N={1,2,3,…}\mathbb N=\{1,2,3,\ldots\}, N0={0,1,2,…}\mathbb N_0=\{0,1,2,\ldots\}Positive integers; non-negative integers.
Z={…,−2,−1,0,1,2,…}\mathbb Z=\{\ldots,-2,-1,0,1,2,\ldots\}All integers.
Q={a/b:a,b∈Z, b≠0}\mathbb Q=\{a/b:a,b\in\mathbb Z,\ b\ne0\}Rational numbers.
R\mathbb R, C\mathbb CReal numbers; complex numbers.
Q+={q∈Q:q>0}\mathbb Q^+=\{q\in\mathbb Q:q>0\}Positive rational numbers.
R0+={x∈R:x≥0}\mathbb R_0^+=\{x\in\mathbb R:x\ge0\}Non-negative real numbers.

Thus N⊂Z⊂Q⊂R⊂C\mathbb N\subset\mathbb Z\subset\mathbb Q\subset\mathbb R\subset\mathbb C; irrational numbers form R∖Q\mathbb R\setminus\mathbb Q. This notation is not printed in the formula booklet.

Watch out

Wrong: B∈AB\in A for B={2,4}B=\{2,4\} and A={0,2,4,6}A=\{0,2,4,6\}.

Why: the elements of AA are numbers; the set BB is not one of them.

Right: B⊂AB\subset A. Every element of BB belongs to AA, 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 r∈Qr\in\mathbb Q and x∈R∖Qx\in\mathbb R\setminus\mathbb Q. Prove that r+xr+x is irrational. Explain what happens to rxrx when r≠0r\ne0.

Plan. Suppose the result were rational and rearrange to make xx rational.

r+x=q∈Q ⟹ x=q−r∈Qcontradictionrx=q∈Q,r≠0 ⟹ x=q/r∈Qcontradiction\begin{aligned} r+x=q\in\mathbb Q&\ \Longrightarrow\ x=q-r\in\mathbb Q &&\text{contradiction}\\ rx=q\in\mathbb Q,\quad r\ne0&\ \Longrightarrow\ x=q/r\in\mathbb Q &&\text{contradiction} \end{aligned}

Why this step? Rational numbers stay rational under the subtraction and non-zero division used to isolate xx.

Answer. Both r+xr+x and rxrx, for r≠0r\ne0, are irrational. If r=0r=0, the product is the rational number zero.

Check. 3+23+\sqrt2 and 323\sqrt2 fit the result, whereas 02=00\sqrt2=0 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 2\sqrt2, arranging cancellation in one case and a non-zero rational multiple in another.

2+(−2)=0rational sum2+2=22irrational sum by the preceding result2 2=2rational product2(1+2)=2+2irrational product\begin{aligned} \sqrt2+(-\sqrt2)&=0 &&\text{rational sum}\\ \sqrt2+\sqrt2&=2\sqrt2 &&\text{irrational sum by the preceding result}\\ \sqrt2\,\sqrt2&=2 &&\text{rational product}\\ \sqrt2(1+\sqrt2)&=\sqrt2+2 &&\text{irrational product} \end{aligned}

Why this step? 1+21+\sqrt2 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 2\sqrt2.

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: 2+(−2)∉Q\sqrt2+(-\sqrt2)\notin\mathbb Q, because both inputs are irrational.

Why: irrational inputs can cancel; their types alone do not determine the sum's type.

Right: 2+(−2)=0∈Q\sqrt2+(-\sqrt2)=0\in\mathbb Q. 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 G×GG\times G into GG, so the result stays in the set. The pair (G,∘)(G,\circ) specifies both the objects and the operation; changing either can change the answer.

Group

A non-empty set GG with an operation ∘\circ is a group when all four conditions hold:

AxiomRequired statement
Closurea∘b∈Ga\circ b\in G for every a,b∈Ga,b\in G.
Associativity(a∘b)∘c=a∘(b∘c)(a\circ b)\circ c=a\circ(b\circ c) for every a,b,c∈Ga,b,c\in G.
IdentityThere is e∈Ge\in G with e∘a=a∘e=ae\circ a=a\circ e=a for every a∈Ga\in G.
InversesFor every a∈Ga\in G, there is a−1∈Ga^{-1}\in G with a∘a−1=a−1∘a=ea\circ a^{-1}=a^{-1}\circ a=e.

The group is abelian if it is also commutative: a∘b=b∘aa\circ b=b\circ a for all a,b∈Ga,b\in G.

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 00 and the inverse of aa is −a-a; under ordinary multiplication the identity is 11 and a non-zero number's inverse is 1/a1/a. Do not transfer either rule blindly to a newly defined operation.

For example, (Z,+)(\mathbb Z,+) is an infinite abelian group: sums of integers are integers, addition is associative, zero is the identity, and −a∈Z-a\in\mathbb Z for every integer aa. 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 G=Q∖{0}G=\mathbb Q\setminus\{0\}, define a∘b=2aba\circ b=2ab. Show that (G,∘)(G,\circ) is an abelian group.

Plan. Verify closure and associativity, solve for the identity, then find each element's inverse under this operation.

a,b∈G ⟹ 2ab∈Q∖{0}closure(a∘b)∘c=2(2ab)c=4abcfirst bracketinga∘(b∘c)=2a(2bc)=4abcsecond bracketing2ae=a(a≠0) ⟹ e=12identity equation2ab=12 ⟹ b=14a∈Ginverse equation\begin{aligned} a,b\in G&\ \Longrightarrow\ 2ab\in\mathbb Q\setminus\{0\} &&\text{closure}\\ (a\circ b)\circ c&=2(2ab)c=4abc &&\text{first bracketing}\\ a\circ(b\circ c)&=2a(2bc)=4abc &&\text{second bracketing}\\ 2ae=a\quad(a\ne0)&\ \Longrightarrow\ e=\tfrac12 &&\text{identity equation}\\ 2ab=\tfrac12&\ \Longrightarrow\ b=\frac1{4a}\in G &&\text{inverse equation} \end{aligned}

The two bracketings are equal for all a,b,c∈Ga,b,c\in G, so ∘\circ is associative. Also 2ab=2ba2ab=2ba, so the operation is commutative. The identity and inverse equations hold in both directions.

Why this step? The inverse must give e=1/2e=1/2, not the identity of ordinary multiplication.

Answer. All four axioms hold, and the group is abelian; e=1/2e=1/2 and a−1=1/(4a)a^{-1}=1/(4a) under ∘\circ.

Check. The inverse of 22 is 1/81/8, since 2∘(1/8)=2(2)(1/8)=1/22\circ(1/8)=2(2)(1/8)=1/2.

Change only the set by allowing zero: take G=QG=\mathbb Q. This is the opening newcomer.

Worked example 6: one extra element breaks an axiom

Question. Determine whether (Q,∘)(\mathbb Q,\circ), with the same rule a∘b=2aba\circ b=2ab, is a group.

Plan. Retain the valid closure, associativity and identity arguments, then test the new element against the inverse requirement.

2ab∈Qclosure still holds(a∘b)∘c=4abc=a∘(b∘c)associativity still holdsa∘12=a=12∘aidentity is still 120∘b=2(0)b=0≠12for every b∈Q\begin{aligned} 2ab&\in\mathbb Q &&\text{closure still holds}\\ (a\circ b)\circ c&=4abc=a\circ(b\circ c) &&\text{associativity still holds}\\ a\circ\tfrac12&=a=\tfrac12\circ a &&\text{identity is still }\tfrac12\\ 0\circ b&=2(0)b=0\ne\tfrac12 &&\text{for every }b\in\mathbb Q \end{aligned}

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 ∘\circ.

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