computing the cohomology algebra of a polyhedral complex
play

Computing the Cohomology Algebra of a Polyhedral Complex Joint work - PowerPoint PPT Presentation

Computing the Cohomology Algebra of a Polyhedral Complex Joint work with R. Gonzalez-Diaz & J. Lamar Ron Umble Millersville Univiversity Escuela de Ingeniera Informatica 27 March 2018 Polyhedral Complexes A polyhedral complex X is a


  1. Computing the Cohomology Algebra of a Polyhedral Complex Joint work with R. Gonzalez-Diaz & J. Lamar Ron Umble Millersville Univiversity Escuela de Ingeniería Informatica 27 March 2018

  2. Polyhedral Complexes � A polyhedral complex X is a regular cell complex whose k -cells are k -dim’l polytopes

  3. Polyhedral Complexes � A polyhedral complex X is a regular cell complex whose k -cells are k -dim’l polytopes � X is simplicial if its k -cells are k -simplices

  4. Polyhedral Complexes � A polyhedral complex X is a regular cell complex whose k -cells are k -dim’l polytopes � X is simplicial if its k -cells are k -simplices � X is cubical if its k -cells are k -cubes

  5. Diagonal Approximations � The cellular chains of X , denoted C ∗ ( X ) , is the graded Z 2 -vector space generated by the k -cells of X

  6. Diagonal Approximations � The cellular chains of X , denoted C ∗ ( X ) , is the graded Z 2 -vector space generated by the k -cells of X � Example: If P is a polygon, C ∗ ( P ) is generated by the vertices, edges, and region of P

  7. Diagonal Approximations � The cellular chains of X , denoted C ∗ ( X ) , is the graded Z 2 -vector space generated by the k -cells of X � Example: If P is a polygon, C ∗ ( P ) is generated by the vertices, edges, and region of P � The geometric boundary induces a differential operator ∂ : C ∗ ( X ) → C ∗− 1 ( X ) such that ∂ ◦ ∂ = 0

  8. Diagonal Approximations � The cellular chains of X , denoted C ∗ ( X ) , is the graded Z 2 -vector space generated by the k -cells of X � Example: If P is a polygon, C ∗ ( P ) is generated by the vertices, edges, and region of P � The geometric boundary induces a differential operator ∂ : C ∗ ( X ) → C ∗− 1 ( X ) such that ∂ ◦ ∂ = 0 � A diagonal approximation on X is a map ∆ X : X → X × X that

  9. Diagonal Approximations � The cellular chains of X , denoted C ∗ ( X ) , is the graded Z 2 -vector space generated by the k -cells of X � Example: If P is a polygon, C ∗ ( P ) is generated by the vertices, edges, and region of P � The geometric boundary induces a differential operator ∂ : C ∗ ( X ) → C ∗− 1 ( X ) such that ∂ ◦ ∂ = 0 � A diagonal approximation on X is a map ∆ X : X → X × X that � Is homotopic to the geometric diagonal ∆ : x �→ ( x , x )

  10. Diagonal Approximations � The cellular chains of X , denoted C ∗ ( X ) , is the graded Z 2 -vector space generated by the k -cells of X � Example: If P is a polygon, C ∗ ( P ) is generated by the vertices, edges, and region of P � The geometric boundary induces a differential operator ∂ : C ∗ ( X ) → C ∗− 1 ( X ) such that ∂ ◦ ∂ = 0 � A diagonal approximation on X is a map ∆ X : X → X × X that � Is homotopic to the geometric diagonal ∆ : x �→ ( x , x ) � Commutes with the boundary operator ∆ X ∂ = ( ∂ ⊗ Id + Id ⊗ ∂ ) ∆ X

  11. Goals of the Talk 1. Transform a simplicial or cubical complex X into a polyhedral complex P

  12. Goals of the Talk 1. Transform a simplicial or cubical complex X into a polyhedral complex P 2. Given a diagonal on C ∗ ( X ) , induce a diagonal on C ∗ ( P )

  13. Alexander-Whitney Diagonal on the Simplex n ∑ ∆ s ( 012 · · · n ) = 012 · · · i ⊗ i · · · n i = 0 ∆ s ( 012 ) = 0 ⊗ 012 + 01 ⊗ 12 + 012 ⊗ 2

  14. Serre Diagonal on the Cube u 1 · · · u n ⊗ u � 1 · · · u � ∆ I ( I n ) = ∑ n ( u 1 , ... , u n ) ∈{ 0 , I } × n (0 � = I and I � = 1) � I 2 � = 00 ⊗ II + 0 I ⊗ I 1 + I 0 ⊗ 1 I + II ⊗ 11 ∆ I

  15. S-U Diagonal on the Associahedron

  16. A Diagonal on an n-gon P � Vertices labeled v 1 , v 2 , . . . , v n

  17. A Diagonal on an n-gon P � Vertices labeled v 1 , v 2 , . . . , v n � Edges with endpoints v i and v i + 1 labeled e i for i < n

  18. A Diagonal on an n-gon P � Vertices labeled v 1 , v 2 , . . . , v n � Edges with endpoints v i and v i + 1 labeled e i for i < n � Edge with endpoints v n and v 1 labeled e n

  19. A Diagonal on an n-gon P � Vertices labeled v 1 , v 2 , . . . , v n � Edges with endpoints v i and v i + 1 labeled e i for i < n � Edge with endpoints v n and v 1 labeled e n � v 1 is the initial vertex; v n is the terminal vertex

  20. A Diagonal on an n-gon P � Vertices labeled v 1 , v 2 , . . . , v n � Edges with endpoints v i and v i + 1 labeled e i for i < n � Edge with endpoints v n and v 1 labeled e n � v 1 is the initial vertex; v n is the terminal vertex � Edges are directed from v 1 to v n

  21. A Diagonal on an n-gon P � Theorem (D. Kravatz, 2008 thesis) There is a diagonal approximation on C ∗ ( P ) defined by ∆ P ( v i ) = v i ⊗ v i ∆ P ( e i ) = v i ⊗ e i + e i ⊗ v i + 1 if i < n ∆ P ( e n ) = v 1 ⊗ e n + e n ⊗ v n ∑ ∆ P ( P ) = v 1 ⊗ P + P ⊗ v n + e i 1 ⊗ e i 2 0 < i 1 < i 2 < n

  22. A General Diagonal on an n-gon P � Let v t be the terminal vertex

  23. A General Diagonal on an n-gon P � Let v t be the terminal vertex � Introduce a new edge e 0 from v 1 to v t

  24. A General Diagonal on an n-gon P � Let v t be the terminal vertex � Introduce a new edge e 0 from v 1 to v t � Let P 1 be the subpolygon with vertices v 1 , v 2 , . . . , v t

  25. A General Diagonal on an n-gon P � Let v t be the terminal vertex � Introduce a new edge e 0 from v 1 to v t � Let P 1 be the subpolygon with vertices v 1 , v 2 , . . . , v t � Let P 2 be the subpolygon with vertices v 1 , v t , v t + 1 , . . . , v n

  26. A General Diagonal on an n-gon P � Let v t be the terminal vertex � Introduce a new edge e 0 from v 1 to v t � Let P 1 be the subpolygon with vertices v 1 , v 2 , . . . , v t � Let P 2 be the subpolygon with vertices v 1 , v t , v t + 1 , . . . , v n � Edges are directed from v 1 to v t

  27. A General Diagonal on an n-gon P Corollary Let P be an n-gon with initial vertex v 1 and terminal vertex v t . Then ∆ � ∑ ∑ P ( P ) = v 1 ⊗ P + P ⊗ v t + e i 1 ⊗ e i 2 + e i 1 ⊗ e i 2 0 < i 1 < i 2 < t n ≥ i 1 > i 2 ≥ t is a diagonal approximation on C ∗ ( P )

  28. Application to Closed Compact Surfaces Let X g be a closed compact surface of genus g . The celebrated Classification of Closed Compact Surfaces states that X g is homeomorphic to a � Sphere with g ≥ 0 handles when orientable

  29. Application to Closed Compact Surfaces Let X g be a closed compact surface of genus g . The celebrated Classification of Closed Compact Surfaces states that X g is homeomorphic to a � Sphere with g ≥ 0 handles when orientable � Connected sum of g ≥ 1 real projective planes when unorientable

  30. Application to Closed Compact Surfaces Let X g be a closed compact surface of genus g . The celebrated Classification of Closed Compact Surfaces states that X g is homeomorphic to a � Sphere with g ≥ 0 handles when orientable � Connected sum of g ≥ 1 real projective planes when unorientable � When g ≥ 1 , X g is the quotient of a

  31. Application to Closed Compact Surfaces Let X g be a closed compact surface of genus g . The celebrated Classification of Closed Compact Surfaces states that X g is homeomorphic to a � Sphere with g ≥ 0 handles when orientable � Connected sum of g ≥ 1 real projective planes when unorientable � When g ≥ 1 , X g is the quotient of a � 4 g -gon when orientable

  32. Application to Closed Compact Surfaces Let X g be a closed compact surface of genus g . The celebrated Classification of Closed Compact Surfaces states that X g is homeomorphic to a � Sphere with g ≥ 0 handles when orientable � Connected sum of g ≥ 1 real projective planes when unorientable � When g ≥ 1 , X g is the quotient of a � 4 g -gon when orientable � 2 g -gon when unorientable

  33. Polygonal Decomposition of a Torus = ⇒

  34. Polygonal Decomposition of Real Projective Plane = ⇒

  35. Polygonal Decomposition of a Klein Bottle = ⇒

  36. Connected Sums To obtain the connected sum X # Y of two surfaces, remove the interior of a disk from X and from Y then glue the two surfaces together along their boundaries Connected sums of four real projective planes and three tori

  37. The g-fold Torus as a Quotient of a 4g-gon � An g -fold torus as a quotient of a 4 g -gon has

  38. The g-fold Torus as a Quotient of a 4g-gon � An g -fold torus as a quotient of a 4 g -gon has � one 0-cell v

  39. The g-fold Torus as a Quotient of a 4g-gon � An g -fold torus as a quotient of a 4 g -gon has � one 0-cell v � � � 2 g 1-cells ( e 1 , e 2 ) , . . . , e 2 g − 1 , e 2 g

  40. The g-fold Torus as a Quotient of a 4g-gon � An g -fold torus as a quotient of a 4 g -gon has � one 0-cell v � � � 2 g 1-cells ( e 1 , e 2 ) , . . . , e 2 g − 1 , e 2 g � one 2-cell T g

  41. A Diagonal on the g-fold Torus � A diagonal on T g is defined by g ∑ ∆ T g ( T g ) = v ⊗ T g + T g ⊗ v + e 2 i − 1 ⊗ e 2 i + e 2 i ⊗ e 2 i − 1 i = 1

  42. A Diagonal on the g-fold Projective Plane � A diagonal on RP g is defined by g ∑ ∆ RP g ( RP g ) = v ⊗ RP g + RP g ⊗ v + e i ⊗ e i i = 1

  43. A Diagonal on the g-fold Projective Plane � A diagonal on RP g is defined by g ∑ ∆ RP g ( RP g ) = v ⊗ RP g + RP g ⊗ v + e i ⊗ e i i = 1 � ∆ T g and ∆ RP g are strikingly different and determine the homeomorphism type of the surface

Recommend


More recommend