Difference between revisions of "Notes:Coset stuff"

From Maths
Jump to: navigation, search
(Saving work)
 
(Going further)
Line 12: Line 12:
 
# {{M|1=\forall x,g\in G[x\in[g]'\iff x\in Hg]}}. Done - [[User:Alec|Alec]] ([[User talk:Alec|talk]]) 21:23, 23 October 2016 (UTC)
 
# {{M|1=\forall x,g\in G[x\in[g]'\iff x\in Hg]}}. Done - [[User:Alec|Alec]] ([[User talk:Alec|talk]]) 21:23, 23 October 2016 (UTC)
 
==Going forward==
 
==Going forward==
I have shown we get two [[equivalence relations]]. {{M|\sim}} and {{M|\sim'}} Thus we get two {{plural|partition|s}} of {{M|G}}.
+
I have shown we get two [[equivalence relations]]. {{M|\sim}} and {{M|\sim'}} Thus we get two {{plural|partition|s}} of {{M|G}}, and:
 +
* {{M|\pi:G\rightarrow\frac{G}{\sim} }} given by {{M|\pi:g\rightarrow[g] }} and {{M|\pi':G\rightarrow\frac{G}{\sim'} }} given by {{M|\pi':g\rightarrow[g]'}}
 +
Can we [[factor (function)|factor]] anything through {{M|\frac{G}{\sim} }} or {{M|\frac{G}{\sim'} }}?
 +
 
 +
We can factor a map, {{M|f:G\rightarrow X}} (for some other thing {{M|X}}) if:
 +
* {{M|1=\forall g,h\in G[\pi(g)=\pi(h)\implies f(g)=f(h)]}}
 +
Actually lets try factoring the group operation through this!
 +
* {{M|1=\forall (g,h),(g',h')\in G[\pi(g,h)=\pi(g',h')\implies \times(g,h)=\times(g',h')]}}<ref group="Note">We're informal about how we use {{M|\pi}} here, we really mean:
 +
* {{M|\pi_1:G\times G\rightarrow\frac{G}{\sim}\times\frac{G}{\sim} }} given by {{M|1=\pi':(g,h)\mapsto([g],[h])=(\pi(g),\pi(h))}}</ref>
 +
** Then {{M|1=([g],[h])=([g'],[h'])}} so {{M|1=[g]=[g']}} and {{M|1=[h]=[h']}}
 +
** So {{M|g\sim g'}} and {{M|h\sim h'}}
 +
*** Thus {{M|1=\exists h_1,h_2\in H}} such that {{M|1=g^{-1}g'=h_1}} and {{M|1=h^{-1}h'=h_2}}. We want to show {{M|1=gh=g'h'}}
 +
**** Well {{M|1=h_1h_2=g^{-1}g'h^{-1}h'}}
 +
Here we get stuck. If we had {{M|1=gH=Hg}} then we could go further and factor the {{M|\times}} through, then we can proceed to:
 +
* {{M|1=g'h_4h'=gh}} for some {{M|h_4\in H}} (I did {{M|1=h_4:=h_1h_3}} on paper but I don't know if I used the same {{M|h_1}} here. {{M|h_3}} comes from turning either {{M|gH}} into {{M|Hg}} or {{M|hH}} into {{M|Hh}} with {{M|h_1}} or {{M|h_2}} what it was "before")
 +
 
 +
The result is, if {{M|1=h_4}} is known to be {{M|e}} then we can factor. So if {{M|H}} is the [[trivial group]], we can factor. We must have {{M|1=\times=\overline{\times}\circ\pi}} so this is another way of saying a group "over" the trivial group is isomorphic to the group.
 +
 
 +
Really stupid and pointless way of saying it.
 +
 
 +
We can get multiplication through:
 +
: <span style="font-size:1.5em;"><m>\xymatrix { G\times G \ar[dr]^{\pi\circ\times} \ar[r]^\times \ar[d]_{(\pi,\pi)} & G \ar[d]^{\pi} \\ \frac{G}{\sim}\times\frac{G}{\sim} \ar@{.>}[r]_{\overline{x} } & \frac{G}{\sim} }</m></span>
 +
 
 +
If we want {{M|\pi}} to be a [[group homomorphism]] we require this in fact.
 
==Proof of claims==
 
==Proof of claims==
 +
{{Begin Inline Theorem}}
 +
Proofs here
 +
{{Begin Inline Proof}}
 
# {{M|1=x\sim y\iff x^{-1}y\in H}} is an equivalence relation
 
# {{M|1=x\sim y\iff x^{-1}y\in H}} is an equivalence relation
 
## Reflexive: {{M|x\sim x}} holds
 
## Reflexive: {{M|x\sim x}} holds
Line 42: Line 68:
 
# Follows by doing 1 again but with {{M|xy^{-1} }} instead
 
# Follows by doing 1 again but with {{M|xy^{-1} }} instead
 
# Follows by doing 2 again, but slightly differently. I should copy and paste it and make the alterations.
 
# Follows by doing 2 again, but slightly differently. I should copy and paste it and make the alterations.
 +
{{End Proof}}{{End Theorem}}
 
==Notes==
 
==Notes==
 
<references group="Note"/>
 
<references group="Note"/>

Revision as of 00:15, 24 October 2016

Stuff

Let (G,×) be a group and let HG be a subgroup. Proper or not. Then

  • Any set of the form gH is called a left coset, where gH:={g×h | hH}
  • Any set of the form Hg is called a right coset, where Hg:={h×g | hH}

H itself is a coset as eH=H clearly (for e the identity of G)

Claims

  1. For x,yG we can define an equivalence relation on G: xyx1yH[Note 1]. Done - Alec (talk) 21:23, 23 October 2016 (UTC)
    • By symmetry this is/must be the same as y1xH - this is true as H is a subgroup.
  2. x,gG[x[g]xgH]. Done - Alec (talk) 21:23, 23 October 2016 (UTC)
  3. For x,yG we can define another equivalence relation on G: xyxy1H. Done - Alec (talk) 21:23, 23 October 2016 (UTC)
    • By symmetry this is/must be the same as yx1H - this is true as H is a subgroup.
  4. x,gG[x[g]xHg]. Done - Alec (talk) 21:23, 23 October 2016 (UTC)

Going forward

I have shown we get two equivalence relations. and Thus we get two partitions of G, and:

  • π:GG given by π:g[g] and π:GG given by π:g[g]

Can we factor anything through G or G?

We can factor a map, f:GX (for some other thing X) if:

  • g,hG[π(g)=π(h)f(g)=f(h)]

Actually lets try factoring the group operation through this!

  • (g,h),(g,h)G[π(g,h)=π(g,h)×(g,h)=×(g,h)][Note 2]
    • Then ([g],[h])=([g],[h]) so [g]=[g] and [h]=[h]
    • So gg and hh
      • Thus h1,h2H such that g1g=h1 and h1h=h2. We want to show gh=gh
        • Well h1h2=g1gh1h

Here we get stuck. If we had gH=Hg then we could go further and factor the × through, then we can proceed to:

  • gh4h=gh for some h4H (I did h4:=h1h3 on paper but I don't know if I used the same h1 here. h3 comes from turning either gH into Hg or hH into Hh with h1 or h2 what it was "before")

The result is, if h4 is known to be e then we can factor. So if H is the trivial group, we can factor. We must have ×=¯×π so this is another way of saying a group "over" the trivial group is isomorphic to the group.

Really stupid and pointless way of saying it.

We can get multiplication through:

If we want π to be a group homomorphism we require this in fact.

Proof of claims

[Expand]

Proofs here

Notes

  1. Jump up It must be this way as we will require xx, then we get x1x=eH as H is a subgroup.
  2. Jump up We're informal about how we use π here, we really mean:
    • π1:G×GG×G given by π:(g,h)([g],[h])=(π(g),π(h))