Closed Formulas for η-Corrections in the Once Punctured Torus
Pith reviewed 2026-05-18 21:22 UTC · model grok-4.3
The pith
Closed formulas for η-corrections in punctured torus skein algebra
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We give a closed formula for the Chebyshev-threaded family generated by the primitive determinant-two pair P_n=T_n((1,2))·(1,0). The correction ε_n has an explicit Chebyshev expansion whose coefficients factor as geometric sums in t^{±4} and whose terms are governed by a parity pattern arising from the Chebyshev recurrence. We also treat a primitive maximal-thread regime, in which one Frohman--Gelca summand is fully threaded and the other is simple or doubly covered. In this case the discrepancy is an explicit η-linear cascade with Chebyshev S-coefficients, lowering the thread degree by two at each step. These formulas recover the relevant low-determinant behavior and give compact closed mul
What carries the argument
The correction ε_n to the product in the Chebyshev-threaded family, given by an explicit expansion in Chebyshev polynomials with coefficients that are geometric sums in t to the plus or minus fourth and selected by a parity rule from the recurrence.
If this is right
- The closed formulas provide explicit multiplication for the entire infinite family of P_n without needing case-by-case skein resolutions.
- The geometric sum coefficients allow evaluation at any specific t value for any n.
- The parity pattern distinguishes the terms present for even and odd indices in the expansion.
- The maximal-thread cascade reduces the problem step by step, multiplying by η and lowering thread degree by two each time.
Where Pith is reading between the lines
- These explicit expressions could serve as a template for finding corrections in skein algebras of other surfaces with punctures.
- Combining the primitive cases using the algebra's relations might yield formulas for non-primitive threaded families.
- The structure of the geometric sums in t^{±4} may point to a generating function approach for all corrections at once.
Load-bearing premise
The η-corrections to the Frohman-Gelca multiplication on the punctured torus lie in the ideal generated by η and admit an expansion in the Chebyshev basis with geometric coefficients.
What would settle it
Compute the actual product of two low-index elements from the family using the defining skein relations of the algebra and check whether the coefficient of η matches the formula's prediction for that n.
read the original abstract
We study $\eta$-correction terms in the Kauffman bracket skein algebra of the once-punctured torus $K_t(\Sigma_{1,1})$. While the Frohman--Gelca product-to-sum rule gives an explicit multiplication formula on the closed torus, the once-punctured torus introduces correction terms in the ideal $(\eta)$. We give a closed formula for the Chebyshev-threaded family generated by the primitive determinant-two pair \[ P_n=T_n((1,2))\cdot(1,0). \] The correction $\epsilon_n$ has an explicit Chebyshev expansion whose coefficients factor as geometric sums in $t^{\pm4}$ and whose terms are governed by a parity pattern arising from the Chebyshev recurrence. We also treat a primitive maximal-thread regime, in which one Frohman--Gelca summand is fully threaded and the other is simple or doubly covered. In this case the discrepancy is an explicit $\eta$-linear cascade with Chebyshev $S$-coefficients, lowering the thread degree by two at each step. These formulas recover the relevant low-determinant behavior and give compact closed multiplication rules for structured threaded families in $K_t(\Sigma_{1,1})$.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims to derive closed-form expressions for the η-correction terms ε_n in the Kauffman bracket skein algebra K_t(Σ_{1,1}) of the once-punctured torus. For the Chebyshev-threaded family generated by the primitive determinant-two pair P_n = T_n((1,2)) · (1,0), the correction ε_n admits an explicit Chebyshev expansion whose coefficients are geometric sums in t^{±4} and obey a parity pattern induced by the Chebyshev recurrence. A second regime of primitive maximal-thread products is treated, yielding an explicit η-linear cascade whose S-coefficients lower thread degree by two at each step. Both families are asserted to recover the known low-determinant cases and to furnish compact multiplication rules modulo the ideal (η).
Significance. If the derivations are correct, the explicit Chebyshev expansions and the cascade formulas constitute a concrete advance: they convert the abstract Frohman–Gelca product-to-sum identity into computable closed rules for infinite structured families in K_t(Σ_{1,1}). The recovery of low-determinant verifications supplies an immediate consistency check, and the parity and geometric-sum structures are falsifiable predictions that can be tested directly for small n.
major comments (2)
- [§3] §3, after Eq. (3.7): the statement that the coefficients of ε_n factor as geometric sums in t^{±4} is asserted without an explicit closed-form expression or an induction that isolates the sum for arbitrary n; the recurrence alone does not immediately yield the claimed factorization, so the central closed-form claim for the threaded family rests on an unshown algebraic step.
- [§4] §4, the cascade construction: while the degree-lowering property is plausible, the proof that each successive discrepancy term remains η-linear (rather than acquiring higher powers of η) is only indicated by the recurrence; an explicit verification that the ideal membership is preserved at every step is needed to support the claim for the maximal-thread regime.
minor comments (2)
- [Abstract] The abstract and §1 use the notation P_n = T_n((1,2)) · (1,0) without a one-sentence reminder of the threading operation; a brief parenthetical definition would improve readability for readers outside the immediate subfield.
- [§3] Low-determinant checks are mentioned but not displayed; a short table or explicit computation for n ≤ 3 would make the consistency claim immediately verifiable.
Simulated Author's Rebuttal
We thank the referee for the careful reading of our manuscript and for the constructive major comments. We address each of them below and will incorporate revisions to strengthen the presentation of the closed-form expressions and the cascade construction.
read point-by-point responses
-
Referee: [§3] §3, after Eq. (3.7): the statement that the coefficients of ε_n factor as geometric sums in t^{±4} is asserted without an explicit closed-form expression or an induction that isolates the sum for arbitrary n; the recurrence alone does not immediately yield the claimed factorization, so the central closed-form claim for the threaded family rests on an unshown algebraic step.
Authors: We thank the referee for highlighting this point. The factorization into geometric sums is derived in the manuscript by applying the Chebyshev recurrence iteratively to the correction term ε_n and collecting like terms. The resulting coefficients are sums of the form ∑_{k=0}^{floor(n/2)} t^{±4k} with signs determined by parity. To address the concern, we will add an explicit statement of the closed-form coefficient formula immediately after Equation (3.7) and include a short inductive verification in the revised manuscript. revision: yes
-
Referee: [§4] §4, the cascade construction: while the degree-lowering property is plausible, the proof that each successive discrepancy term remains η-linear (rather than acquiring higher powers of η) is only indicated by the recurrence; an explicit verification that the ideal membership is preserved at every step is needed to support the claim for the maximal-thread regime.
Authors: We agree that an explicit verification of η-linearity preservation would improve the rigor of the argument. In the revised version, we will include a proposition in §4 that proves by induction on the thread degree that each discrepancy term lies in the ideal (η). The base case is verified directly, and the inductive step follows from the fact that the Frohman-Gelca product formula, when applied to a threaded element and an η-linear term, produces only η-linear outputs. We will also provide a concrete computation for small thread degrees to illustrate the pattern. revision: yes
Circularity Check
Derivation builds on external Frohman-Gelca rule with independent closed-form expansions
full rationale
The paper adapts the established Frohman-Gelca product-to-sum identity (an external prior result) to derive explicit Chebyshev expansions for the η-corrections ε_n attached to the threaded family P_n = T_n((1,2))·(1,0) and for the maximal-thread regime. These expansions are obtained by direct algebraic manipulation modulo the ideal (η), using the Chebyshev recurrence to produce parity patterns and geometric-sum coefficients in t^{±4}, with recovery of low-determinant cases serving as an immediate consistency check. No load-bearing step reduces by construction to a fitted input, self-definition, or self-citation chain; the central claims supply new closed multiplication rules that remain falsifiable against the skein algebra relations and external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Frohman-Gelca product-to-sum rule holds on the closed torus
- standard math Chebyshev polynomials obey their standard recurrence and parity properties
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel; costAlphaLog_fourth_deriv_at_zero echoes?
echoesECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.
ϵ_n = η ∑_{k=0}^{⌊(n-1)/2⌋} (T_{n-1-2k}((1,2)) − δ…) L_k where L_k = ∑_{l=-k}^k t^{4l}; recurrence P_n = (1,2)·P_{n-1} − P_{n-2} with parity-dependent η creation
-
IndisputableMonolith/Foundation/AlexanderDuality.leanalexander_duality_circle_linking; linking_dimension echoes?
echoesECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.
primitive maximal-thread regime … η-linear cascade … lowers the thread degree by two at each step; Chebyshev S-coefficients
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.