Documentation

TauCeti.AlgebraicTopology.Singular.ModuleChains.Basic

Singular chains with coefficients in a ring, on elements #

For a ring k, the simplicial singular chain complex with coefficients in k is the complex of k-modules whose n-chains are the formal k-combinations of singular n-simplices. This file gives the element-level interface to it: the chain simplexChain σ a of a simplex with a coefficient, the extensionality of linear maps out of the chains (and, for integer coefficients, of additive maps), the linear map with prescribed values on simplices, the push-forward and the boundary of a simplex, the chains of points and paths (TauCeti.pointChain, TauCeti.pathChain), and the augmentation, the sum of the coefficients of a 0-chain, natural and vanishing on boundaries.

Main definitions #

Main results #

@[reducible, inline]

The simplicial singular chain complex functor with coefficients in the ring k.

Instances For
    @[reducible, inline]
    noncomputable abbrev TauCeti.simplexChain {k : Type u} [Ring k] {X : TopCat} {n : ℕ} (σ : (TopCat.toSSet.obj X).obj (Opposite.op { len := n })) (a : k) :
    ↑(((singularChains k).obj X).X n)

    The chain of a singular simplex, with coefficient a.

    Instances For
      theorem TauCeti.singularChains_linearMap_ext {k : Type u} [Ring k] {X : TopCat} {n : ℕ} {V : Type u} [AddCommGroup V] [Module k V] {L L' : ↑(((singularChains k).obj X).X n) →ₗ[k] V} (h : ∀ (σ : (TopCat.toSSet.obj X).obj (Opposite.op { len := n })), L (simplexChain σ 1) = L' (simplexChain σ 1)) :
      L = L'

      Linear maps out of simplicial singular chains agree when they agree on simplices.

      theorem TauCeti.simplexChain_eq_smul {k : Type u} [Ring k] {X : TopCat} {n : ℕ} (σ : (TopCat.toSSet.obj X).obj (Opposite.op { len := n })) (a : k) :

      The chain of a simplex with coefficient a is a times the chain of the simplex.

      Pushing the chain of a simplex forward along a continuous map gives the chain of the pushed-forward simplex, with the same coefficient.

      noncomputable def TauCeti.chainsDesc {k : Type u} [Ring k] {X : TopCat} {n : ℕ} {V : Type u} [AddCommGroup V] [Module k V] (f : (TopCat.toSSet.obj X).obj (Opposite.op { len := n }) → V) :
      ↑(((singularChains k).obj X).X n) →ₗ[k] V

      The linear map out of the singular n-chains with the given values on singular simplices.

      Instances For
        @[simp]
        theorem TauCeti.chainsDesc_simplexChain {k : Type u} [Ring k] {X : TopCat} {n : ℕ} {V : Type u} [AddCommGroup V] [Module k V] (f : (TopCat.toSSet.obj X).obj (Opposite.op { len := n }) → V) (s : (TopCat.toSSet.obj X).obj (Opposite.op { len := n })) (a : k) :
        (chainsDesc f) (simplexChain s a) = a • f s

        The linear map with given values on simplices takes the chain of a simplex with coefficient a to a times the value on the simplex.

        theorem TauCeti.chainsDesc_simplexChain_one {k : Type u} [Ring k] {X : TopCat} {n : ℕ} {V : Type u} [AddCommGroup V] [Module k V] (f : (TopCat.toSSet.obj X).obj (Opposite.op { len := n }) → V) (s : (TopCat.toSSet.obj X).obj (Opposite.op { len := n })) :
        (chainsDesc f) (simplexChain s 1) = f s

        The linear map with given values on simplices takes the chain of a simplex to the value on the simplex.

        theorem TauCeti.singularChains_addMonoidHom_ext {X : TopCat} {n : ℕ} {V : Type} [AddCommGroup V] {f g : ↑(((singularChains ℤ).obj X).X n) →+ V} (h : ∀ (s : (TopCat.toSSet.obj X).obj (Opposite.op { len := n })), f (simplexChain s 1) = g (simplexChain s 1)) :
        f = g

        Additive maps out of the singular chains with integer coefficients agree when they agree on simplices.

        noncomputable def TauCeti.singularAugment (k : Type u) [Ring k] (X : TopCat) :
        ↑(((singularChains k).obj X).X 0) →ₗ[k] k

        The augmentation of the simplicial singular chains: the sum of the coefficients.

        Instances For
          @[simp]
          theorem TauCeti.singularAugment_simplexChain {k : Type u} [Ring k] (X : TopCat) (σ : (TopCat.toSSet.obj X).obj (Opposite.op { len := 0 })) (a : k) :

          The augmentation of the chain of a 0-simplex with coefficient a is a.

          theorem TauCeti.singularAugment_map {k : Type u} [Ring k] {X Y : TopCat} (f : X ⟶ Y) (x : ↑(((singularChains k).obj X).X 0)) :

          The augmentation of the simplicial singular chains is natural.

          @[simp]

          The boundary of a singular simplex is the alternating sum of its faces.

          @[simp]
          theorem TauCeti.singularAugment_d {k : Type u} [Ring k] (X : TopCat) (x : ↑(((singularChains k).obj X).X 1)) :

          The augmentation of the simplicial singular chains vanishes on boundaries.

          The augmentation of the simplicial singular chains, as a chain map to the coefficient ring placed in degree 0.

          Instances For
            @[simp]

            In degree 0 the augmentation chain map is the augmentation.

            @[reducible, inline]
            noncomputable abbrev TauCeti.pointChain (k : Type u) [Ring k] {X : TopCat} (p : ↑X) :
            ↑(((singularChains k).obj X).X 0)

            The chain of the singular 0-simplex at a point.

            Instances For
              @[reducible, inline]
              noncomputable abbrev TauCeti.pathChain (k : Type u) [Ring k] {X : TopCat} (g : C(↑unitInterval, ↑X)) :
              ↑(((singularChains k).obj X).X 1)

              The chain of the singular 1-simplex of a map from the unit interval (TauCeti.TopCat.simplex₁).

              Instances For

                The boundary of the chain of a path is the difference of the chains of its endpoints.

                Pushing the chain of a path forward along a continuous map gives the chain of the composite.

                @[reducible, inline]

                The map induced on degree-n singular homology with coefficients in k by a continuous map.

                Instances For
                  @[simp]

                  The identity map induces the identity on singular homology.

                  Singular homology respects composition of continuous maps.