Difference between revisions of "Group factorisation theorem"

From Maths
Jump to: navigation, search
(Saving work)
 
m (Proof: Saving work)
Line 19: Line 19:
  
 
==Proof==
 
==Proof==
 +
The bulk of this proof involves invoking the [[function factorisation theorem]]:
 +
<center>
 +
{| class="wikitable" border="1" style="width:80%;"
 +
|-
 +
| Let {{M|f:X\rightarrow Y}} and {{M|w:X\rightarrow W}} be [[function|functions]].
 +
* If {{M|1=\forall x,y\in X\big[ [w(x)=w(y)]\implies[f(x)=f(y)]\big]}} then {{M|f}} "factors (uniquely, if {{M|w}} is [[surjective]]) through {{M|w}}" via:
 +
** {{M|\bar{f}:W\rightarrow Y}} given by {{M|1=\bar{f}:u\mapsto f(w^{-1}(u))}} (which is "well defined")
 +
* Which has the property that {{M|1=f=\bar{f}\circ w}} (the diagram on the right commutes)
 +
| style="overflow:hidden;" | <m>\xymatrix{X \ar[r]^w \ar[dr]_f & W \ar@{.>}[d]^{\overline{f} } \\ & Y}</m>
 +
|}</center>
 +
===Applying the function factorisation theorem===
 +
Before we can apply this theorem we need to check that the objects in play are eligible (satisfy the requirements to factor) for the theorem. We set up as follows:
 +
*Let {{M|G}}, {{M|H}} be [[group|groups]], let {{M|N\trianglelefteq G}} and let {{M|\varphi:G\rightarrow H}} be a [[group homomorphism]] with {{M|N\subseteq\text{Ker}(\varphi)}}, then:
 +
** {{M|1=\forall a,b\in X\big[ [\pi(a)=\pi(b)]\implies[\varphi(a)=\varphi(b)]\big]}}
 +
* where {{M|\pi:G\rightarrow G/N}} is the [[canonical projection of the quotient group]]
 +
====Proof====
 +
Let {{M|a,b\in X}} be given
 +
# If {{M|\pi(a)\ne\pi(b)}} then it doesn't matter what {{M|\varphi(a)}} and {{M|\varphi(b)}} are, as for [[logical implication]] if the LHS is false, it doesn't matter what the RHS for the implication to be considered true.
 +
# If {{M|1=\pi(a)=\pi(b)}} then we require {{M|1=\varphi(a)=\varphi(b)}} for the [[implies|implication]] to be true.
 +
#* By hypothesis we have {{M|1=\pi(a)=\pi(b)}} so:
 +
#*# {{M|1=\implies\pi(a)[\pi(b)]^{-1}=e}} (here {{M|e}} will denote the identity of whatever group makes sense in the context, in this case {{M|G/N}} and {{M|\implies}} may not be the strongest logical relation that can be used)
 +
#**# {{M|1=\implies\pi(a)\pi(b^{-1})=e}}
 +
#**# {{M|1=\implies\pi(ab^{-1})=e}}
 +
#** {{M|1=\implies ab^{-1}\in\text{Ker}(\pi)}} But! [[The kernel of the canonical projection of a quotient group is the normal subgroup of the quotient]]
 +
#** {{M|1=\implies ab^{-1}\in N}}
 +
#** {{M|1=\implies ab^{-1}\in\text{Ker}(\varphi)}} (by hypothesis, as {{M|N\subseteq\text{Ker}(\varphi)}} using the [[implies-subset relation]])
 +
#** {{M|1=\implies \varphi(ab^{-1})=e}} ({{M|e}} is the identity of {{M|H}} this time)
 +
#** {{M|1=\implies \varphi(a)[\varphi(b)]^{-1}=e}}
 +
#** {{M|1=\implies \varphi(a)=\varphi(b)}}
 +
#* We have shown {{M|1=\pi(a)=\pi(b)\implies\varphi(a)=\varphi(b)}} as required.
 +
 
==Notes==
 
==Notes==
 
<references group="Note"/>
 
<references group="Note"/>

Revision as of 00:38, 16 July 2016

Statement

Diagram
Let G and H be groups, and consider any NG [Note 1] and π:GG/N the canonical projection of the quotient group, let φ:GH be any group homomorphism, then[1]:
  • If NKer(φ) then φ factors uniquely through π to yield ˉφ:G/NH given by ˉφ:[g]φ(g) [Note 2]

Additionally we have φ=¯φπ (or in other terms, the diagram on the right commutes)

Proof

The bulk of this proof involves invoking the function factorisation theorem:

Let f:XY and w:XW be functions.
  • If x,yX[[w(x)=w(y)][f(x)=f(y)]] then f "factors (uniquely, if w is surjective) through w" via:
    • ˉf:WY given by ˉf:uf(w1(u)) (which is "well defined")
  • Which has the property that f=ˉfw (the diagram on the right commutes)

Applying the function factorisation theorem

Before we can apply this theorem we need to check that the objects in play are eligible (satisfy the requirements to factor) for the theorem. We set up as follows:

  • Let G, H be groups, let NG and let φ:GH be a group homomorphism with NKer(φ), then:
    • a,bX[[π(a)=π(b)][φ(a)=φ(b)]]
  • where π:GG/N is the canonical projection of the quotient group

Proof

Let a,bX be given

  1. If π(a)π(b) then it doesn't matter what φ(a) and φ(b) are, as for logical implication if the LHS is false, it doesn't matter what the RHS for the implication to be considered true.
  2. If π(a)=π(b) then we require φ(a)=φ(b) for the implication to be true.
    • By hypothesis we have π(a)=π(b) so:
      1. π(a)[π(b)]1=e (here e will denote the identity of whatever group makes sense in the context, in this case G/N and may not be the strongest logical relation that can be used)
        1. π(a)π(b1)=e
        2. π(ab1)=e
      • ab1Ker(π) But! The kernel of the canonical projection of a quotient group is the normal subgroup of the quotient
      • ab1N
      • ab1Ker(φ) (by hypothesis, as NKer(φ) using the implies-subset relation)
      • φ(ab1)=e (e is the identity of H this time)
      • φ(a)[φ(b)]1=e
      • φ(a)=φ(b)
    • We have shown π(a)=π(b)φ(a)=φ(b) as required.

Notes

  1. Jump up The notation AB means A is a normal subgroup of the group B.
  2. Jump up This may look strange as obviously you're thinking "what if we took a different representative h[g] with hg, then we'd have φ(h) instead of φ(g)!", these are actually the same, see Factor (function) for more details, I shall explain this here.
    • Technically we have this: ˉφ:uφ(π1(u)) for the definition of ˉφ
      • Note though that if g,hπ1(u) that:
        • π(g)=π(h)=u and by hypothesis we have [π(x)=π(y)][φ(x)=φ(y)]
          • Thus φ(g)=φ(h)
      • So whichever representative of [g] we use φ(h) for h[g] is the same.
    • This is actually all dealt with as a part of factor (function) not this theorem. However it is worth illustrating.

References

  1. Jump up Abstract Algebra - Pierre Antoine Grillet