Documentation

TauCeti.Algebra.Homology.AInfinity.Algebra

Nonunital A-infinity algebras #

An uncurved nonunital A∞ algebra on an internally ℤ-graded module consists of operations m n of degree 2 - n, with m 0 = 0, whose suspended Taylor map extends to a square-zero degree-one coderivation of the reduced tensor coalgebra. This file packages that definition and exposes both of its standard presentations: the bar differential and the unsuspended Stasheff identities.

The comparison between the presentations uses the degree--1 suspension convention. In particular, the arity-two identity has the sign (-1)^|a| on m₂(a,m₁(b)), while the arity-three identity becomes ordinary associativity when m₃ vanishes. Arity zero is explicitly forced to vanish, rather than being unconstrained data hidden from the bar construction.

Main definitions #

Main results #

References #

structure TauCeti.AInfinityAlgebra (R : Type uR) (A : Type uA) [CommRing R] [AddCommGroup A] [Module R A] :
Type (max uA uR)

An uncurved nonunital A∞ algebra over a commutative ring.

The Taylor map is stored alongside the operations because suspension depends on the degrees of homogeneous inputs. taylor_isSuspension determines it uniquely from grading and m, as recorded by AInfinity.IsSuspension.taylor_eq. Its graded Taylor expansion is the primary bar coderivation, and bar_square_zero is the stored Stasheff law.

Instances For

    The degree-one coderivation of the reduced bar construction.

    Equations
    Instances For

      The bar differential is the coderivation generated by the stored Taylor map.

      The bar differential is a graded coderivation for the suspended grading.

      @[simp]

      The letter component of the bar differential is its stored Taylor map.

      @[simp]

      The bar differential squares to zero.

      theorem TauCeti.AInfinityAlgebra.barDifferential_sq_iff_stasheff {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) :
      𝒜.barDifferential ∘ₗ 𝒜.barDifferential = 0 ↔ ∀ (n : ℕ), 0 < n → ∀ (d : ℕ → ℤ) (x : ℕ → A), (∀ i < n, x i ∈ 𝒜.grading.piece (d i)) → AInfinity.stasheffSum 𝒜.m d x n = 0

      The square-zero bar law is equivalent to all unsuspended Stasheff identities on homogeneous inputs.

      theorem TauCeti.AInfinityAlgebra.stasheff {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (n : ℕ) (hn : 0 < n) (d : ℕ → ℤ) (x : ℕ → A) (hx : ∀ i < n, x i ∈ 𝒜.grading.piece (d i)) :

      The unsuspended operations of an A∞ algebra satisfy every Stasheff identity on homogeneous inputs.

      def TauCeti.AInfinityAlgebra.ofStasheff {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (G : InternalGrading R A) (m : (n : ℕ) → MultilinearMap R (fun (x : Fin n) => A) A) (hm0 : m 0 = 0) (hm : ∀ (n : ℕ), 0 < n → MultilinearMap.IsHomogeneous (m n) (fun (x : Fin n) => G.piece) G.piece (2 - ↑n)) (F : ReducedTensorWords R A →ₗ[R] A) (hFm : AInfinity.IsSuspension G F m) (hSI : ∀ (n : ℕ), 0 < n → ∀ (d : ℕ → ℤ) (x : ℕ → A), (∀ i < n, x i ∈ G.piece (d i)) → AInfinity.stasheffSum m d x n = 0) :

      Construct an A∞ algebra from homogeneous operations satisfying the unsuspended Stasheff identities and a Taylor map realizing their suspension.

      Equations
      Instances For
        @[simp]
        theorem TauCeti.AInfinityAlgebra.ofStasheff_grading {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (G : InternalGrading R A) (m : (n : ℕ) → MultilinearMap R (fun (x : Fin n) => A) A) (hm0 : m 0 = 0) (hm : ∀ (n : ℕ), 0 < n → MultilinearMap.IsHomogeneous (m n) (fun (x : Fin n) => G.piece) G.piece (2 - ↑n)) (F : ReducedTensorWords R A →ₗ[R] A) (hFm : AInfinity.IsSuspension G F m) (hSI : ∀ (n : ℕ), 0 < n → ∀ (d : ℕ → ℤ) (x : ℕ → A), (∀ i < n, x i ∈ G.piece (d i)) → AInfinity.stasheffSum m d x n = 0) :
        (ofStasheff G m hm0 hm F hFm hSI).grading = G
        @[simp]
        theorem TauCeti.AInfinityAlgebra.ofStasheff_m {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (G : InternalGrading R A) (m : (n : ℕ) → MultilinearMap R (fun (x : Fin n) => A) A) (hm0 : m 0 = 0) (hm : ∀ (n : ℕ), 0 < n → MultilinearMap.IsHomogeneous (m n) (fun (x : Fin n) => G.piece) G.piece (2 - ↑n)) (F : ReducedTensorWords R A →ₗ[R] A) (hFm : AInfinity.IsSuspension G F m) (hSI : ∀ (n : ℕ), 0 < n → ∀ (d : ℕ → ℤ) (x : ℕ → A), (∀ i < n, x i ∈ G.piece (d i)) → AInfinity.stasheffSum m d x n = 0) :
        (ofStasheff G m hm0 hm F hFm hSI).m = m
        @[simp]
        theorem TauCeti.AInfinityAlgebra.ofStasheff_taylor {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (G : InternalGrading R A) (m : (n : ℕ) → MultilinearMap R (fun (x : Fin n) => A) A) (hm0 : m 0 = 0) (hm : ∀ (n : ℕ), 0 < n → MultilinearMap.IsHomogeneous (m n) (fun (x : Fin n) => G.piece) G.piece (2 - ↑n)) (F : ReducedTensorWords R A →ₗ[R] A) (hFm : AInfinity.IsSuspension G F m) (hSI : ∀ (n : ℕ), 0 < n → ∀ (d : ℕ → ℤ) (x : ℕ → A), (∀ i < n, x i ∈ G.piece (d i)) → AInfinity.stasheffSum m d x n = 0) :
        (ofStasheff G m hm0 hm F hFm hSI).taylor = F
        theorem TauCeti.AInfinityAlgebra.ext {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] {𝒜 𝒜' : AInfinityAlgebra R A} (hG : 𝒜.grading = 𝒜'.grading) (hm : 𝒜.m = 𝒜'.m) :
        𝒜 = 𝒜'

        A∞ algebras are determined by their grading and unsuspended operations; the Taylor map is forced by the suspension relation and all remaining fields are propositions.

        theorem TauCeti.AInfinityAlgebra.ext_iff {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] {𝒜 𝒜' : AInfinityAlgebra R A} :
        𝒜 = 𝒜' ↔ 𝒜.grading = 𝒜'.grading ∧ 𝒜.m = 𝒜'.m

        Construct an A∞ algebra from a Taylor map of degree one for the suspended grading whose bar coderivation squares to zero. Its operations are the desuspension of the Taylor map.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          @[simp]

          The bar differential of the algebra built from a Taylor map is the coderivation it generates.

          The operations of an A∞ algebra are the desuspension of its Taylor map.

          @[simp]
          theorem TauCeti.AInfinityAlgebra.ofTaylor_self {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) :
          ofTaylor 𝒜.grading 𝒜.taylor ⋯ ⋯ = 𝒜

          Every A∞ algebra is built from its own Taylor map.

          Low-arity identities #

          theorem TauCeti.AInfinityAlgebra.stasheff_arity_one {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (x : A) :
          (𝒜.m 1) ![(𝒜.m 1) ![x]] = 0

          The arity-one identity is m₁ m₁ = 0.

          theorem TauCeti.AInfinityAlgebra.stasheff_arity_two {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (x y : A) (p : ℤ) (hx : x ∈ 𝒜.grading.piece p) :
          (𝒜.m 1) ![(𝒜.m 2) ![x, y]] = (𝒜.m 2) ![(𝒜.m 1) ![x], y] + negOnePowCast R p • (𝒜.m 2) ![x, (𝒜.m 1) ![y]]

          The arity-two identity is the graded Leibniz rule, with sign (-1)^(d 0) on the second differentiated input.

          theorem TauCeti.AInfinityAlgebra.stasheff_arity_three {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (a b c : A) (p q : ℤ) (ha : a ∈ 𝒜.grading.piece p) (hb : b ∈ 𝒜.grading.piece q) :
          (𝒜.m 1) ![(𝒜.m 3) ![a, b, c]] + (𝒜.m 2) ![(𝒜.m 2) ![a, b], c] - (𝒜.m 2) ![a, (𝒜.m 2) ![b, c]] + (𝒜.m 3) ![(𝒜.m 1) ![a], b, c] + negOnePowCast R p • (𝒜.m 3) ![a, (𝒜.m 1) ![b], c] + negOnePowCast R (p + q) • (𝒜.m 3) ![a, b, (𝒜.m 1) ![c]] = 0

          The arity-three Stasheff identity, with the Koszul signs determined by the degrees of its first two inputs.

          theorem TauCeti.AInfinityAlgebra.stasheff_arity_four {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (a b c d : A) (p q r : ℤ) (ha : a ∈ 𝒜.grading.piece p) (hb : b ∈ 𝒜.grading.piece q) (hc : c ∈ 𝒜.grading.piece r) :
          (𝒜.m 1) ![(𝒜.m 4) ![a, b, c, d]] - (𝒜.m 2) ![(𝒜.m 3) ![a, b, c], d] - negOnePowCast R p • (𝒜.m 2) ![a, (𝒜.m 3) ![b, c, d]] + (𝒜.m 3) ![(𝒜.m 2) ![a, b], c, d] - (𝒜.m 3) ![a, (𝒜.m 2) ![b, c], d] + (𝒜.m 3) ![a, b, (𝒜.m 2) ![c, d]] - (𝒜.m 4) ![(𝒜.m 1) ![a], b, c, d] - negOnePowCast R p • (𝒜.m 4) ![a, (𝒜.m 1) ![b], c, d] - negOnePowCast R (p + q) • (𝒜.m 4) ![a, b, (𝒜.m 1) ![c], d] - negOnePowCast R (p + q + r) • (𝒜.m 4) ![a, b, c, (𝒜.m 1) ![d]] = 0

          The arity-four Stasheff identity, with the Koszul signs determined by the degrees of its first three inputs.

          Low-arity identities for arbitrary inputs #

          The unary A∞ operation, regarded as a linear differential on the total module.

          Equations
          Instances For
            @[simp]
            theorem TauCeti.AInfinityAlgebra.differential_apply {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (x : A) :
            𝒜.differential x = (𝒜.m 1) ![x]

            Evaluating the differential is evaluating the unary operation.

            theorem TauCeti.AInfinityAlgebra.differential_mem_piece {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) {p : ℤ} {x : A} (hx : x ∈ 𝒜.grading.piece p) :
            𝒜.differential x ∈ 𝒜.grading.piece (p + 1)

            The unary operation raises the degree by one.

            @[simp]
            theorem TauCeti.AInfinityAlgebra.taylor_ofLetter {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (x : A) :
            𝒜.taylor ((ReducedTensorWords.ofLetter R A) x) = (𝒜.m 1) ![x]

            On a single letter the Taylor map is the unary operation: the suspension sign of a word of length one is trivial.

            @[simp]

            The bar differential sends a single letter to the single letter given by the unary operation.

            def TauCeti.AInfinityAlgebra.mul {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) :

            The binary A∞ operation, regarded as a linear map in each argument.

            Equations
            Instances For
              @[simp]
              theorem TauCeti.AInfinityAlgebra.mul_apply {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (x y : A) :
              (𝒜.mul x) y = (𝒜.m 2) ![x, y]

              Evaluating the bilinear product is evaluating the binary operation.

              theorem TauCeti.AInfinityAlgebra.mul_mem_piece {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) {p q : ℤ} {x y : A} (hx : x ∈ 𝒜.grading.piece p) (hy : y ∈ 𝒜.grading.piece q) :
              (𝒜.mul x) y ∈ 𝒜.grading.piece (p + q)

              The binary operation has degree zero.

              theorem TauCeti.AInfinityAlgebra.taylor_of_tprod {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (n : { n : ℕ // 0 < n }) (x : Fin ↑n → A) :
              𝒜.taylor ((ReducedTensorWords.of R A n) ((PiTensorProduct.tprod R) x)) = (𝒜.m ↑n) fun (i : Fin ↑n) => (𝒜.grading.koszulTwist (↑↑n - 1 - ↑↑i)) (x i)

              On a pure tensor word of length n the Taylor map evaluates the arity-n operation after twisting the i-th letter by the Koszul twist of parameter n - 1 - i; on homogeneous letters these twists multiply to the suspension sign (-1) ^ suspExp n d.

              theorem TauCeti.AInfinityAlgebra.taylor_of_two {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (a b : A) :
              𝒜.taylor ((ReducedTensorWords.of R A 2) ((PiTensorProduct.tprod R) ![a, b])) = (𝒜.m 2) ![(𝒜.grading.koszulTwist 1) a, b]

              On a two-letter word the Taylor map is the binary operation, with the suspension sign carried by the degree-one Koszul twist of the first letter.

              theorem TauCeti.AInfinityAlgebra.taylor_of_three {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (a b c : A) :
              𝒜.taylor ((ReducedTensorWords.of R A 3) ((PiTensorProduct.tprod R) ![a, b, c])) = (𝒜.m 3) ![a, (𝒜.grading.koszulTwist 1) b, c]

              On a three-letter word the Taylor map is the ternary operation, with the suspension sign carried by the degree-one Koszul twist of the middle letter: the first letter is twisted by the trivial parameter two.

              The bar differential of a two-letter word: the unary operation applied to either letter, and the collapse of both letters to the binary operation. Koszul twists carry the suspension signs.

              @[simp]

              The unary operation squares to zero.

              theorem TauCeti.AInfinityAlgebra.m_one_koszulTwist {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (x : A) :
              (𝒜.m 1) ![(𝒜.grading.koszulTwist 1) x] = -(𝒜.grading.koszulTwist 1) ((𝒜.m 1) ![x])

              The unary operation anticommutes with the degree-one Koszul twist.

              theorem TauCeti.AInfinityAlgebra.koszulTwist_m_two {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (q : ℤ) (x y : A) :
              (𝒜.grading.koszulTwist q) ((𝒜.m 2) ![x, y]) = (𝒜.m 2) ![(𝒜.grading.koszulTwist q) x, (𝒜.grading.koszulTwist q) y]

              The binary operation has degree zero, so it commutes with every Koszul twist.

              theorem TauCeti.AInfinityAlgebra.m_one_m_two {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (x y : A) :
              (𝒜.m 1) ![(𝒜.m 2) ![x, y]] = (𝒜.m 2) ![(𝒜.m 1) ![x], y] + (𝒜.m 2) ![(𝒜.grading.koszulTwist 1) x, (𝒜.m 1) ![y]]

              The graded Leibniz rule for arbitrary inputs, with the sign on the second term carried by the degree-one Koszul twist of the left factor.

              theorem TauCeti.AInfinityAlgebra.m_one_m_three {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (x y z : A) :
              (𝒜.m 1) ![(𝒜.m 3) ![x, y, z]] = (𝒜.m 2) ![x, (𝒜.m 2) ![y, z]] - (𝒜.m 2) ![(𝒜.m 2) ![x, y], z] - (𝒜.m 3) ![(𝒜.m 1) ![x], y, z] - (𝒜.m 3) ![(𝒜.grading.koszulTwist 1) x, (𝒜.m 1) ![y], z] - (𝒜.m 3) ![(𝒜.grading.koszulTwist 1) x, (𝒜.grading.koszulTwist 1) y, (𝒜.m 1) ![z]]

              The arity-three Stasheff identity for arbitrary inputs, with the Koszul signs of the first two inputs carried by the degree-one twist. It expresses the associator of the binary operation as a unary boundary, modulo the three terms in which the ternary operation meets a unary boundary.

              theorem TauCeti.AInfinityAlgebra.m_two_assoc_of_m_three_eq_zero {R : Type uR} {A : Type uA} [CommRing R] [AddCommGroup A] [Module R A] (𝒜 : AInfinityAlgebra R A) (h₃ : 𝒜.m 3 = 0) (x y z : A) :
              (𝒜.m 2) ![(𝒜.m 2) ![x, y], z] = (𝒜.m 2) ![x, (𝒜.m 2) ![y, z]]

              If the ternary operation vanishes, the arity-three identity says that m₂ is associative.