Showing that a subset is closed under a binary operation

  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
  • Tags Tags
    Binary Closed
Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


Suppose that * is an associative binary operation on a set S. Let ##H=\{a \in S ~| ~a*x=x*a, ~ \forall x \in S\}##. Show that * is closed under H.

Homework Equations

The Attempt at a Solution


Let b and c be two different elements in H. We need to show that b*c is also in H.

We know that bx = xb, and that cx = xc. Putting these two equations, and using associativity and commutativity the farthest I can get is (bc)xx = xx(bc). I'm not sure how to get (bc)x = x(bc)
 
Physics news on Phys.org
Mr Davis 97 said:

Homework Statement


Suppose that * is an associative binary operation on a set S. Let ##H=\{a \in S ~| ~a*x=x*a, ~ \forall x \in S\}##. Show that * is closed under H.

Homework Equations

The Attempt at a Solution


Let b and c be two different elements in H. We need to show that b*c is also in H.

We know that bx = xb, and that cx = xc. Putting these two equations, and using associativity and commutativity the farthest I can get is (bc)xx = xx(bc). I'm not sure how to get (bc)x = x(bc)
You start with ##(bc)x##. And it's " H is closed under * ".
 
  • Like
Likes Mr Davis 97
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