Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °
You are not logged in.
Proving something is well defined
I need to prove that multiplication on Q is well defined. I have no idea really what well defined even means. From what I understand from reading, it means that multiplication on Q does not depend on the choices of integers to represent the equivalence classes. However, I have no idea how to go about proving that. Anyone have any ideas?
Re: Proving something is well defined
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."