Quiz: Groups, Rings, and Fields — 23 questions

Detailed questions and answers

1. Which condition makes a binary operation an internal composition law on a set E?

It maps pairs from any set into a larger containing set
It maps every element of E to a pair in E × E
It assigns each element of E a distinct element of E
It maps every pair in E × E to an element of E

It maps every pair in E × E to an element of E

Explanation

An internal composition law is a function from E × E into E, so combining any two elements of E produces an element that remains in E. A general binary operation need not preserve the chosen set E.

2. Why is composition an internal composition law for functions from E to E?

The composition is defined only when the two functions have different domains
The composition of two functions from E to E always produces a constant function
The composition of two functions from E to E is another function from E to E
The composition reverses the domain and codomain of both original functions

The composition of two functions from E to E is another function from E to E

Explanation

Applying one function from E to E after another still maps E into E, so the result belongs to the same set of functions. Producing a constant function is not required, and composition does not reverse domains and codomains.

3. Which equation expresses that an internal law * is commutative?

x∗y=y∗x=ex*y=y*x=e
a∗b=b∗aa*b=b*a
e∗x=x∗e=xe*x=x*e=x
(a∗b)∗c=a∗(b∗c)(a*b)*c=a*(b*c)

$$a*b=b*a$$

Explanation

Commutativity means that exchanging the two operands does not change the result, expressed by a∗b=b∗aa*b=b*a. The equation involving parentheses defines associativity, while the other equations describe identity and inverse relationships.

4. Which property allows the parentheses to be changed in a product without changing its value?

Inverses, expressed as x∗y=y∗x=ex*y=y*x=e
Identity, expressed as e∗x=x∗e=xe*x=x*e=x
Associativity, expressed as (a∗b)∗c=a∗(b∗c)(a*b)*c=a*(b*c)
Commutativity, expressed as a∗b=b∗aa*b=b*a

Associativity, expressed as $$(a*b)*c=a*(b*c)$$

Explanation

Associativity concerns the placement of parentheses, so it permits the regrouping shown in (a∗b)∗c=a∗(b∗c)(a*b)*c=a*(b*c). Commutativity instead concerns changing the order of operands.

5. What must an element e satisfy to be an identity element for an internal law *?

It must satisfy e∗x=x∗ee*x=x*e for at least one x in E
It must satisfy e∗x=x−1∗ee*x=x^{-1}*e for every x in E
It must satisfy e∗x=x∗e=xe*x=x*e=x for every x in E
It must satisfy e∗x=x∗e=ee*x=x*e=e for every x in E

It must satisfy $$e*x=x*e=x$$ for every x in E

Explanation

An identity leaves every element unchanged when placed on either side, so e∗x=x∗e=xe*x=x*e=x for every x in E. Returning e or merely commuting with selected elements does not establish the identity property.

6. If e is the identity for *, what condition makes y an inverse of x?

It satisfies x∗y=y∗x=ex*y=y*x=e
It satisfies x∗y=e∗x=xx*y=e*x=x
It satisfies x∗y=y∗x=xx*y=y*x=x
It satisfies x∗y=y∗x=yx*y=y*x=y

It satisfies $$x*y=y*x=e$$

Explanation

An inverse combines with the original element on either side to produce the identity, giving x∗y=y∗x=ex*y=y*x=e. Producing x or y instead describes neither the inverse condition nor the identity requirement.

7. Which collection of properties defines a group?

An internal law that is associative, lacks an identity, and gives some elements inverses
An internal law that is distributive, has an identity, and contains finitely many elements
An internal law that is associative, has an identity, and gives every element an inverse
An internal law that is commutative, has an identity, and contains a zero element

An internal law that is associative, has an identity, and gives every element an inverse

Explanation

A group requires closure under an internal law, associativity, an identity element, and an inverse for every element. Commutativity and finiteness are not required, and inverses cannot be restricted to only some elements.

8. When is a group called an abelian group?

When its operation is also commutative
When every element has two distinct inverses
When its operation is associative but has no identity
When its underlying set contains only real numbers

When its operation is also commutative

Explanation

An abelian group is a group whose operation additionally satisfies commutativity. Associativity and an identity are already group requirements, while the type of elements does not determine whether a group is abelian.

9. Which statement correctly classifies the following structures under their indicated operations?

$(ℕ,+)$ is not a group, while $(ℤ,+)$ and $(ℚ^*,\times)$ are groups
$(ℕ,+)$ is a group, while $(ℤ,+)$ and $(ℚ^*,\times)$ are not groups
$(ℕ,+)$ is not a group, while $(ℤ,+)$ is not a group and $(ℚ^*,\times)$ is a group
$(ℕ,+)$ and $(ℤ,+)$ are groups, while $(ℚ^*,\times)$ is not a group

$(ℕ,+)$ is not a group, while $(ℤ,+)$ and $(ℚ^*,\times)$ are groups

Explanation

Natural numbers under addition lack additive inverses for nonzero elements, whereas integers under addition have additive inverses and nonzero rationals under multiplication have multiplicative inverses. Therefore the stated classification follows from the inverse requirement for groups.

10. Which statement correctly describes identity and inverse elements in a group?

The group has one identity, and each element has its own unique inverse.
Each element has one identity, and the group has several possible inverses.
The group has one inverse, and each element may have several identities.
Every element shares one inverse, while the identity depends on the element.

The group has one identity, and each element has its own unique inverse.

Explanation

A group has a unique identity element, and every particular element has a unique inverse. The inverse is associated with the chosen element, so it is not one common element for the entire group.

11. For elements x and y in a group, which expression gives the inverse of their product?

x−1∗y−1x^{-1}*y^{-1}
y−1∗x−1y^{-1}*x^{-1}
y∗x−1y*x^{-1}
x∗y−1x*y^{-1}

$$y^{-1}*x^{-1}$$

Explanation

Taking the inverse of a product reverses the order, giving (x∗y)−1=y−1∗x−1(x*y)^{-1}=y^{-1}*x^{-1}. The expression x−1∗y−1x^{-1}*y^{-1} generally has the factors in the wrong order.

12. In a group, what is the unique solution of the equation a∗x=ba*x=b?

a−1∗ba^{-1}*b
a∗b−1a*b^{-1}
b−1∗ab^{-1}*a
b∗a−1b*a^{-1}

$$a^{-1}*b$$

Explanation

Left-multiplying the equation by a−1a^{-1} gives x=a−1∗bx=a^{-1}*b. The other expressions do not follow from isolating x on the left in a potentially noncommutative group.

13. Which condition makes a subset H of a group G a subgroup?

H contains at least one element and is closed under the group operation but not necessarily inverses.
H contains the identity and inverses, but products of elements may lie outside H.
H contains products of elements, while the identity and inverses may belong to G outside H.
H contains the identity, is closed under inverses, and is closed under the group operation.

H contains the identity, is closed under inverses, and is closed under the group operation.

Explanation

A subgroup must contain the identity of G, contain the inverse of each of its elements, and remain closed under the group operation. Closure under products alone does not ensure that H has the required subgroup structure.

14. What property distinguishes a group morphism f from an arbitrary function between groups?

It maps every source element to the identity element of the target group.
It preserves the group operation: f(x∗y)=f(x)∙f(y)f(x*y)=f(x)\bullet f(y) for all x and y.
It preserves inverses but need not preserve products of source elements.
It assigns a different target element to every source element, regardless of the group operation.

It preserves the group operation: $$f(x*y)=f(x)\bullet f(y)$$ for all x and y.

Explanation

A group morphism preserves multiplication through the relation f(x∗y)=f(x)∙f(y)f(x*y)=f(x)\bullet f(y). An arbitrary function can fail to respect products, even if it is defined between the same two groups.

15. Which description correctly distinguishes an endomorphism, an automorphism, and an isomorphism?

An endomorphism is always bijective; an automorphism maps two different groups; an isomorphism maps a group to itself.
An endomorphism maps two different groups; an automorphism need not be bijective; an isomorphism is any operation-preserving function.
An endomorphism is an inverse map; an automorphism is any morphism; an isomorphism is a morphism from a group to itself.
An endomorphism maps a group to itself; an automorphism is a bijective endomorphism; an isomorphism is a bijective morphism between groups.

An endomorphism maps a group to itself; an automorphism is a bijective endomorphism; an isomorphism is a bijective morphism between groups.

Explanation

An endomorphism has the same group as its source and target, an automorphism is a bijective endomorphism, and an isomorphism is a bijective morphism between groups. Thus an isomorphism can connect distinct groups, unlike an endomorphism.

16. If f is a group morphism and x is an element of its source group, which identity must hold?

f(x−1)=f(x−1)−1f(x^{-1})=f(x^{-1})^{-1}
f(x−1)=f(x)f(x^{-1})=f(x)
f(x−1)=f(x)−1f(x^{-1})=f(x)^{-1}
f(x−1)=f(x)∗f(x)f(x^{-1})=f(x)*f(x)

$$f(x^{-1})=f(x)^{-1}$$

Explanation

A morphism sends inverses to inverses, so f(x−1)=f(x)−1f(x^{-1})=f(x)^{-1}. This follows because applying f to the relation x∗x−1=ex*x^{-1}=e produces the identity in the target group.

17. For a morphism f:G1→G2f:G_1\to G_2, where does the kernel lie and how is it defined?

It is a subset of G2G_2 consisting of elements attained by f.
It is a subset of G1G_1 consisting of elements mapped to arbitrary elements of G2G_2.
It is a subset of G1G_1 consisting of elements mapped to e2e_2.
It is a subset of G2G_2 consisting of elements mapped to the identity of G1G_1.

It is a subset of $$G_1$$ consisting of elements mapped to $$e_2$$.

Explanation

The kernel is Ker⁡f={x∈G1∣f(x)=e2}\operatorname{Ker}f=\{x\in G_1\mid f(x)=e_2\}, so it contains source elements whose images are the target identity. The image, in contrast, is made of attained elements in the target group.

18. For a morphism f:G1→G2f:G_1\to G_2, which set is its image?

The target elements that have no preimage in G1G_1.
The source elements sent to the identity element of G2G_2.
The target elements attained as f(x)f(x) for some x∈G1x\in G_1.
The source elements that remain unchanged under the group operation.

The target elements attained as $$f(x)$$ for some $$x\in G_1$$.

Explanation

The image is Im⁡f={y∈G2∣∃x∈G1, y=f(x)}\operatorname{Im}f=\{y\in G_2\mid \exists x\in G_1,\,y=f(x)\}, so it consists of target elements actually reached by f. Source elements mapped to the target identity form the kernel instead.

19. When is a group morphism f injective?

When its kernel equals the whole source group G1G_1.
When its kernel is the trivial subgroup {e1}\{e_1\}.
When its image contains the target identity but not other target elements.
When its image is the whole target group G2G_2.

When its kernel is the trivial subgroup $$\{e_1\}$$.

Explanation

A group morphism is injective exactly when the only source element mapped to the target identity is the source identity, so Ker⁡f={e1}\operatorname{Ker}f=\{e_1\}. Having image equal to G2G_2 characterizes surjectivity rather than injectivity.

20. Which combination of properties defines a ring with identity?

Multiplication forms an abelian group, addition is associative and distributive, and addition has an identity
Both operations form abelian groups, and each operation is distributive over the other
Addition forms an abelian group, multiplication is associative and distributive, and multiplication has an identity
Addition forms a group, multiplication is commutative, and every element has a multiplicative inverse

Addition forms an abelian group, multiplication is associative and distributive, and multiplication has an identity

Explanation

A ring requires an abelian additive group, associative multiplication, distributive laws, and a multiplicative identity. Multiplication need not form a group, so requiring multiplicative inverses would impose a stronger structure.

21. Which equation correctly expresses the distributive law for multiplication in a ring?

(x+y)×z=x×(y×z)(x+y)\times z=x\times(y\times z)
x+(y×z)=(x+y)×(x+z)x+(y\times z)=(x+y)\times(x+z)
x×(y×z)=(x×y)×zx\times(y\times z)=(x\times y)\times z
x×(y+z)=x×y+x×zx\times(y+z)=x\times y+x\times z

$$x\times(y+z)=x\times y+x\times z$$

Explanation

Distributivity connects multiplication with addition by expanding a product over a sum. The second equation describes associativity of multiplication, not distributivity.

22. For an arbitrary element aa in a ring, what is the value of a×0a\times0?

00
−a-a
11
aa

$$0$$

Explanation

Multiplication by the additive identity produces the additive identity, so a×0=0a\times0=0 in every ring. Multiplication by the multiplicative identity gives aa, which is a different rule.

23. If aa and bb are elements of a ring, which identity relates the product of their additive inverses to their original product?

(−a)×(−b)=a+b(-a)\times(-b)=a+b
(−a)×(−b)=−(a×b)(-a)\times(-b)=-(a\times b)
(−a)×(−b)=−(a+b)(-a)\times(-b)=-(a+b)
(−a)×(−b)=a×b(-a)\times(-b)=a\times b

$$(-a)\times(-b)=a\times b$$

Explanation

Changing the sign of both factors introduces two additive inverses, whose effects cancel in the product. A single sign change would produce the additive opposite of the original product, but two sign changes return a×ba\times b.

Review with flashcards

Memorize the answers with 48 flashcards on Groups, Rings, and Fields.

What is an internal composition law on a set E?

It is an application φ:E×E→E\varphi:E\times E\to E mapping pairs to elements in E.

Which operations are internal composition laws on ℕ?

Addition and multiplication are internal composition laws on ℕ.

Which operations are internal composition laws on 𝒫(ℕ)?

Intersection and union are internal composition laws on 𝒫(ℕ).

See flashcards →

Read the study sheet

Read the complete study sheet on Groups, Rings, and Fields.

See study sheet →

Similar courses

Create your own quizzes

Import your course and AI generates quizzes with corrections in 30 seconds.

Quiz generator