How can we check that this operation is associative ?

  • Thread starter Thread starter Maths Lover
  • Start date Start date
  • Tags Tags
    associative
Maths Lover
Messages
67
Reaction score
0
hello , there is an example here say that the binary operation which we denote it Δ is associative .
Δ is defiened as follows :
if A,B are two sets then
AΔB=(A-B)U(B-A). and Δ is associative . but the proof is omitted . and I need to know the proof .
 
Physics news on Phys.org
So, what did you attempt? Where are you stuck?
 
start by subbing in the the union definition and then rearrange terms.

(A ^ B) ^ C ) = ( ( A - B ) U ( B - A ) - C ) U ( C - ( A - B ) U ( B - A ) )

now show some work.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top