Preprint
Article

This version is not peer-reviewed.

No–Inflation Under Pachner Moves for Teichmüller State–Integrals: A DSFL Residual Monotonicity Theorem

Submitted:

24 October 2025

Posted:

27 October 2025

You are already at the latest version

Abstract
We establish a no-inflation (monotonicity) theorem for a residual that measures calibrated mismatch in Teichm\"uller state-integral models built from the Faddeev quantum dilogarithm. For the elementary $2\!\leftrightarrow\!3$ and $1\!\leftrightarrow\!4$ Pachner moves, cutting and gluing are recast in a single boundary Hilbert geometry, with ``admissible'' kernel maps that intertwine the calibration and do not expand norm. The pentagon identity then makes the induced gluing operator an isometry, so the residual cannot increase. Consequently, this residual is a Lyapunov functional for triangulation updates: pipelines of local moves are certified to be stable, and exact recursions inherit monotone decay, with quantitative conditioning controlled by principal--angle bounds between polarizations. The paper also provides a minimal, reproducible verification harness that enforces intertwining and nonexpansion and checks move-by-move monotonicity on standard examples. The result upgrades gluing stability from an assumption to a theorem and offers an algorithm-ready certification layer for Teichm\"uller TQFT computations.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

This paper turns cutting and gluing stability in Teichmüller TQFT into a theorem: Pachner moves act as calibration–intertwining contractions in a single comparison Hilbert geometry, so any triangulation change provably cannot worsen a calibrated error; we quantify robustness, polarization angles and conditioning, recursion decay, and provide a practical certification framework.
Cutting and gluing lie at the heart of low–dimensional quantum topology and of state–integral realizations of Chern–Simons/Teichmüller TQFT [1,2,3,4]. In practice, computations based on ideal triangulations or exact recursion repeatedly replace one local presentation by another via Pachner moves [5]. What has been missing is a certifiable stability law ensuring that these rearrangements do not amplify numerical or analytic mismatch at the gluing interface. We supply such a law: a no-inflation (monotonicity) theorem for a calibrated residual—the DSFL residual—under the elementary Pachner moves 2 3 and 1 4 in the Teichmüller state–integral class [3,6,7]. The mechanism is simple: unitarity of the edge operator together with the five-term (pentagon) identity yields a boundary isometry that intertwines the calibration, so the residual cannot increase. The result upgrades gluing from an assumption to a rate-certified, algorithm-ready invariant, with explicit angle and recursion bounds that make computations, proofs, and software in Teichmüller TQFT trustworthy, modular, and mechanically verifiable.

Primitives and the single observable. 

Fix a boundary component Σ with a chosen polarization (e.g. shear or Fenchel–Nielsen). We attach: (i) a comparison Hilbert space H Σ for boundary data, (ii) a statistical channel S Σ (blueprint variables) and a physical channel P Σ H Σ (response amplitudes), and (iii) a calibration pair ( I Σ , J Σ ( + ) ) with
I Σ : S Σ P Σ , J Σ ( + ) : P Σ S Σ , I Σ J Σ ( + ) = id P Σ , J Σ ( + ) I Σ = P S Σ ,
where P S Σ denotes the orthogonal projector in the comparison geometry. Concretely, the polarization determines a pointer (diagonal) MASA in B ( H Σ ) ; J Σ ( + ) is the orthogonal conditional expectation onto that MASA and I Σ its adjoint realization on states [8,9]. In Teichmüller theory, H Σ is the modular–double L 2 space of boundary coordinates [3,10].
Given boundary data ( s , p ) S Σ P Σ , we measure calibrated mismatch by
R Σ ( s , p ) : = p I Σ s H Σ 2 .
This residual is canonical once the boundary chart is fixed and enjoys three basic properties that we exploit throughout: (a) invariance under unitary reparametrizations of the boundary chart U : H Σ H Σ and bounded changes of statistical coordinates V : S Σ S Σ ,
U p U I Σ V 1 V s 2 = p I Σ s 2 ;
(b) convexity and continuity in each argument (Hilbert norm calculus); and (c) cylinder idempotence on collars, implemented by the DSFL projector Π DSFL , Σ onto the nullspace of e : = p I Σ s in H Σ , so Π DSFL , Σ Π DSFL , Σ = Π DSFL , Σ and the cylinder acts as the identity on residual classes.
In this language, a gluing step is admissible when the induced boundary maps ( Φ ˜ , Φ ) intertwine the calibration and are nonexpansive in H Σ ,
Φ I Σ = I Σ Φ ˜ , Φ H H 1 ,
in which case the data–processing inequality holds:
R Σ ( Φ ˜ s , Φ p ) R Σ ( s , p ) .
All Teichmüller Pachner moves furnish such admissible pairs because the edge operator is unitary and satisfies the pentagon identity, making the boundary gluing operator a projective isometry that intertwines the calibration [3,6,7].

What we prove. 

In the Teichmüller kernel class (Faddeev quantum dilogarithm), the edge operator T is unitary and satisfies the five–term (pentagon) identity [6,7]. These two facts imply that the boundary operator implementing each Pachner move is a (projective) isometry on H Σ and that it intertwines the calibration [3,10]. Consequently, for any boundary datum ( s , p ) ,
R glue ( T , Σ ) = R Σ ( Φ ˜ s , Φ p ) R Σ ( s , p ) = R glue ( T , Σ ) ,
i.e. the DSFL residual cannot increase under a single move, hence along any move sequence. In short, gluing in Teichmüller TQFT is residually non–expansive.

Why it matters. 

  • Triangulation robustness. Residual monotonicity makes R glue a Lyapunov functional along triangulation updates, certifying that exact–recursion pipelines cannot worsen calibrated mismatch [3,5].
  • Algorithmic reliability. The same inequality provides a priori control for state–sum/ state–integral compilers that simplify triangulations by local moves, and it interfaces with stepwise error accounting; see also exact/recursive implementations in related state–integral programs [4,11].
  • Clean separation of concerns. Analytic special–function estimates are not needed: once maps are isometric/contractive and intertwine ( I , J ( + ) ) , the inequality is a two–line argument in H Σ (Cauchy–Schwarz in the comparison geometry), with the calibration/expectation behaving as in [12].

Conceptual position. 

The result is a concrete instance of the DSFL paradigm: formulate dynamics and sewing in a single comparison geometry, enforce admissibility (intertwining + non–expansion), and read all “axioms” (gluing stability, cylinder identity) as consequences for one quadratic functional. Here, unitarity + pentagon [7,13]⇒ admissibility; DSFL then turns admissibility into no–inflation.

Scope and hypotheses. 

We work in the Teichmüller state–integral setting where: (i) boundary spaces are L 2 –type (modular double) Hilbert spaces attached to ideal triangulations [3,10], (ii) the edge operator T is unitary [7], (iii) the five–term identity implements 2 3 [6], (iv) unit/counit blocks implement 1 4 [3], and (v) calibration maps ( I , J ( + ) ) are chosen compatibly with boundary restriction and orthogonal conditional expectation (pointer algebra) [12]. Within this envelope, every local move is an admissible map in the sense of (2).

Contributions (at a glance). 

(1)
Theorem 5: No–inflation under Pachner moves for R glue in the Teichmüller kernel class; R glue is Lyapunov along any finite move sequence [5,6,7].
(2)
Mechanism: Unitarity + pentagon ⇒ boundary isometry and calibration intertwining ⇒ residual monotonicity (two–line proof) [3,7,10].
(3)
Verification harness: A minimal, reproducible testbed (mock admissible kernels) that checks move–by–move monotonicity on standard manifolds and reports conditioning proxies (cf. numerical pipelines in [4,14]).

Proof idea in one line. 

Let e : = p I s . Intertwining gives Φ p I Φ ˜ s = Φ e ; non–expansion gives Φ e H e H ; hence R ( Φ ˜ s , Φ p ) R ( s , p ) . “Pentagon + unitarity” provides the admissible Φ in the Teichmüller setting [3,6,7].

Organization. 

Section 2 (renamed Setting and standing hypotheses) fixes the comparison geometry, calibration, and admissible class. Section 3 states and proves the no–inflation theorem. Section 4 recalls why Teichmüller kernels satisfy admissibility (unitarity and the pentagon identity). Section 5 outlines the verification harness and acceptance criteria.

2. Setting and Standing Hypotheses

Boundary comparison geometry. 

For a boundary surface Σ with ideal triangulation, set the comparison Hilbert space H Σ L 2 ( R E ( Σ ) ) (or the Plancherel space for the modular double) as in the Teichmüller/quantum cluster literature [3,10]. We write · , · H and · H for its inner product and norm.

Interchangeability (calibration). 

Fix bounded maps ( I Σ , J Σ ( + ) ) between a statistical channel S Σ and a physical channel P Σ H Σ such that
I Σ J Σ ( + ) = id P Σ , J Σ ( + ) I Σ = P S Σ ,
with P S Σ the orthogonal projector in the comparison geometry. At the operator–algebraic level, J Σ ( + ) is the orthogonal conditional expectation onto the pointer (diagonal) MASA for the chosen polarization [12,15,16].

DSFL residual on Σ . 

For boundary data ( s , p ) S Σ P Σ define
R Σ ( s , p ) : = p I Σ s H Σ 2 .
This is the sector–natural quadratic mismatch (Residual of Sameness), expressed in the single comparison geometry attached to the boundary chart [3,10].

Admissible kernels. 

A linear map on boundary data ( Φ ˜ , Φ ) : S Σ P Σ S Σ P Σ is admissible if it intertwines the calibration and is non–expansive in H :
Φ I Σ = I Σ Φ ˜ , Φ H H 1 , Φ ˜ 1 .
(Optionally: one–budget/resource preserving and causal ceilings on collars; these play no role below.) Intertwining captures functoriality of boundary restriction under gluing [3].

Teichmüller kernel class. 

For a cobordism (or an ideal tetrahedron) we represent the interior by a state–integral kernel built from Faddeev’s quantum dilogarithm Φ b in the modular–double Plancherel representation, combined via the standard edge operator T ; the five–term pentagon identity and unitarity of T yield an isometric gluing operator on H Σ [3,4,6,7]. Pachner moves 2 3 and 1 4 are implemented at the operator level by these identities [3,5,10].
Definition 1 
(Gluing DSFL residual). Let T T be a single Pachner move on an ideal triangulation along a boundary Σ, implemented on H Σ by a (projective) isometry G Σ [6,7]. Given ( s , p ) on Σ, push forward by ( Φ ˜ , Φ ) induced by the move and define
R glue ( T , Σ ) : = R Σ ( s , p ) , R glue ( T , Σ ) : = R Σ Φ ˜ s , Φ p .

Well–Posedness, Invariances, and Basic Calculus

Lemma 1 
(Well–posedness and convexity). R Σ in (1) is finite on S Σ P Σ , jointly continuous, and convex in each argument. Moreover, for any 0 t 1 and ( s i , p i ) ,
R Σ t s 1 + ( 1 t ) s 2 , t p 1 + ( 1 t ) p 2 t R Σ ( s 1 , p 1 ) + ( 1 t ) R Σ ( s 2 , p 2 ) .
Proof. 
I Σ is bounded and · H 2 is continuous and strictly convex; composition preserves these properties. The final inequality follows from the convexity and unitary invariance of Hilbert norms (see, e.g., [17]).    □
Proposition 1 
(Reparametrization invariance). Let U : H Σ H Σ be unitary and suppose the boundary chart changes by I Σ U I Σ V 1 with a bounded, invertible V : S Σ S Σ and p U p , s V s . Then R Σ is invariant:
U p U I Σ V s 2 = p I Σ s 2 .
Proof. 
Unitary invariance of the Hilbert norm gives U x = x ; substitute and simplify [17].    □
Lemma 2 
(Cylinder identity via the DSFL projector). Let Π DSFL , Σ be the (boundary) DSFL projector onto the nullspace of e : = p I Σ s in the H Σ –metric.1 Then for any cylinder Cyl ( Σ ) = Σ × [ 0 , 1 ] , Π DSFL , Σ Π DSFL , Σ = Π DSFL , Σ and the cylinder acts as the identity on the residual class.
Proof. 
Idempotence is standard for orthogonal projections onto closed subspaces in Hilbert spaces [15,16]; see also Halmos’ two–subspace calculus [18]. The DSFL flow on the collar drives e to the residual kernel, hence one application of Π DSFL , Σ fixes the class and a second has no effect.    □

Data–Processing Inequality and Composition

Theorem 1 
(Data–processing for admissible maps). If ( Φ ˜ , Φ ) is admissible in the sense of (2), then
R Σ ( Φ ˜ s , Φ p ) R Σ ( s , p ) for all ( s , p ) .
Proof. 
Set e : = p I Σ s . Intertwining gives Φ p I Σ Φ ˜ s = Φ ( p I Σ s ) = Φ e . Taking norms and using Φ 1 , R Σ ( Φ ˜ s , Φ p ) = Φ e 2 e 2 = R Σ ( s , p ) . This is the Hilbert–space avatar of data processing/monotonicity under contractions; cf. the quantum information–theoretic data–processing principle for contractive distances [19] and operator–algebraic monotonicity results of Petz [20].    □

Well–Posedness, Invariances, and Basic Calculus

Lemma 3 
(Well–posedness and convexity). R Σ in (1) is finite on S Σ P Σ , jointly continuous, and convex in each argument. Moreover, for any 0 t 1 and ( s i , p i ) ,
R Σ t s 1 + ( 1 t ) s 2 , t p 1 + ( 1 t ) p 2 t R Σ ( s 1 , p 1 ) + ( 1 t ) R Σ ( s 2 , p 2 ) .
Proof. 
I Σ is bounded and · H 2 is continuous and strictly convex; composition preserves these properties. The final inequality follows from the convexity and unitary invariance of Hilbert norms [17].    □
Proposition 2 
(Reparametrization invariance). Let U : H Σ H Σ be unitary and suppose the boundary chart changes by I Σ U I Σ V 1 with a bounded, invertible V : S Σ S Σ and p U p , s V s . Then R Σ is invariant:
U p U I Σ V s 2 = p I Σ s 2 .
Proof. 
Unitary invariance of the Hilbert norm gives U x = x ; substitute and simplify [17].    □
Lemma 4 
(Cylinder identity via the DSFL projector). Let Π DSFL , Σ be the (boundary) DSFL projector onto the nullspace of e : = p I Σ s in the H Σ –metric.2 Then for any cylinder Cyl ( Σ ) = Σ × [ 0 , 1 ] , Π DSFL , Σ Π DSFL , Σ = Π DSFL , Σ and the cylinder acts as the identity on the residual class.
Proof. 
Idempotence is standard for orthogonal projections onto closed subspaces of a Hilbert space [16]; see also Halmos’ two–subspace calculus [18]. The DSFL flow on the collar drives e to the residual kernel; one application of Π DSFL , Σ fixes the class and a second has no effect.    □

Data–Processing Inequality and Composition

Theorem 2 
(Data–processing for admissible maps). If ( Φ ˜ , Φ ) is admissible in the sense of (2), then
R Σ ( Φ ˜ s , Φ p ) R Σ ( s , p ) for all ( s , p ) .
Proof. 
Set e : = p I Σ s . Intertwining gives Φ p I Σ Φ ˜ s = Φ ( p I Σ s ) = Φ e . Taking norms and using Φ 1 , R Σ ( Φ ˜ s , Φ p ) = Φ e 2 e 2 = R Σ ( s , p ) . This is the Hilbert–space avatar of data processing under contractions; cf. [19] and operator–algebraic monotonicity results of Petz [20].    □
Corollary 1 
(Monotonicity under compositions). If ( Φ ˜ i , Φ i ) are admissible, then so is their composition and R ( Φ ˜ 2 Φ ˜ 1 s , Φ 2 Φ 1 p ) R ( s , p ) .
Proof. 
Intertwining is preserved under composition; the operator norm is submultiplicative ( Φ 2 Φ 1 Φ 2 Φ 1 ), hence 1 [17]. Apply Theorem 1 twice.    □
Proposition 3 
(Stochastic/ensemble admissibility). Let { ( Φ ˜ x , Φ x ) } x X be admissible pairs and let μ be a probability measure on X. Define the averaged map Φ ˜ : = Φ ˜ x d μ ( x ) , Φ : = Φ x d μ ( x ) . If the integrals define bounded operators and intertwining holds pointwise, then ( Φ ˜ , Φ ) is admissible and (4) holds.
Proof. 
Convexity of the operator–norm unit ball implies Φ Φ x d μ 1 ; see [17]. Intertwining passes to Bochner integrals by linearity. Apply Theorem 1.    □

Gluing and Pachner Moves

Theorem 3 
(No–inflation under Pachner moves). Let T T be a 2 3 or 1 4 move along Σ, implemented on H Σ by a (projective) isometry G Σ and inducing an admissible pair ( Φ ˜ , Φ ) . Then
R glue ( T , Σ ) R glue ( T , Σ )
for the gluing residual of Definition 1. Consequently, along any finite move sequence, R glue is nonincreasing.
Proof. 
By Definition 1 and Theorem 1. In the Teichmüller class, the isometry G Σ is provided by unitarity of the edge operator and the five–term identity [3,6,7]; Pachner’s theorem ensures sufficiency of 2 3 and 1 4 moves [5].    □
Proposition 4 
(Teichmüller admissibility criterion). In the Teichmüller kernel class, the edge operator T (built from Φ b ) is unitary and satisfies the five–term identity T 12 T 13 T 23 = T 23 T 12 . Any Pachner move is implemented by replacing one ordered product of edge operators by the other. Thus G Σ is (projectively) unitary on H Σ , and ( Φ ˜ , Φ ) is admissible.
Proof 
(Idea). Unitary products are unitary; the pentagon identity identifies the two sides of the move [6,7]. Boundary restriction and calibration intertwiners commute with these replacements in the Teichmüller setting [3,10], yielding (2).    □

Quantitative Refinements and Robustness

Definition 2 
(Principal–angle constant). Let P in , P out be the orthogonal projectors onto two Lagrangian polarizations on Σ. Define γ : = P in P out = cos θ F [ 0 , 1 ] .
Proposition 5 
(Through–seam bound). For any contraction K on H Σ , P out K P in P out P in = γ .
Proof. 
Use A B A B and P out = P in = 1 ; the sharper P out P in description follows from the principal–angle (Friedrichs) calculus for two closed subspaces [17,18].    □
Corollary 2 
(Angle–controlled uncertainty and conditioning). For any decomposition e = e in + e out with e in ran ( P in ) , e out ran ( P out ) ,
( 1 γ ) e in 2 + e out 2 e 2 ( 1 + γ ) e in 2 + | e out 2 .
Hence the condition number for resolving the split is κ ( θ F ) = 1 + γ 1 γ .
Lemma 5 
(Davis–Kahan stability). If the two polarizations arise from spectral subspaces of nearby self–adjoint operators with gap δ > 0 and perturbation E, then P in P out = sin θ max E / δ ; hence γ and κ are Lipschitz in E while the gap persists.
Proof 
(Proof sketch). Apply the Davis–Kahan sin  Θ theorem in the projector form; see [17,21]. Let P and P ˜ denote the spectral projectors onto the target (unperturbed vs. perturbed) invariant subspaces, and let γ : = dist spec ( A | target ) , spec ( A | complement ) be the spectral separation. Davis–Kahan yields
( I P ) P ˜ = sin Θ E γ ,
so the largest principal angle θ max between the two subspaces satisfies sin θ max E / γ , which is the stated bound.    □

Consequences for Algorithms and Exact Recursion

Definition 3 
(Move–by–move Lyapunov profile). Given a sequence of moves with induced admissible pairs { ( Φ ˜ k , Φ k ) } k = 1 n , define R ( 0 ) : = R ( s , p ) , R ( k ) : = R ( Φ ˜ k Φ ˜ 1 s , Φ k Φ 1 p ) .
Proposition 6 
(Uniform nonincrease and certification). R ( k + 1 ) R ( k ) for all k. Moreover, if each step admits a principal–angle constant γ k on the seam, then any through–seam contraction satisfies P out ( k ) K ( k ) P in ( k ) γ k and the cumulative leakage is controlled by k = 1 n γ k .
Proof. 
Iterate Theorem 1; use the principal–angle (Friedrichs) calculus and the bound of Proposition 5 at each seam [17,18].    □
Theorem 4 
(Stability of exact recursion). Consider an exact recursion on boundary amplitudes A g + 1 = K g ( A g ) with each K g admissible (intertwining, K g 1 ). Then the residuals decay monotonically: R ( A g + 1 ) R ( A g ) R ( A 0 ) . If additionally K g ρ < 1 uniformly, then R ( A g ) ρ 2 g R ( A 0 ) .
Proof. 
Apply Theorem 1 at each recursion step; submultiplicativity of the operator norm and the contraction principle yield the uniform exponential bound [17,22].    □

Teichmüller Specialization: Why Admissibility Holds and What It Buys

Proposition 7 
(Unitarity and pentagon ⇒ admissibility). In the Teichmüller class, each local move is implemented by a product of edge operators T . Unitarity of T implies Φ = 1 ; the pentagon identity guarantees the replacement across 2 3 moves. Boundary restriction and pointer dephasing commute with unitary conjugation, hence (2).
Proof. 
Unitarity of T and the operator pentagon identity are classical for the Faddeev quantum dilogarithm [6,7]; functoriality of boundary restriction in Teichmüller TQFT is described in [3,10]. These facts ensure Φ is (projectively) unitary and intertwines the calibration, i.e. admissible.    □
Corollary 3 
(No–inflation in Teichmüller TQFT). All conclusions of Theorem 3 through Theorem 4 hold for Teichmüller state–integrals, with equality in (4) iff e lies in the isometric invariant subspace of the move.

Consequences (scientific takeaways). 

  • Certified triangulation robustness. The DSFL residual R glue is a Lyapunov functional along Pachner sequences; any pipeline of local simplifications cannot inflate calibrated mismatch.
  • Quantitative seam control. Principal angles between boundary polarizations bound leakage and algorithmic conditioning by γ = cos θ F and κ ( θ F ) = 1 + γ 1 γ .
  • Recursion reliability. Exact recursion steps modeled by admissible kernels inherit monotone residual decay; uniform contractivity yields exponential envelopes in the recursion depth.
  • Chart independence. By Proposition 1, reparametrizations/changes of boundary chart by unitary/metaplectic transforms preserve the value of R .
  • Perturbation stability. Under spectral gaps, Davis–Kahan (Lemma 5) gives Lipschitz robustness of γ and κ against boundary perturbations.

3. Main Results

Theorem 5 
(No–inflation under Pachner moves). Assume the Teichmüller kernel class with pentagon identity and unitary edge operator T , so that the induced gluing operator G Σ is an isometry on H Σ and the pair ( Φ ˜ , Φ ) implementing a single Pachner move is admissiblein the sense of(2). Then for any boundary datum ( s , p ) ,
R glue ( T , Σ ) R glue ( T , Σ ) .
In particular, R glue is a Lyapunov (nonincreasing) functional along any sequence of 2 3 and 1 4 moves.
Proof. 
By intertwining, Φ I Σ = I Σ Φ ˜ , hence for e : = p I Σ s ,
Φ p I Σ Φ ˜ s = Φ ( p I Σ s ) = Φ e .
Taking H –norms and using Φ 1 ,
R Σ ( Φ ˜ s , Φ p ) = Φ e H 2 e H 2 = R Σ ( s , p ) .
This is exactly (5). In the Teichmüller class, the move operator is realized by compositions of T ’s; unitarity of T and the pentagon identity ensure the boundary map is a (projective) isometry, hence admissible with Φ = 1 . The same argument applies to 1 4 via unit/counit blocks (capping/uncapping), which are also isometric on H Σ .    □
Corollary 4 
(Triangulation independence up to nonincrease). Let T T ( n ) be any finite sequence of Pachner moves along Σ. Under the hypotheses of Theorem 5,
R glue T ( n ) , Σ R glue ( T , Σ ) for all n .

3.1. Strengthenings, Equality Cases, and Strictness

Proposition 8 
(Equality characterization). In Theorem 5 one has equality R Σ ( Φ ˜ s , Φ p ) = R Σ ( s , p ) iff the mismatch e : = p I Σ s lies in theisometric invariant subspace Fix ( Φ ) : = { x H Σ : Φ x = x } and Φ e is orthogonal to ker ( Φ ) . In the Teichmüller class (unitary boundary operator) this reduces to e H Σ with Φ e = U e for a unitary U determined by the move.
Proof. 
Φ e = e is necessary and sufficient for equality in (5); the orthogonality condition eliminates degenerate directions when Φ has nontrivial kernel. For Teichmüller moves, Φ is (projectively) unitary on the boundary, hence equality iff e belongs to an eigenspace of the implementing unitary.    □
Corollary 5 
(Strict decrease off invariants). If Φ < 1 or if e Fix ( Φ ) for a unitary Φ, then R Σ ( Φ ˜ s , Φ p ) < R Σ ( s , p ) .

3.2. Quantitative and Robust Variants

(toleranced) move).Definition 4 (Almost–admissible We say ( Ψ ˜ , Ψ ) is ( ε , δ ) –admissibleif
Ψ I Σ I Σ Ψ ˜ H ( S P ) ε , Ψ H H 1 + δ , Ψ ˜ 1 + δ .
Theorem 6 
(Stability under small violations). If ( Ψ ˜ , Ψ ) is ( ε , δ ) –admissible, then for any ( s , p )
R Σ ( Ψ ˜ s , Ψ p ) ( 1 + δ ) 2 R Σ ( s , p ) + ε 2 ( s , p ) 2 .
In particular, for δ , ε 1 the violation in monotonicity is second order in the tolerances.
Proof. 
Write Ψ p I Σ Ψ ˜ s = Ψ ( p I Σ s ) + ( Ψ I Σ I Σ Ψ ˜ ) s . Apply the triangle inequality and ( a + b ) 2 ( 1 + η ) a 2 + ( 1 + 1 / η ) b 2 with η > 0 , then use the operator–norm bounds.    □
Proposition 9 
(Angle–refined through–seam bound). Let P in , P out be orthogonal projectors onto Lagrangian polarizations with principal cosine γ. For any contraction K on H Σ and any e decomposed as e = e in + e out with e in ran P in , e out ran P out ,
P out K P in e in γ e in , ( 1 γ ) e in 2 + e out 2 e 2 ( 1 + γ ) e in 2 + e out 2 .
Proof. 
The first bound follows from A B A B and P out P in = γ . The two–sided inequality is the classical principal–angle estimate (cf. Friedrichs angle).    □

3.3. Compositions, Randomization, and Certification

Theorem 7 
(Composition law and supermartingale property). Let { ( Φ ˜ k , Φ k ) } k 1 be admissible (possibly random) with E [ Φ k 2 | F k 1 ] 1 almost surely. Set E k : = R ( Φ ˜ k Φ ˜ 1 s , Φ k Φ 1 p ) . Then ( E k ) k 0 is a supermartingale: E [ E k | F k 1 ] E k 1 . Consequently, E k converges almost surely and in L 1 to a limit E with E E E 0 .
Proof. 
Condition on F k 1 and apply Theorem 1 in expectation together with E Φ k e 2 E Φ k 2 e 2 e 2 . Doob’s convergence theorem yields the claim.    □
Corollary 6 
(Move–by–move certificate). Given a finite sequence of admissible moves, the log–residual profile k log E k is nonincreasing. If, in addition, each Φ k ρ < 1 , then E k ρ 2 k E 0 and a linear fit of log E k vs. k has slope bounded above by 2 log ρ .

3.4. Consequences for Exact Recursion and DSFL Envelopes

Theorem 8 
(Monotone decay in exact recursion). Let A g + 1 = K g ( A g ) be an exact recursion with each K g admissible (intertwining, K g 1 ). Then R ( A g + 1 ) R ( A g ) g . If K g ρ < 1 uniformly, then R ( A g ) ρ 2 g R ( A 0 ) .
Proof. 
Iterate (4) and use K x ρ x .    □
(abstract form)).Theorem 9 (Gluing–stable exponential envelopes Suppose a recursion or evaluation scheme admits a coercive DSFL identity on the tail R , d d N R 2 2 α R 2 + 2 R , g with | R , g | C R 2 uniformly. Then for the optimally truncated order N, the remainder obeys R N C e ( α C ) N . If the computation is decomposed into admissible glued blocks, the rate is stable: α glue min i α i .
Proof. 
Grönwall’s inequality gives the envelope; admissible composition preserves the minimum coercivity margin.    □

3.5. Categorical and Structural Corollaries

Proposition 10 
(Naturality square and projective unitarity). Let M be a reference modular functor and η Σ : = Π DSFL , Σ Q Σ the DSFL comparison map. For a bordism M : Σ Σ with admissible boundary kernels,
[ s c a l e = 1 ] D e f i n i t i o n s / l o g o m d p i commutes up to phase ,
and the vertical maps are nonexpansive. Hence mapping–class actions are projectively unitary on V ( Σ ) .
Proof. 
Intertwining ensures commutation after applying Π DSFL ; pentagon–unitarity supplies the projective unitary action; nonexpansivity follows from admissibility.    □

Scientific consequences (summary). 

  • Gluing robustness: R glue is a Lyapunov functional under Pachner moves (Theorem 5); triangle–free simplification pipelines cannot inflate calibrated mismatch.
  • Quantitative interfaces: principal angles control seam leakage and conditioning (Proposition 9); Davis–Kahan stability (Sec. Section 2) transfers to robustness of γ and κ .
  • Noisy pipelines: small violations of admissibility produce controlled slack (Theorem 6), useful for discretized numerics and floating–point implementations.
  • Probabilistic guarantees: residuals form a supermartingale for randomized admissible updates (Theorem 7), yielding convergence and certification criteria.
  • Recursive reliability: exact recursion inherits monotone decay and may exhibit exponential envelopes; rates are glue–stable (Theorems 8, 9). [23,24]
  • Categorical packaging: DSFL provides a natural transformation to a residual modular functor with projective unitarity (Proposition 10).
Remark 1 
(Interpretation and scope). The mechanism behind Theorem 5 is deliberately minimal:
  • asinglecomparison Hilbert geometry H Σ in which both channels live and the residual R Σ ( s , p ) = p I Σ s H Σ 2 is measured;
  • admissibility, i.e. boundary/interior mapsintertwinethe calibration ( I , J ( + ) ) and arenonexpansivein H Σ ;
  • for the concrete Teichmüller class, two structural identities: theunitarityof the edge operator T and thepentagon (five–term) identity, which together force the gluing operator G Σ to be (projectively) unitary and to intertwine the calibration.
Because residual monotonicity needs only these three items, we never appeal to delicate asymptotics of special functions: no saddle–point estimates, no growth bounds for Φ b —just unitarity and the pentagon relation.

4. Teichmüller Kernels: Why Admissibility Holds

We recall the standard modular–double representation of the Heisenberg pair and the edge operator, state the pentagon identity at the operator level, and prove admissibility of Pachner moves.

4.1. Operators and Identities

Heisenberg pair and modular double. 

Let ( q ^ , p ^ ) act self–adjointly on L 2 ( R ) with [ q ^ , p ^ ] = 1 2 π i id , and write e 2 π b q ^ , e 2 π b p ^ for the Weyl generators. The modular double uses both b and b 1 , b R > 0 (or on the unit circle), to ensure self–duality. The Hilbert space for a collection of edges E ( Σ ) is H Σ L 2 ( R E ( Σ ) ) ; the copies of ( q ^ e , p ^ e ) act on each factor.

Faddeev quantum dilogarithm and edge operator. 

Let Φ b denote Faddeev’s quantum dilogarithm; on L 2 ( R ) one defines the (unitary) edge operator
T : = Φ b ( p ^ ) e i π q ^ 2 , T * T = T T * = id .
On tensor factors we use the leg notation, e.g. T 12 acts nontrivially on factors 1 , 2 . The fundamental pentagon identity is the operator equality
T 12 T 13 T 23 = T 23 T 12 ,
encoding the 2 3 Pachner move at the level of edge operators.
Lemma 6 
(Unitarity and pentagon). For b R > 0 (or | b | = 1 ) the operators Φ b ( p ^ ) and e i π q ^ 2 are unitary on L 2 ( R ) , hence T in (6) is unitary; moreover (7) holds as a strong operator identity on the natural domain core.
Proof 
(Sketch). Unitarity of Φ b and the operator Gaussian is standard in the Plancherel representation for the modular double. The pentagon identity is a well–known consequence of the integral kernel identity for Φ b and the Weyl relations; see any of the standard references on Teichmüller TQFT. As we never leave the von Neumann algebra generated by the Weyl operators, the common Schwartz core suffices to justify strong operator equalities.    □

4.2. Isometry and Intertwining for Pachner Moves

We now prove the two admissibility properties required by (2): (i) boundary isometry (nonexpansion) and (ii) calibration intertwining.
Proposition 11 
(Isometry of the boundary gluing operator). Let T be as above. Every 2 3 Pachner move along Σ is implemented on H Σ by replacing a product T 12 T 13 T 23 by T 23 T 12 (or the inverse). Hence the induced boundary operator G Σ is (projectively) unitary on H Σ , i.e. G Σ x H Σ = x H Σ for all x and up to a central phase depending on the normalization of measures/framing.
Proof. 
By Lemma 6, each T is unitary and (7) holds. Thus both sides of the move are unitary operators mapping H Σ H Σ . Any central phase coming from product ordering or measure normalization multiplies the operator by a scalar on the unit circle, which does not affect norms. Therefore G Σ is unitary up to phase, i.e. an isometry on H Σ .    □
Proposition 12 
(Intertwining of the calibration). Let I Σ be the boundary restriction of the interior state–integral transform (the comparison map), and let J Σ ( + ) be the H Σ –orthogonal conditional expectation onto the pointer algebra of a chosen polarization. Then the Pachner move operator G Σ satisfies
G Σ I before = I after , J after ( + ) G Σ = G Σ J before ( + ) .
Proof. 
First identity: At the kernel level, a boundary amplitude is obtained by convolving interior tetrahedral kernels and restricting to the boundary variables. The 2 3 move replaces a triple of kernels by a double via (7). Because both sides of (7) represent the same integral transform on the shared boundary variables, restricting to the boundary after the move equals first restricting and then applying G Σ : G Σ I before = I after .    □
Second identity: The pointer algebra for a polarization is generated by commuting functions of either a position–type or momentum–type family of boundary coordinates (shear/Fenchel–Nielsen charts), i.e. a maximal abelian von Neumann algebra. For any unitary U implementing a change of presentation at the boundary, the orthogonal conditional expectation E onto such a MASA satisfies E Ad U = Ad U E precisely when U normalizes the MASA or when we pass to its image MASA under U (change of chart). In our situation G Σ sends one triangulation chart to another and therefore maps the pointer algebra to the pointer algebra of the new chart; orthogonal projection (being characterized by minimization in H Σ ) commutes with this unitary conjugation, giving the second equality in (8).
Corollary 7 
(Admissibility of Pachner moves). With I , J ( + ) as above, the pair ( Φ ˜ , Φ ) : = ( G Σ , G Σ ) implementing a single 2 3 (or 1 4 ) move isadmissiblein the sense of (2):
Φ I before = I after , J after ( + ) Φ = Φ J before ( + ) , Φ H H = 1 .
Proof. 
Combine Propositions 11 and 12.    □

4.3. Consequences and Refinements

Equality and strictness. 

By the proof of Theorem 5, equality R ( Φ ˜ s , Φ p ) = R ( s , p ) holds iff the mismatch e : = p I s lies in the isometric invariant subspace of Φ = G Σ . For generic e and for any move with Φ < 1 (e.g. with admissible damping), the inequality is strict.

Projective phases and anomaly line. 

The projective ambiguity in G Σ (a central phase) does not affect admissibility or residuals. Such phases organize into a flat line bundle over auxiliary choices (framing/Teichmüller parameters), i.e. an anomaly line. All results above are phase–insensitive.

Robustness to discretization/regularization. 

If a numerical implementation replaces G Σ by a near–isometry Ψ and the intertwining identities by ( ε , δ ) –violations (Definition 4), the stability bound of Theorem 6 shows that residual monotonicity degrades only quadratically in ( ε , δ ) .

Caps/cups and 1 4 . 

Unit/counit blocks (adding/removing a tetrahedron) are realized by partial isometries obtained from T by fixing or integrating out one leg. Their boundary action is again an isometry on H Σ and intertwines the calibration, hence they are admissible and satisfy the same no–inflation bounds.

Seam conditioning via principal angles. 

When a move changes the boundary polarization (e.g. shear ↔ FN), the principal cosine γ = P out P in controls the through–seam operator norm P out G Σ P in γ (Proposition 9), yielding quantitative uncertainty/conditioning bounds for polarization changes and hence for numerical stability. [25]

No special–function estimates. 

All arguments above rely solely on operator unitarity and the pentagon identity—both algebraic/representation–theoretic facts of the Teichmüller kernel class—and on basic properties of orthogonal conditional expectations. No asymptotic analysis of Φ b is required.
Bottom line. In the Teichmüller state–integral realization, every Pachner move is an admissible, isometric, calibration–intertwining map on the boundary Hilbert space. Therefore the DSFL residual is a bona fide Lyapunov functional for cutting & gluing pipelines, with quantitative robustness under polarization changes and numerical perturbations.
Proof 
(Detailed proof and consequences). We make precise the two commuting statements in the idea and record their implications.
(A) Boundary restriction commutes with pentagon rearrangements. Let K t denote the (tempered) integral kernel of a single tetrahedral block built from Faddeev’s quantum dilogarithm Φ b [6,7], and let denote the boundary convolution/integration prescribed by the state–integral gluing rule in the Teichmüller TQFT models [3,4,10,26,27]. A 2 3 move replaces
K t 1 K t 2 K t 3 K t 1 K t 2
with the five–term (pentagon) identity holding at the operator level [4,6,7]. Denote by R Σ the boundary restriction (partial integration) to the variables living on the seam Σ . Under standard temperateness assumptions on the kernels (ensuring Fubini/Tonelli applies) one has
R Σ K t 1 K t 2 K t 3 = R Σ K t 1 R Σ K t 2 R Σ K t 3 ,
and the same for the right–hand side. Therefore boundary restriction commutes with the pentagon rearrangement; in operator notation this is exactly G Σ I before = I after .
(B) Orthogonal conditional expectations commute with conjugation of MASAs. Let N B ( H Σ ) be a MASA (pointer algebra) associated to a boundary polarization (e.g. shear or Fenchel–Nielsen); let E N : B ( H Σ ) N be the orthogonal conditional expectation for the Hilbert–Schmidt inner product. If U is unitary and U N U * = N is the MASA for the new polarization, then
E N U X U * = U E N ( X ) U * ( X B ( H Σ ) ) .
Indeed, (i) E N is characterized by orthogonality: X E N X , Y HS = 0 for all Y N ; (ii) for Z N and Y = U Z U * N ,
U X U * U E N ( X ) U * , Y HS = X E N ( X ) , Z HS = 0 ,
hence U E N ( X ) U * is the unique N –orthogonal projection of U X U * , proving (9). Taking X to be the boundary density/observable associated to the amplitude yields J after ( + ) Ad U = Ad U J before ( + ) .
Combining (A) and (B) with unitarity of the pentagon implementer U = G Σ in the Teichmüller class [3,6,7] gives admissibility: Φ I before = I after and J after ( + ) Φ = Φ J before ( + ) with Φ = 1 . The no–inflation inequality then follows from a single H –norm estimate.

Consequences. 

  • Axioms ⇒ Theorems. In Teichmüller TQFT, gluing stability becomes a Theorem (unitarity + pentagon + calibration) rather than an axiom.
  • Chart–independence of certification. Because E N Ad U = Ad U E N , residual certification (no inflation) is invariant under unitary changes of boundary charts (metaplectic transforms).
  • Numerical robustness. The proof is purely operator–theoretic; it carries over to finite–dimensional discretizations once we enforce (approximate) intertwining and spectral–norm 1 by construction (see next section).

5. Minimal Verification Harness (Reproducible Tests)

Aim. 

Given discretized boundary maps we certify (5) empirically without ever evaluating oscillatory special functions. The harness isolates two properties: (i) intertwining  B out . I T stat = T phys B in . I and (ii) nonexpansion  T phys 2 1 . Both are enforced by projection (spectral clipping) and checked by property–based sampling.

A. Repository Skeleton (Annotated)

Preprints 182248 i001

B. Core API (Pythonic Pseudocode with Enforcement)

Preprints 182248 i002

C. Acceptance Criterion and Statistical Confidence

A run passes if ok=True and the maximal defect δ max = max ( R after R before ) ε tol across N independent samples. To report confidence, model the indicator Z i = 1 { R 1 , i > R 0 , i + ε tol } ( i = 1 , , N ). If i Z i = 0 , Hoeffding gives, for any η ( 0 , 1 ) ,
P E [ Z 1 ] η e 2 N η 2 .
Thus with N = 10 4 and η = 10 2 , observing no violations certifies that the true violation rate is < 1 % with probability at least 1 e 200 1 ; larger N pushes the bound lower. (If some violations occur, report p ^ = 1 N Z i with an exact binomial CI.)

Numerical stability notes. 

  • Intertwining enforcement. Use intertwine_project once per move instance to project a guessed pair ( T stat , T phys ) onto the affine subspace { ( X , Y ) : B out . I X = Y B in . I } , then clip both by spectral_clip.
  • Operator norm. Estimate T phys 2 via the power method with a stringent stopping tolerance (e.g. 10 12 ); add a safety factor in the assertion.
  • Principal angles (optional). Provide principal_cosine(Pin,Pout) via SVD of P in P out | ran ( P out ) to log the conditioning proxy γ .

D. What the harness proves in practice

Under exact admissibility, Theorem 5 guarantees R after R before pointwise. Under discretization, the harness verifies the ( ε , δ ) –admissible variant (Thm. 6) by construction—intertwining error ε and norm inflation δ are made as small as numerically attainable by projection and clipping, and any remaining slack is detected in the empirical certificate.
Remark 2 
(Referencing the kernel facts). The only nontrivial analytic inputs we used are (i) the unitarity of the edge operator in the modular–double Plancherel representation and (ii) the operator pentagon identity, both classical for the Faddeev quantum dilogarithm [3,4,6,7,27]. The operator–algebraic identity (9) is standard for orthogonal conditional expectations onto MASAs (see, e.g., Kadison–Ringrose).

6. Afterword

The results above isolate what is universal: once every local gluing step acts as an intertwining contraction in a single comparison Hilbert geometry, the DSFL residual (1) is a bona fide Lyapunov functional for cutting & gluing. In the Teichmüller state–integral class, this hypothesis is realized by two structural facts—unitarity of the edge operator and the pentagon identity—so no special–function asymptotics are needed. We conclude by making this universality precise, recording robustness and limits, and sketching scientific consequences.

6.1. Universality Principle and a Converse

Theorem 10 
(Universality of residual Lyapunov law). Let H Σ be a fixed comparison Hilbert space and ( I Σ , J Σ ( + ) ) a calibration. Suppose every elementary gluing step along any seam Σ is implemented by a linear pair ( Φ ˜ , Φ ) satisfying the admissibility conditions (2). Then for any composite gluing pipeline G = k ( Φ ˜ k , Φ k ) and any boundary data ( s , p ) one has the chain of inequalities
R ( Φ ˜ n Φ ˜ 1 s , Φ n Φ 1 p ) R ( Φ ˜ 1 s , Φ 1 p ) R ( s , p ) ,
i.e. R is Lyapunov along the pipeline, independent of triangulation choices.
Proof. 
Iterate the data–processing inequality (Theorem 1). No additional structure is used. □
Theorem 11 
(A converse: Lyapunov ⇒ admissibility). Let ( Ψ ˜ , Ψ ) be a bounded pair such that R ( Ψ ˜ s , Ψ p ) R ( s , p ) forall ( s , p ) . Then necessarily:
  • Ψ is nonexpansive on theresidual directions: Ψ e e for all e;
  • Intertwining holds: Ψ I Σ = I Σ Ψ ˜ .
If, moreover, I Σ has dense range and J Σ ( + ) is the orthogonal projector dual to I Σ ( I J ( + ) = id P , J ( + ) I = P S ), then Ψ 1 on H .
Proof. 
Setting p = I s + e gives R ( Ψ ˜ s , Ψ p ) = Ψ e 2 and R ( s , p ) = e 2 , hence Ψ e e for all e. Taking e = 0 forces Ψ I s = I Ψ ˜ s for all s, i.e. intertwining. If ran I is dense, any x H is a limit of residual directions e n = p n I s n , hence Ψ x x by continuity. □
Remark 3 
(Equivalence class viewpoint). Theorems 10–11 show that the Lyapunov property isequivalentto admissibility, once the calibration is fixed. Thus the DSFL residual upgrades “axioms of sewing” to anif and only ifcriterion:gluing is stable precisely when it is an intertwining contraction in the comparison geometry.

6.2. Robustness, Limits, and Failure Modes

Small violations. 

Section 3 (Thm. 6) shows ( ε , δ ) –admissible steps produce at most quadratic slack. Hence discretizations that enforce intertwining up to ε and clip spectral norms at 1 + δ inherit a controlled near–Lyapunov property.

Failure modes. 

If either condition in (2) fails badly, monotonicity can break:
  • Nonintertwining. If Ψ I I Ψ ˜ has large operator norm, the residual can inflate by O ( Ψ I I Ψ ˜ 2 s 2 ) even when Ψ 1 .
  • Expansion. If Ψ > 1 , then directions e in the top singular subspace inflate the residual by σ max ( Ψ ) 2 .
Both effects are observable and certifiable by the verification harness (§Section 5).

6.5. Categorical Consequences and Anomaly Bookkeeping

Proposition 13 
(Residual naturality and anomaly line). Let η Σ : = Π DSFL , Σ Q Σ be the comparison map from a reference modular functor M to the residual functor R . For any bordism M : Σ Σ implemented by admissible kernels, the naturality square commutes up to a central phase:
η Σ M ( M ) = e i ϑ ( M ) R ( M ) η Σ , ϑ : Cob R / 2 π Z .
The phases assemble into a flat line bundle (the anomaly line). All DSFL inequalities are phase–insensitive.
Proof. 
Intertwining gives strict commutation before projecting; the DSFL projector is idempotent and bounded; phases multiply both sides by a unit scalar. □

6.6. Algorithmic and Numerical Consequences

Certification by supermartingales. 

For randomized pipelines ( Φ ˜ k , Φ k ) with E [ Φ k 2 | F k 1 ] 1 , the residual sequence E k = R ( Φ ˜ k Φ ˜ 1 s , Φ k Φ 1 p ) is a supermartingale (Thm. 7). This yields:
  • almost–sure convergence of E k ;
  • tail bounds for empirical violation rates via Hoeffding/Bernstein, enabling reproducible pass/fail certificates;
  • linear semi–log decay when the mean contraction is uniform ( E Φ k 2 ρ 2 < 1 ).

Seam conditioning. 

Principal angles between polarizations bound through–seam operator norms by P out K P in γ = cos θ F (Prop. 9), giving: (i) sharp two–sided uncertainty for residual splits; (ii) a conditioning number κ ( θ F ) = 1 + γ 1 γ to guide chart choices in numerics.

6.9. Teichmüller Specialization: Why It Works “for Free”

In the Teichmüller class, admissibility is guaranteed “from the start”: [14,28,29,30]
  • Unitarity. The edge operator T (built from Φ b ( p ^ ) and the metaplectic Gaussian) is unitary on the modular–double Plancherel space.
  • Pentagon identity. The 2 3 move holds as a strong operator identity (no approximation).
  • Pointer compatibility. Orthogonal conditional expectations onto MASAs commute with unitary conjugations of those MASAs (change of polarization).
Therefore every elementary move is an exact intertwining isometry on H Σ , and all of the above consequences apply verbatim.

6.10. Outlook: Envelopes, Modularity, and Testable Conjectures

DSFL envelopes and resurgence. 

When a coercive DSFL identity is available for tails R (e.g. along steepest–descent thimbles), Grönwall yields exponential envelopes R N C e ( α C ) N (Thm. 9). Because admissible gluing preserves the minimum coercivity margin, rates are glue–stable: α glue min i α i .

Quantum modularity link (program). 

In state–integral models for hyperbolic 3–manifolds, the nearest Borel singularity is the smallest real part among relative Chern–Simons actions. It is therefore natural to conjecture (and verify case by case) that the DSFL envelope rate equals that real part, and that it is preserved under JSJ gluing. This identifies a concrete bridge from DSFL Lyapunov rates to quantum modularity exponents.

Practical takeaway. 

From the DSFL vantage point, topology is what survives the flow: admissibility collapses metric minutiae and forces residual monotonicity. This gives a unifying, verifiable stability layer for cutting & gluing pipelines, exact recursion, and categorical sewing—together with quantitative, phase–insensitive error bars and robust numerical certification.

Author’s Note. 

This paper develops a sector-neutral Lyapunov–residual framework—the Deterministic Statistical Feedback Law (DSFL)—aimed at recovering standard equilibrium relations as dynamical attractors under explicit hypothesis gates. The intention is not to replace established formalisms, but to clarify their restoration mechanisms by isolating a minimal quadratic residual and its propagation–gap structure.
Declaration of Generative AI and AI-Assisted Technologies in the Writing Process: During preparation of this manuscript, the author used ChatGPT (OpenAI) for limited technical and editorial assistance, specifically to: (i) refactor small Python utilities (e.g., plotting, data wrangling) and translate brief code snippets between R and Python; (ii) convert draft formulas and definitions into LaTeX; and (iii) suggest wording and layout improvements for tables, boxes, and section headings. All outputs were reviewed, edited, and independently validated by the author. The author is solely responsible for the scientific content, analysis, and presentation.

Acknowledgments

The author affirms sole authorship of this work. The first-person plural (“we”) is used for stylistic and expository convenience only. No co-authors contributed to the conception, development, writing, or revision of the manuscript. The author received no external funding and has no ethical, institutional, or competing interests to declare.

Appendix A. Notation

Table A1. Symbols and conventions used throughout. The comparison Hilbert space is ( H , · , · ) with norm x H : = x , x .
Table A1. Symbols and conventions used throughout. The comparison Hilbert space is ( H , · , · ) with norm x H : = x , x .
Symbol Type / Domain Meaning / Assumptions
Spaces and geometry
H Hilbert space Comparison geometry for both channels; inner product x , y , norm x H = x , x .
S Linear space Statistical channel space (e.g., vacuum/constraint objects).
P H Closed subspace Physical channel space (e.g., observables/fields inside H ).
P S : S S Projector Metric projection onto the admissible statistical subspace; encodes statistical gauge.
Channels and maps
s S State (stat.) Statistical channel. In one-budget model: s ( x ) = w ( x ) s 0 , V w = 1 , w 0 .
p P State (phys.) Physical channel.
I : S P Linear map Interchangeability (calibration/embedding) of s into P .
J ( + ) : P S Linear map Statistical representative of p; satisfies J ( + ) I = P S .
C : S P Linear map Calibration operator (units/indices/gauge); often C I .
Interchangeability identities
I J ( + ) = id P Identity Pushing p to S then back gives p.
J ( + ) I = P S Identity Pushing s to P then back gives the projected s.
Residuals (mismatch measures)
R phys ( s , p ) Scalar Physical-side residual: p I ( s ) H 2 .
R stat ( s , p ) Scalar Statistical-side residual: s J ( + ) ( p ) S 2 .
R sameness ( s , p ) Scalar Canonical residual p C s H 2 (often C = I ).
R sameness ( D ) Scalar Differential residual D p + D ( C s ) H 2 (e.g., D = , 2 ).
Propagation and DSFL parameters (optional, when dynamics are used)
e : = p C s Element of P Residual vector in H .
K = K * 0 Operator on P Dissipative/elliptic part (Dirichlet/Lichnerowicz/constitutive).
g Element of P Controlled remainder (lower orders, background drift).
κ > 0 Scalar Gap/coercivity constant: K e , e κ e 2 .
ε 0 Scalar Remainder bound: | e , g | ε e 2 .
α = 2 κ 2 ε Scalar DSFL rate in R ˙ α R (when dynamics are present).
Angles and subspace geometry
U = P , V = ran I ¯ Subspaces of H Physical subspace and calibrated statistical range.
P U , P V Projectors Orthogonal projectors onto U and V.
θ F [ 0 , π / 2 ] Angle Friedrichs angle: P U P V = cos θ F .
Q U , Q V Matrices/bases Orthonormal bases spanning U and V; CS/SVD: Q U * Q V = W Σ Z * , Σ = diag ( cos θ k ) .
Admissible (“entanglement-like”) redistribution
Φ ˜ : S S Linear map Statistical operation (Markov/coherent/CPTP marginal).
Φ : P P Linear map Physical operation (contractive in H ).
Intertwining Identity Φ C = C Φ ˜ , Φ ˜ J ( + ) = J ( + ) Φ .
Contractivity Inequality Φ x H x H , Φ ˜ y S y S .
Residual monotonicity Inequality R sameness ( Φ ˜ s , Φ p ) R sameness ( s , p ) .
One-budget (statistical resource) model
s 0 S Fixed template Global statistical prototype (primordial sameness), s 0 normalized.
w ( x ) Nonnegative weight Share field, V w = 1 ; s ( x ) = w ( x ) s 0 .
K ( x , y ) Kernel Markov kernel: K 0 , K ( x , y ) d x = 1 ; preserves w = 1 .
Budget/causality constraints
d ( · ) Counter Local complexity/effective rank/energy counter; monotone & subadditive.
v Speed Carrier/relay speed (e.g., wave speed, Lieb–Robinson velocity).
corr Length Correlation diameter/interaction range.
Causal ceiling Bound d d t d ( p U ( t ) ) κ v corr for a moving volume U ( t ) .
Sector shorthands (used in mini-cases)
PDE u = P ρ , B β I , Helmholtz split u = ϕ + w , Poincaré λ 1 .
OA/QMS L 2 ( ω ) GNS space; E N conditional expectation (orthogonal projector).
OU/free A = Δ + m 2 , covariance Σ τ , gap λ * : = inf σ ( A | ker A ) .
Constants frequently used
β > 0 Scalar Uniform ellipticity margin (PDE).
λ , λ 1 Scalars Poincaré/spectral constants (domain/semigroup).
λ * Scalar Hamiltonian/spectral gap (OU/free field).
κ , ε Scalars Coercivity/remainder (DSFL template).
α Scalar Dissipation rate ( α = 2 κ 2 ε when used dynamically).

References

  1. Ponsot, B.; Teschner, J. Liouville bootstrap via harmonic analysis on a noncompact quantum group. arXiv 2000, arXiv:hep-th/9911110. [Google Scholar]
  2. Fock, V.; Goncharov, A. Cluster ensembles, quantization and the dilogarithm. Annales Scientifiques de l’École Normale Supérieure 2009, 42, 865–930. [Google Scholar] [CrossRef]
  3. Andersen, J.E.; Kashaev, R. A TQFT from quantum Teichmüller theory. Communications in Mathematical Physics 2014, 330, 887–934. [Google Scholar] [CrossRef]
  4. Baseilhac, S.; Benedetti, R. Analytic families of quantum hyperbolic invariants. Algebraic & Geometric Topology 2014, 14, 1983–2063. [Google Scholar]
  5. Pachner, U. P.L. homeomorphic manifolds are equivalent by elementary shellings. European Journal of Combinatorics 1991, 12, 129–145. [Google Scholar] [CrossRef]
  6. Faddeev, L.D.; Kashaev, R.M. Quantum Dilogarithm. Modern Physics Letters A 1994, 9, 427–434. [Google Scholar] [CrossRef]
  7. Faddeev, L.D. Discrete Heisenberg–Weyl group and modular group. Letters in Mathematical Physics 1995, 34, 249–254. [Google Scholar] [CrossRef]
  8. Tomiyama, J. On the Projection of Norm One in W*-Algebras. Proceedings of the Japan Academy 1957, 33, 608–612. [Google Scholar] [CrossRef]
  9. Takesaki, M. Theory of Operator Algebras I; Springer, 2003.
  10. Fock, V.V.; Chekhov, L.O. Quantum Teichmüller space. Theoretical and Mathematical Physics 1999, 120, 1245–1259. [Google Scholar] [CrossRef]
  11. Matveev, S.V. Algorithmic Topology and Classification of 3-Manifolds; Vol. 9, Algorithms and Computation in Mathematics, Springer, 2007.
  12. Kadison, R.V. A generalized Schwarz inequality and algebraic invariants for operator algebras. Annals of Mathematics 1952, 56, 494–503. [Google Scholar] [CrossRef]
  13. Atiyah, M.F. Topological quantum field theories. Publications Mathématiques de l’IHÉS 1988, 68, 175–186. [Google Scholar] [CrossRef]
  14. Dimofte, T.; Gaiotto, D.; Gukov, S. 3-Manifolds and 3d Indices. Advances in Theoretical and Mathematical Physics 2013, 17, 975–1076. [Google Scholar] [CrossRef]
  15. Kadison, R.V.; Ringrose, J.R. Fundamentals of the Theory of Operator Algebras. Vol. I: Elementary Theory; Vol. 15, Graduate Studies in Mathematics, American Mathematical Society: Providence, RI, 1997.
  16. Kadison, R.V.; Ringrose, J.R. Fundamentals of the Theory of Operator Algebras. Vol. II: Advanced Theory; Vol. 16, Graduate Studies in Mathematics, American Mathematical Society: Providence, RI, 1997.
  17. Bhatia, R. Matrix Analysis; Vol. 169, Graduate Texts in Mathematics, Springer: New York, 1997. [CrossRef]
  18. Halmos, P.R. Two Subspaces. Transactions of the American Mathematical Society 1969, 144, 381–389. [Google Scholar] [CrossRef]
  19. Nielsen, M.A.; Chuang, I.L. Quantum Computation and Quantum Information, 10th anniversary edition ed.; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
  20. Petz, D. Monotonicity of Quantum Relative Entropy Revisited. Reviews in Mathematical Physics 2003, 15, 79–91. [Google Scholar] [CrossRef]
  21. Davis, C.; Kahan, W.M. The Rotation of Eigenvectors by a Perturbation. SIAM Journal on Numerical Analysis 1970, 7, 1–46. [Google Scholar] [CrossRef]
  22. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundamenta Mathematicae 1922, 3, 133–181. [Google Scholar] [CrossRef]
  23. Doob, J.L. Stochastic Processes; Wiley, 1953.
  24. Hoeffding, W. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 1963, 58, 13–30. [Google Scholar] [CrossRef]
  25. Björck, Å.; Golub, G.H. Numerical Methods for Computing Angles between Linear Subspaces. Mathematics of Computation 1973, 27, 579–594. [Google Scholar] [CrossRef]
  26. Kashaev, R.M. Quantization of Teichmüller spaces and the quantum dilogarithm. Letters in Mathematical Physics 1998, 43, 105–115. [Google Scholar] [CrossRef]
  27. Dimofte, T.; Gaiotto, D.; Gukov, S. Gauge theories labelled by three-manifolds. Communications in Mathematical Physics 2011, 325, 367–419. [Google Scholar] [CrossRef]
  28. Kashaev, R.M. The Hyperbolic Volume of Knots from the Quantum Dilogarithm. Letters in Mathematical Physics 1997, 39, 269–275. [Google Scholar] [CrossRef]
  29. Andersen, J.E.; Kashaev, R. A TQFT from Quantum Teichmüller Theory. Communications in Mathematical Physics 2014, 330, 887–934. [Google Scholar] [CrossRef]
  30. Andersen, J.; Kashaev, R. A TQFT from quantum Teichmüller theory. Communications in Mathematical Physics 2014, 330, 887–934. [Google Scholar] [CrossRef]
1
In practice: the orthogonal projection onto ker ( id I Σ J Σ ( + ) ) on collars; see the main text for the DSFL evolution justification.
2
In practice: the orthogonal projection onto ker ( id I Σ J Σ ( + ) ) on collars; see the main text for the DSFL evolution justification.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated