Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-05 (gpt-6.1-sol)
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.

Spanning by analytic nested universal tensor components with real weights

Statement

Let a finite binary tree of representing P(z)-products have strongly graded generalized-module objects with real weights and objectwise uniformly nilpotent L(0)−L(0)s. Assume the binary products have the restricted-dual realization and component-spanning property of the strong dual-representation theorem. Reconstruct the universal logarithmic intertwiners with fixed endpoint logarithms. Suppose the scalar sums over all intermediate weights converge absolutely throughout an open nested sewing domain and define analytic functions there, also after arbitrary finite insertions of L(−1) on the leaves. Continue these functions along one specified configuration-space path. Then, at each nonsingular continuation germ, the doubly homogeneous components of all continued nested universal-map values span the root module as a vector space. No finite-exponent-coset or discreteness hypothesis is imposed.

Facts & Assumptions

Given: Exactly the actual tree, real weights, objectwise nilpotence bounds, and analytic convergence stipulated in the Statement. The lemma supplies spanning; it does not assert this convergence for an arbitrary tree without those hypotheses.

[F1]

Strongly graded P(z) products from restricted-dual images gives binary component spanning and finite-dimensional doubly homogeneous root components.

[F2]

Logarithmic reconstruction and parallel transport of P(z)-products reconstructs universal intertwiners and their endpoint branches. Logarithmic intertwining operator supplies the derivative identity, translation bracket and weight rule.

[F3]

Absolute exponential-polynomial expansions with real exponents proves normality and uniqueness of real-exponent series with uniformly bounded logarithmic degree, including arbitrary nondiscrete real supports.

Proof

1.1givenF2F3algebra

The mode weight rule and the objectwise nilpotence bounds express every scalar tree series, in the logarithms of its sewing coordinates, as a real-exponential series with one finite bound on each logarithmic degree. For several sewing coordinates, the normality proof of F3 applies on a product rectangle: interpolate on a finite tensor product of imaginary-translate grids to separate the log-polynomial coefficients, then dominate each exponential on a smaller rectangle by its value at one of the 2r real corners of the larger rectangle. The coefficient sums at those corners are finite by the given absolute convergence. Factors ∣n1∣k1⋯∣nr∣kr from derivatives are bounded by an exponential margin, since ∏j∣nj∣kje−ϵ∑j∣nj∣ is bounded. Thus the full scalar projection sums and all sewing derivatives are locally normally convergent. This proves the derivative manipulations used below from the actual all-index absolute convergence, rather than from an iterated grouped sum.

2.1F1F2step 1.1algebra

If the indicated span were proper, choose a nonzero restricted functional f on one finite-dimensional doubly homogeneous root component annihilating that span. For every collection of leaves its scalar coefficient therefore vanishes at the specified configuration. Absolute leaf-position derivatives are linear combinations of coefficients with L(−1) inserted on leaves: at each vertex the first-input derivative differentiates its relative sewing coordinate, and the translation bracket expresses the derivative at its root as the sum of derivatives at its two children. This triangular system has unit diagonal, so induction down the tree expresses every absolute derivative as a finite linear combination of such leaf insertions. The same holds for every finite repeated derivative. They vanish at the specified configuration, since the annihilation hypothesis holds for all leaf vectors, including those inserted vectors. By step1.1 these are the actual Taylor derivatives. Taylor uniqueness makes each coefficient zero in a neighborhood. Analytic continuation back along the specified path makes it zero throughout its initial connected sewing domain, by finitely many overlapping neighborhoods and the identity theorem.

3.1F2F3step 1.1step 2.1algebra

Fix all sewing variables except one deepest variable, and fix all leaf generalized-weight components. Its formal scalar expansion is ∑hqh−c∑j=0Nah,j(log⁡q)j, with real h,c and finite N; its coefficients are precisely the finite intermediate-weight projections prescribed by the tree. It converges absolutely on a complex logarithm neighborhood by step1.1 and is zero there by step2.1. Apply F3 after s=log⁡q. Every coefficient ah,j is zero. Thus f annihilates every tree coefficient in which that deepest universal map has first been projected to one finite generalized-weight component. There is no need to separate exponents by monodromy or assume finitely many exponent classes: F3 performs exactly this coefficient extraction for arbitrary real weights.

4.1F1step 3.1algebra∎

By F1 the deepest map's homogeneous components span its binary product algebraically. The zero assertion of step3.1 therefore holds with that subtree replaced by an arbitrary vector of its root object. Repeat step3.1 on a deepest remaining vertex. After finitely many repetitions only the top binary product remains; F1 then says f annihilates all of the original root module. This contradicts the nonzero choice of f. Hence the nested universal components span, as asserted.

Depends on

Dependency tree · 2 levels

Sources