Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Filtered L∞-morphisms preserve completed polynomial gauge equivalence

Statement

Let f:W→Z be a filtered L∞-morphism between complete filtered shifted algebras over a characteristic-zero field. It induces a map on Maurer–Cartan elements by Filtered L∞-morphisms preserve Maurer–Cartan elements and compose on solutions. It carries every completed polynomial gauge path of Completed polynomial gauge paths for filtered Maurer–Cartan elements to such a path and preserves its endpoints. Consequently it induces a map on the equivalence classes generated by those paths. These induced maps preserve identities and composition.

Put P=F1W, with its complete induced filtration, and similarly P′=F1Z. Scalar extension below is on these positive ideals. More explicitly use right-placed forms, Ω=k[t,dt], ∣t∣=0, ∣dt∣=1, d(t)=dt, (dt)2=0, and the completion

P⊗^Ω=lim←⁡N((P/FNW)⊗Ω).

Let w(t)∈F1(P⊗^k[t])0 and a(t)∈F1(P⊗^k[t])−1 satisfy

cq(w(t))=0,w′(t)=q1w(t)(a(t)),q1w(a)=∑n≥0qn+1(wn,a)n!.

Then their image path and parameter are

u(t)=f∗(w(t)),b(t)=∑n≥0fn+1(w(t)n,a(t))n!,

and satisfy cr(u(t))=0, u′(t)=r1u(t)(b(t)), with endpoints u(0)=f∗(w(0)) and u(1)=f∗(w(1)). Each coefficient function is polynomial modulo every FN; no common bound on its polynomial degree is assumed. The assertion includes the unique flows of Existence and uniqueness of complete filtered Maurer–Cartan gauge flow.

For clarity, extension to an arbitrary commutative dg scalar algebra A is part of the assertion. With P factors placed before scalar factors and homogeneous xi∈P, ai∈A, the shifted operations and morphism coefficients on P⊗^A are

q1A(x⊗a)=q1(x)⊗a+(−1)∣x∣x⊗dAa,

qnA(x1⊗a1,…,xn⊗an)=(−1)∑i<j∣ai∣∣xj∣qn(x1,…,xn)⊗a1⋯an(n≥2),

fnA(x1⊗a1,…,xn⊗an)=(−1)∑i<j∣ai∣∣xj∣fn(x1,…,xn)⊗a1⋯an(n≥1).

These define complete filtered shifted L∞-algebras and a filtered morphism, natural in dg algebra maps A→B. Their Maurer–Cartan pushforwards satisfy the same curvature and composition formulas as over the original field. This restriction is essential when the original filtration bounds do not control inputs outside F1W.

Facts & Assumptions

Given: The filtered morphism and completed polynomial gauge path in the statement; the scalar extension uses the stated tensor order and Koszul signs.

[F1]

Filtered L∞-morphisms preserve Maurer–Cartan elements and compose on solutions proves the convergent curvature transformation and composition identities for filtered Taylor maps, using the total weight completed coaugmented coalgebra.

[F2]

Completed polynomial gauge paths for filtered Maurer–Cartan elements defines completed polynomial gauge paths and the equivalence relation generated by their endpoints.

[F3]

Existence and uniqueness of complete filtered Maurer–Cartan gauge flow supplies the unique completed polynomial flow for an admissible parameter and initial Maurer–Cartan element.

Proof

1.1givenF1constructalgebra

For any dg scalar algebra A put P⊗^A=lim←⁡N((P/FNW)⊗A), with filtration the kernels of the projections. Each projection is surjective: lift the finitely many coefficients of any algebraic tensor to P, giving a compatible element of the inverse limit. The quotient by its kernel is therefore exactly the displayed algebraic tensor product. The limit is complete and separated, degreewise. Tensoring over the field preserves exact sequences, so each graded filtration layer is its corresponding algebraic tensor product with A. Here every input lies in P, so the additive filtration bounds also show independence of the chosen representatives modulo FNW. The operations in the statement are well defined on every quotient, and the input filtration indices add under each operation; they thus extend continuously to the limit.

2.1givenstep 1.1algebra

To verify the signs and identities on algebraic tensors, move each scalar ai past every later W factor xj, then apply the W operation and multiply the scalars in their original order. This gives precisely the exponent ∑i<j∣ai∣∣xj∣. This movement respects substitution: the product of its signs in two substituted operations is the sign of the composite permutation, including the sign of moving a degree-one inner operation across earlier inputs. Consequently the part of each shifted Jacobi identity involving only the extended qn is the original W identity multiplied by the common ordered scalar product. Its sum is zero. Write D(x⊗a)=(−1)∣x∣x⊗dAa for the scalar differential. For an extended operation of degree d, let E=∑i<j∣ai∣∣xj∣. The coefficient of the scalar product with dAai in the output differential has sign exponent E+∑j∣xj∣+d+∑j<i∣aj∣. The same coefficient obtained by applying the tensor differential to the ith input first has exponent E+∑j∣xj∣+∑j<i∣aj∣: the extra scalar crossing signs are ∑j>i∣xj∣, and the tensor differential contributes ∑j<i(∣xj∣+∣aj∣)+∣xi∣. Thus the two expressions differ by (−1)d. For d=1 this proves that D anticommutes with each extended qn. Also D2=0. Thus the full coderivation with unary term q1A squares to zero. This checks the scalar-differential terms as well as the original Jacobi terms.

3.1F1step 1.1step 2.1algebra

The same permutation and substitution verification transfers FQ=RF to scalar tensors. Here each fn has degree zero, so the scalar differential commutes with fn; its Leibniz expansion supplies precisely all the terms in which a scalar differential appears on an input. Thus the stated fnA form a filtered morphism. These are finite identities on each algebraic tensor and each fixed arity. They descend to every quotient and hold on the inverse limit by continuity. Any dg algebra map ρ:A→B preserves scalar products, scalar differentials and degrees, so id⁡⊗^ρ commutes with all these operations. Applying [F1] to the extended algebras proves their curvature and composition identities; in particular ρ∗(f∗A(z))=f∗B(ρ∗(z)).

3.2F2step 1.1step 2.1algebra

For A=Ω, every total-degree-zero element in the positive ideal has a unique expression z=w(t)−a(t)dt with the degrees in the statement. All these functions are polynomials at each quotient and their degrees may grow with N. Differentiation, multiplication and evaluation at any λ∈k are defined quotientwise and respect the transition maps. The scalar differential of w contributes w′(t)dt. The input −a(t)dt appearing once in qn+1Ω contributes −qn+1(w(t)n,a(t))dt: place this input last, so it crosses no later W factor. Because w and −adt both have total degree zero, its n+1 possible positions contribute equally, changing 1/(n+1)! to 1/n!. Two such inputs vanish because (dt)2=0, and the scalar differential of a(t)dt vanishes for the same reason. Hence cqΩ(z)=cq(w(t))+(w′(t)−q1w(t)(a(t)))dt. In particular the equations in the statement are exactly the Maurer–Cartan equation for z.

4.1F1step 3.1step 3.2algebra

Applying the identical one-marked-input computation to f∗Ω gives f∗Ω(z)=u(t)−b(t)dt, where u=f∗w and b=∑n≥0fn+1(wn,a)/n!. Each summand of the latter series lies in filtration n+1; the corresponding statement for u is [F1]. Thus only finitely many terms survive in each quotient, and these terms are polynomials. By curvature transformation over Ω from step 3.1, z Maurer–Cartan implies u−bdt Maurer–Cartan. The curvature decomposition of step 3.2 applied on Z now proves cr(u)=0 and u′=r1u(b).

5.1F1F2F3step 3.1step 3.2step 4.1algebra

Evaluation ev⁡λ:Ω→k, t↦λ, dt↦0, is a dg algebra map. Naturality in step 3.1 yields ev⁡λf∗Ω(z)=f∗(w(λ)). In particular the endpoint values are precisely those in the statement. If the input path is specified as the unique flow supplied by [F3], it satisfies the equations in step 3.2; its image satisfies the corresponding target flow equations and is the target flow for b and initial value f∗(w(0)) by [F3]. This proves the assertion for every such input parameter as well.

6.1F1F2step 3.1step 4.1step 5.1algebra∎

Every generating endpoint pair for the equivalence relation in [F2] maps, by the path and endpoint calculations, to another such pair. Finite chains of generating pairs and their reverses therefore map to chains of the same kind; equality maps to equality. This proves preservation of the generated equivalence relation without claiming that a concatenation itself is polynomial. Composition and identities over Ω follow from step 3.1 and [F1]. Explicitly, for successive g the output parameter is ∑j≥0gj+1(uj,b)/j!=∑n≥0hn+1(wn,a)/n!: in the composite partition formula exactly one f block contains a. Thus the point and parameter components both compose, as do the induced quotient maps. Every equality holds modulo each FN and hence in the separated inverse limit; no globally polynomial bound or analytic integration was invoked.

Depends on

Used by

Dependency tree · two levels

6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources