Notes:Homology

From Maths
Revision as of 15:10, 5 October 2016 by Alec (Talk | contribs) (Saving work)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Definitions

  1. Boundary operator: n:CnCn1 given by n:[a0,an]ni=0(1)i[a0,,^ai,,an]
  2. n-cycles: Zn (a cycle is defined to have boundary 0, thus Zn=Ker(n) - todo - discussion)
  3. n-boundaries: Bn (the image of n+1 - all boundaries)
    • Claim: BnZn (that is: Bn is a subgroup of Zn)
  4. nth homology group: Hn:=Zn/Bn

Examples 1: G1

Our first example, G1

Chain complex:
1:C1C0 morphism:

  • We have:
    1. 1(a)=yx,
    2. 1(b)=zy,
    3. 1(c)=xz and
    4. 1(d)=xz also
  • We extend this to a group homomorphism by defining:
    • 1(αa+βb+γc+δd):=α1(a)+β1(b)+γ1(c)+δ1(d)=α(yx)+β(zy)+(γ+δ)(xz)=(α+γ+δ)x+(αβ)y+(γδ)z, we may write: (xyz)=α(110)+β(011)+γ(011)+δ(011)=(100011110111)(αβγδ)

Computing the homology groups:

  • H0:=Z0/B0=Ker(0)/Im(1)
    1. Computing Ker(0) (result: Ker(0)=C0)
      • By definition, 0:[a0]0, so everything in the domain of 0 is in the kernel!
      • Thus Z0=C0
    2. Computing Im(1)