Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5.10, p. 16 — (∫L)ₘ = (∫τ<ₙL)ₘ for n ≥ m

Proved
IntLInfty.Kan.proof_5_10_levels

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

l-infinity-algebrap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1postnikov-towersimplicial-manifold

Let LLL be a non-negatively graded L∞L_\inftyL∞​-algebra, finite dimensional in each degree, and fix r≥1r \ge 1r≥1. For all m≤nm \le nm≤n, the restriction map ∫L→∫τ<nL\int L \to \int \tau_{<n}L∫L→∫τ<n​L, induced by the inclusion C∗(τ<nL)⊆C∗(L)C^*(\tau_{<n}L) \subseteq C^*(L)C∗(τ<n​L)⊆C∗(L), is a bijection at level mmm:

(∫L)m=(∫τ<nL)m(n≥m).\Big(\textstyle\int L\Big)_m = \Big(\textstyle\int \tau_{<n}L\Big)_m \qquad (n \ge m).(∫L)m​=(∫τ<n​L)m​(n≥m).

In the proof of Theorem 5.10 this transfers the Kan condition from the pieces ∫τ<nL\int\tau_{<n}L∫τ<n​L to ∫L\int L∫L: a horn at level mmm only sees generators of degree ≤m\le m≤m, on which LLL and τ<nL\tau_{<n}Lτ<n​L agree.

Differences from the source:

  • encoding: an L∞-algebra: brackets [ ], [ , ], … of degrees −1, 0, 1, …, whose axioms are δ² = 0 for the induced derivation δ of C∗(L) (§1.1, p. 1); non-negatively graded, finite dimensional in each degree (p. 13) → L : ℕ → Type with FiniteDimensional ℝ (L i) for every i, and δ : LInfty L, a linear map of degree +1 on CE L that is a graded derivation with δ ∘ δ = 0; reason: §1.1: a degree-one derivation of C∗(L) with δ² = 0 is the same thing as the brackets with their axioms; no sign convention for the brackets is needed
  • encoding: C∗(L) = Sym(L∨), graded-commutative, L∗ᵢ in degree i + 1 (§1.1, p. 1) → CE L = ExteriorAlgebra(⊕{i even} L∗ᵢ) ⊗ SymmetricAlgebra(⊕{i odd} L∗ᵢ), with the generator map gen and the degree pieces ceDeg; reason: generators of odd degree anticommute and those of even degree commute; the plain tensor product is the graded one because the symmetric factor is concentrated in even degrees
  • encoding: the Postnikov pieces τ≤ₙL, τ<ₙL with the brackets inherited from L (Definition 5.6, p. 14), and ∫ of them → generator systems tauLe δ n, tauLt δ n: L∗ᵢ for i < n, kerSub δ n = ker ∂ₙ₊₁∗ resp. imSub δ n = im ∂ₙ∗ for i = n, 0 above (tauLt δ 0 = 0); ker ∂ₙ₊₁∗ = {ξ | δξ ∈ subalgebra generated by L∗{≤n}}, im ∂ₙ∗ = {ξ | ∃ η ∈ L∗ₙ₋₁, δη − ξ ∈ subalgebra generated by L∗{≤n−1}}; ∫ of a piece = DGA maps out of the subalgebra it generates; reason: the projection L → τL dualizes to an injective DGA map C∗(τL) → C∗(L) whose image is this subalgebra, since (coker ∂ₙ₊₁)∗ = ker ∂ₙ₊₁∗ and (im ∂ₙ)∗ ≅ (Lₙ/ker ∂ₙ)∗ = im ∂ₙ∗; the characterizations hold because the nonlinear part of δ on L∗ₙ only involves L∗_{≤n}, and they do not depend on the sign of the transpose
  • encoding: de Rham forms on the m-simplex Δᵐ; Ωⁿ_{Cʳ}(M) = {α of class Cʳ | dα of class Cʳ} with its Banach topology (Convention 5.1, p. 13) → forms are ExteriorAlgebra((ℝᵐ)∗)-valued functions on ℝᵐ, only their values on the corner simplex {t ≥ 0, ∑ t ≤ 1} matter; d uses derivatives within Δᵐ; Ωⁿ_{Cʳ}(Δᵐ) = CrForms r m n, the closed span of the jets (all partial derivatives of order ≤ r of the coefficients of α and of dα, restricted to Δᵐ, sup norms); reason: this jet norm is equivalent to the Cʳ norm on α and dα; the jet image of these forms is closed, so the closed span is the space itself; faces are pullbacks along the affine cofaces of (3)
  • encoding: (∫L)ₘ = Hom_DGA(C∗(L), Ω∗(Δᵐ)) (Definition 5.2, (20)) → integ r δ S m ⊆ Amb r S m: the tuples (φ(gen bₖ)){i<m, k} of images of a chosen basis bₖ of each generator space S i, i < m, over the algebra maps φ from the subalgebra generated by S into forms that send L∗ᵢ to (i+1)-forms, take values in Ω∗{Cʳ} and satisfy d ∘ φ = φ ∘ δ on Δᵐ (IsDGAMap); reason: a DGA map out of a free graded-commutative algebra is determined by the images of its generators, and generators of degree > m go to 0 on Δᵐ; the choice of basis changes no topology
  • reading: the equality (∫L)ₘ = (∫τ<ₙL)ₘ for n ≥ m → the restriction map res : Amb r ⊤ m → Amb r (tauLt δ n) m is a bijection from integ r δ ⊤ m onto integ r δ (tauLt δ n) m (Set.BijOn); reason: the equality is the canonical map; res is a linear change of basis on the ambient spaces, so it identifies the two subsets as manifolds
Preamble
import Mathlib
import Definitions.Def_IntLInfty_Kan_CE
import Definitions.Def_IntLInfty_Kan_Forms
import Definitions.Def_IntLInfty_Kan_Manifold
import Definitions.Def_IntLInfty_Kan_Integ
Formal statement
namespace IntLInfty.Kan

theorem proof_5_10_levels (r : ℕ) (hr : 1 ≤ r) (L : ℕ → Type) [∀ i, AddCommGroup (L i)]
    [∀ i, Module ℝ (L i)] [∀ i, FiniteDimensional ℝ (L i)] (δ : LInfty L) (m n : ℕ) (hmn : m ≤ n) :
    Set.BijOn (res (S := ⊤) (S' := tauLt δ n) (fun i => le_top) (r := r) (m := m))
      (integ r δ ⊤ m) (integ r δ (tauLt δ n) m) := by sorry

end IntLInfty.Kan
Source
Henriques, Integrating L∞-algebras, arXiv:math/0603563v2, p. 16, proof of Theorem 5.10, first paragraph
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me