Questions: Binary Operations and Algebraic Structures

Question 1

Consider the operation of subtraction on the set of natural numbers ℕ = {0, 1, 2, 3, …}. Which property does subtraction fail to satisfy on ℕ?

• A. Associativity — (5 − 3) − 1 ≠ 5 − (3 − 1)
• B. Closure — 3 − 5 is not a natural number
• C. Both closure and associativity
• D. Neither — subtraction is a valid binary operation on ℕ

Answer: (C)

Subtraction fails both properties on ℕ. Closure fails because subtracting a larger from a smaller natural number produces a negative integer (3 − 5 = −2 ∉ ℕ). Associativity also fails: (5 − 3) − 1 = 1, but 5 − (3 − 1) = 3. These are independent failures — an operation could fail one without the other — but subtraction fails both. For a binary operation to be valid on a set, closure is the minimum requirement.

Question 2

Matrix multiplication over 2×2 real matrices is associative but not commutative. What does this tell us about the relationship between associativity and commutativity?

• A. Associativity implies commutativity for finite structures
• B. Commutativity implies associativity in all known examples
• C. Associativity and commutativity are independent properties — neither implies the other
• D. Matrix multiplication is actually commutative for invertible matrices

Answer: (C)

Matrix multiplication demonstrates that associativity and commutativity are logically independent: an operation can have one without the other. You can construct operations that are commutative but not associative (e.g., the average of two numbers: (a★b = (a+b)/2) is commutative but not associative). The properties are separate axioms, and an algebraic structure is characterized precisely by which combination it satisfies. This is why groups, abelian groups, rings, and fields are distinct structures.

Question 3

If a binary operation has an identity element, then most element in the set should have an inverse under that operation.

• T. True
• F. False

Answer: False

Having an identity element does not guarantee inverses for all elements. The integers under multiplication have the identity element 1, but 3 has no multiplicative inverse in ℤ (since 1/3 is not an integer). This is precisely the distinction between different algebraic structures: a group requires inverses for every element, but other structures (like monoids) require only an identity. The existence of an identity is a necessary but not sufficient condition for inverses.

Question 4

Associativity is a property about which element the operation 'prefers,' while commutativity is about whether the order of the inputs matters.

• T. True
• F. False

Answer: False

This conflates two distinct properties. Commutativity says a ★ b = b ★ a — the order of the two inputs can be swapped without changing the result. Associativity says (a ★ b) ★ c = a ★ (b ★ c) — the grouping of three or more elements doesn't matter, but the order of inputs is unchanged. Neither property is about 'preference'; both are symmetry conditions. Matrix multiplication shows why the distinction matters: you can regroup a product of three matrices freely (associativity), but you cannot reverse their order (no commutativity).

Question 5

Why does abstract algebra study axiomatic properties like closure, associativity, and identity rather than specific number systems? What does this abstraction gain?

Model answer: By studying which axioms hold — rather than which specific objects are involved — we discover that the same mathematical structure appears in many different contexts: the symmetries of a triangle, integer addition, and clock arithmetic all form groups. Any theorem proved about groups applies to all of them at once. Abstraction reveals deep structural similarities between seemingly unrelated systems and lets us prove general results that would have to be re-proved separately for each specific case.

The power of abstraction is that a single proof applies everywhere the axioms hold. If you prove that 'in any group, the identity element is unique,' that result instantly applies to symmetry groups, permutation groups, and modular arithmetic simultaneously. The axioms are the minimum assumptions needed to guarantee the result — no specific numerical interpretation required. This is also why the concept of a well-defined operation (a result that doesn't depend on your choice of representative) matters: it ensures the abstract structure is coherent when working with equivalence classes.