Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generated
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.

Existence and uniqueness of complete filtered Maurer–Cartan gauge flow

Statement

In the setting of Completed polynomial gauge paths for filtered Maurer–Cartan elements, for every w∗∈MC⁡(P) and every a∈P−1[t]∧ there is a unique w∈P0[t]∧ with w(0)=w∗ and w′=q1w(a). It satisfies C(w)=0, so it is an elementary gauge path. Modulo every FpW the construction stabilizes after finitely many polynomial Picard iterations; no globally bounded polynomial degree is asserted.

Facts & Assumptions

Given: The filtered shifted L∞-algebra, P=F1W, w∗ and a of the statement.

[F1]

Completed polynomial gauge paths for filtered Maurer–Cartan elements supplies complete polynomial coefficients, integration, C and q1w.

[F2]

Filtered Taylor maps extend to the completed coaugmented symmetric coalgebra supplies the total-weight completed coaugmented symmetric coalgebra, the continuous unshuffle coderivation Q, and the convergent group-like exponential ew.

Proof

1.1givenF1F2construct

Apply [F2] to the identity Taylor morphism of W. In its completed coalgebra, multiplication Mw(x)=ewx is a continuous coalgebra automorphism with inverse M−w, because Δ(ewx)=(ew⊗ew)Δx. Consequently Qw=M−wQMw is a coderivation and (Qw)2=0. It may have a constant term, since Mw does not preserve coaugmentation. Expanding the unshuffle formula and choosing the inputs in the distinguished q-block gives q0w=C(w) and qnw(v1,…,vn)=∑j≥0qn+j(wj,v1,…,vn)/j! for n≥1: the indistinguishable degree-zero w inputs give exactly 1/j!. Every expression is finite modulo a fixed total weight, and hence converges.

1.2F1algebra

If x−y∈FrP[t]∧ and a∈F1P−1[t]∧, then q1x(a)−q1y(a)∈Fr+1P[t]∧. The unary terms cancel; each term in the multilinear telescoping expansion of every remaining difference contains x−y and a, giving filtration at least r+1. The other inputs have positive filtration. This calculation is finite modulo each Fp.

2.1step 1.1algebra

In particular Qw(1)=C(w) and Qw(a)=C(w)a+q1w(a). Applying (Qw)2 to a and projecting to length one gives (q1w)2(a)+q2w(C(w),a)=0: the length-two term C(w)a contributes q2w(C(w),a) and the length-one term contributes (q1w)2(a); other lengths do not survive projection. Applying the same operation to 1 gives q1w(C(w))=0. These identities also hold over completed polynomial coefficients, quotient by quotient.

2.2F1step 1.2construct

Set w0(t)=w∗ and wj+1(t)=w∗+∫0tq1wj(u)(a(u))du. The first difference lies in F1; step 1.2 and induction give wj+1−wj∈Fj+1. Thus the sequence stabilizes in each quotient, where all iterates are genuine polynomials. Completeness defines w∈P0[t]∧. Reduction, integration and differentiation commute, so w(0)=w∗ and w′=q1w(a).

3.1F1step 1.2step 2.2algebra

If two solutions have the same initial value, their difference obeys the difference of the integral equations. It first lies in F1, and step 1.2 forces it successively into every Fr. Separation gives equality.

4.1F1step 2.1step 2.2step 3.1algebra∎

Termwise differentiation in each finite quotient gives ddtC(w)=q1w(w′). Hence E=C(w) satisfies E′=−q2w(E,a) by step 2.1, and E(0)=0. Its integral equation is E(t)=−∫0tq2w(u)(E(u),a(u))du. Initially E∈F1; if E∈Fr, the right side lies in Fr+1 because a∈F1. Induction and separation give E=0, completing both existence on the Maurer–Cartan locus and uniqueness.

Depends on

Used by

Dependency tree · two levels

5 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