∗ is a binary operation on S when, for all a, b ∈ S, a ∗ b is defined, unique, and belongs to S.
| Operation | ℕ | ℤ | ℚ | ℝ | ℂ | ℚ \ {0}, ℝ \ {0}, ℂ \ {0} |
|---|---|---|---|---|---|---|
| + | Binary | Binary | Binary | Binary | Binary | Not binary (e.g. 2 + (−2) = 0) |
| − | Not binary | Binary | Binary | Binary | Binary | Not binary (e.g. 2 − 2 = 0) |
| × | Binary | Binary | Binary | Binary | Binary | Binary |
| ÷ | Not binary | Not binary | Not binary (÷ 0) | Not binary (÷ 0) | Not binary (÷ 0) | Binary |
Testing a rule for closure
-
Is a ∗ b defined for every pair?
If some pair gives no value (like a ÷ 0), it is not binary.
- Check zero, negatives, equal elements
- Is the value unique? One pair must not give two answers.
-
Is the value inside S?
Find one pair whose value leaves S to disprove; argue in general to prove.
- 3 − 4 = −1 ∉ ℕ
- a + b + ab ∈ ℕ for a, b ∈ ℕ
Key takeaways: a binary operation on S takes every ordered pair of S to a single element of S; closure is built into the definition. One counterexample is enough to show that a rule is not binary. Whether a rule is binary depends on the set: − is binary on ℤ but not on ℕ, and ÷ is binary on ℝ \ {0} but not on ℝ.