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.
Frobenius Algebras and Oriented Two-Dimensional Sewing
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Categories, Functors and Natural Transformations
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Hopf Integrals, Frobenius Duality, and Maschke
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Geodesics, the Exponential Map, Completeness, and Hopf–Rinow
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hereditary and Productive Behaviour of the Separation Axioms
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monoidal Categories and Monoidal Functors
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Morse Critical Points Hessians and Indices
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sard Theorem and Transversality
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Products of Modules
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page treats finite-dimensional Frobenius algebra and two-dimensional oriented sewing over an arbitrary field. It keeps symmetric Frobenius algebras distinct from commutative ones, separates the closed theory from surfaces with colored free boundary, and makes no semisimplicity assumption. The closed category has no free boundary at all; it is not the full subcategory on circle objects of the open-closed category, where free windows are allowed.
Reading prerequisites
- algebraic-representation-and-tensor-symmetry-map defines unital associative algebra representations and proves their equivalence with unital module actions. Its separate bialgebra tensor-action interface is used only when an actual Hopf or bialgebra coproduct is present.
- finite-hopf-integrals-frobenius-duality-and-maschke proves that a nonzero finite-dimensional Hopf algebra with a nonzero left-integral functional is Frobenius. Its hypotheses do not assert that the resulting pairing is symmetric.
- Monoidal category, Symmetric monoidal category, Braided monoidal functor, and Monoidal natural transformation fix the target coherence, symmetry-preservation, and morphism conventions.
Construction
- The oriented open-closed surface category with colored free boundary fixes black boundary parameterizations, corners, color labels, collars, gluing, and the no-free-boundary closed subcategory.
- Frobenius objects and typed colored knowledgeable sewing data gives the finite-dimensional algebra/coalgebra equations and the fully typed -colored knowledgeable data, including Cardy and the distinction between symmetric and commutative.
- A Frobenius functional determines a unique Frobenius coproduct constructs the inverse-pairing tensor from a Frobenius functional, proves basis independence, counits, coassociativity, both Frobenius identities, and the converse snakes.
- Face-relative Morse decomposition into the ten sewing generators constructs compatible face collars and decomposes a colored surface into the ten local sewing maps, including mixed saddles.
- Elementary colored surface sewings give the Frobenius relations verifies the finite generator equalities relative to all marked boundaries and colors. Typed algebraic derivations of the Frobenius sewing moves proves the pairing, copairing, zipper, window, handle, and Cardy consequences algebraically.
- The marked boundary-relative open-closed normal word defines the marked colored normal word. The complete colored boundary-relative surface normal-form theorem supplies the terminating reductions, boundary-relative uniqueness, empty-boundary cases, and disconnected tensor case.
- Closed oriented two-dimensional TQFTs are commutative Frobenius algebras proves the closed classification. Typed colored knowledgeable Frobenius data classify open-closed sewing proves the full colored open-closed equivalence, including monoidal natural transformations and the singleton pair .
The defining equations do not identify with the center of an open algebra. Cardy is an additional relation, and a symmetric noncommutative algebra is not itself a closed-sector algebra. The page makes no claim about modular three-dimensional TQFTs or point-level fully extended theories.
Reused suppliers
- Frobenius functionals and associative pairings supplies the finite-dimensional Frobenius-functional convention.
- Finite-dimensional Hopf algebras are Frobenius supplies the finite Hopf example under its nonzero left-integral hypotheses.
- For a finite group and a field of characteristic p, the group algebra is a symmetric Frobenius algebra via the coefficient of the identity proves the coefficient-of-identity form is symmetric and nondegenerate for every finite group over every field; its actual statement is broader than its title.
Sources and draft scope
The local arguments use Lauda–Pfeiffer's full open-closed generators and normal-form proof, Kock's complete lecture-note treatment of the closed theory and inverse-pairing coproduct, and Moore–Segal's independent open-closed sewing and Morse treatment. Exact source spans, inspected items, retrieval hashes, and dispositions are recorded in the batch source coverage and the harvested coverage.
These carriers remain drafts. Their proof contracts and scoped checks record authoring evidence only; they do not constitute independent mathematical approval.
Companion: frobenius-algebras-and-two-dimensional-sewing-examples.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The oriented open-closed surface category with colored free boundary
Definition
Fix a set of boundary colors. A black boundary component is a parametrized incoming or outgoing boundary circle or interval. A free boundary component is a connected component of the remaining boundary, labeled by one element of . The corners are exactly the intersections of black and free faces: each corner has one incident black face and one incident free face, with no black--black or free--free corners. A smooth structure with corners means that every point has a chart in an open subset of , , and transition maps extend smoothly to open subsets of .
Each surface representative is equipped with smooth collars of its black and free faces that are product collars in the quadrant charts at corners. A collar of a face is a smooth embedding restricting to the identity on . The collars are used only to define gluing; morphisms forget their lengths and are identified by orientation-preserving diffeomorphisms that fix every black parameterization, preserve incoming/outgoing faces, and preserve each free-boundary color. Under , compatible collars exist: use the smooth collar theorem on rounded ambient surface pieces and the finite chart-and-flow construction below to retain the prescribed product collars at corners.
An object is a finite ordered word in:
- the positively oriented circle ; and
- intervals , for , oriented from their left endpoint of color to their right endpoint of color .
The empty word is allowed. A morphism from a word to a word is an equivalence class of compact oriented smooth surfaces with corners whose black boundary is the disjoint union of a parameterized incoming copy of and a parameterized outgoing copy of , with the induced boundary orientations opposite to the object orientations on incoming components and equal on outgoing components. Every free-boundary component is colored in , and its label must equal the endpoint color of every incident black interval at each corner. No free boundary is required to be connected, and a free component may be a circle (a window) or an interval between corners.
Composition glues the outgoing black boundary of the first surface to the incoming black boundary of the second, component by component, using the fixed parameterizations. A circle matches a circle; matches the oppositely oriented copy of that same interval, with its endpoint colors in the reversed boundary orientation. Tensor product is ordered disjoint union and concatenation of words. The symmetry is the cylinder with the ordered boundary components permuted. The identity on a word is its product cylinder.
Write for this symmetric monoidal category. Its objects include circle and interval words and its morphisms may have colored free boundary.
The closed oriented surface category has only finite words of circles as objects and only morphisms with no free boundary at all. For , it is not the full subcategory of on circle words: that full subcategory also contains circle-to-circle surfaces with colored free-boundary windows. For , no free boundary can be colored, so it is the full subcategory on circle words (and every object is a circle word).
For a field , is the category of finite-dimensional -vector spaces and linear maps with the usual tensor product, unit , associator, unitors, and flip. A (closed or open-closed) 2D TQFT here is a strong monoidal functor from the indicated surface category to that preserves symmetry as in Braided monoidal functor; both categories are symmetric monoidal, so this is a strong symmetric monoidal functor. Morphisms of TQFTs are monoidal natural transformations, with the binary and unit compatibility equations of Monoidal natural transformation.
Facts & Assumptions
Given: A color set , , and the smooth surface and collar conventions above.
is the countable-choice principle used by the collar theorem (The Axiom of Countable Choice ()).
A category has objects, typed morphisms, associative composition, and identities satisfying the two identity laws (Category, object, morphism, domain, codomain, identity, composition, and hom-collection): “” and “.”
A monoidal category has a bifunctor, a unit, associators and unitors satisfying the pentagon and triangle equations (Monoidal category).
A symmetric monoidal category is a braided monoidal category whose double braiding is the identity (Symmetric monoidal category).
Under , every smooth manifold with boundary has a smooth collar (Collar neighborhood theorem).
A strong monoidal functor has invertible tensor and unit structure maps and obeys the associativity and unit coherence equations (Lax, strong, and strict monoidal functors).
A monoidal natural transformation obeys the binary tensor and unit compatibility equations (Monoidal natural transformation).
Nested Euclidean balls admit smooth bumps equal to one on the inner closed ball and supported in the outer open ball (A smooth bump between concentric Euclidean balls).
Smooth fields on boundaryless manifolds have unique smooth local flows with open time-state domain (The fundamental theorem on flows).
If the source and target symmetries are and , a strong symmetric monoidal functor with tensor structure maps satisfies , the symmetry-preservation condition of Braided monoidal functor.
Proof
Finite smooth cutoffs and partitions on the compact corner charts are obtained from [F7]: restrict ambient Euclidean bumps to each half-space or quadrant chart, using a strict support margin to extend by zero. Choose a finite family whose smaller chart neighborhoods cover the compact set, and divide its bumps by their positive sum there. Thus the interpolation below uses actual finite smooth partitions without applying a boundaryless manifold theorem to corners. A corner in a compact surface with faces is isolated, so compactness gives finitely many corners. Choose pairwise disjoint quadrant charts about them; their two coordinate directions give product collars of the incident faces that agree on the quadrant. Delete smaller quadrant neighborhoods and round the new boundary junctions inside those neighborhoods. The remaining ambient surface is a smooth manifold with boundary, so [F4] gives collars of its remaining original boundary arcs. Restrict those collars to the black and free arcs. On each overlap with a corner chart, interpolate their inward transverse vector fields with the coordinate normal field by a smooth partition of unity, taking the coordinate field on a smaller corner neighborhood. Positive inward normal components remain positive under this interpolation. Near a corner use the two coordinate fields for the two incident faces; they commute there and are tangent to the other face. Their smooth ambient local flows from [F8], restricted to inward times and a common sufficiently small width on each compact face, give face collars equal to the fixed product collars in the smaller quadrant. Away from corners the two faces do not meet, so no further compatibility is required. This finite construction gives the compatible face collars in the definition. A black face glues to an oppositely oriented black face of the same type, and the interval endpoint colors match by the stated rule; therefore the quotient retains an oriented surface with corners and the unglued free faces retain their labels.
Arbitrary compatible black collars can also be compared. Each collar is the flow collar of its normal-coordinate vector field near the face. These fields are inward transverse to that face and tangent to its incident free faces; interpolate the two fields linearly on a common neighborhood. Transversality stays positive, and tangency is preserved. Their flows give a smooth family of collars of a common smaller width, fixed on the face and preserving the free faces. On this neighborhood the velocity vanishes on the black face and is tangent to the free faces. Multiply it by a cutoff equal to one on a still smaller collar and zero outside the common neighborhood. The ambient time-dependent flow (obtained from [F8] on the product with the time coordinate) is a diffeomorphism carrying to on that smaller collar, fixing all black parameterizations and preserving the free faces. At the corners use ambient extensions of the product charts; tangency makes their restricted flows preserve each free face. Thus the resulting collar comparison descends across a glued seam. Shortening or increasing reparameterization of a collar is handled by the same construction. A diffeomorphism of either input transports its collar to a compatible collar on the other representative, so this comparison also proves independence of representatives.
For three composable representatives, both parenthesized composites identify the same three collared surfaces along the same two black boundary parameterizations. In product coordinates, both quotients are obtained by replacing the two seam collars by the same concatenated interval; a smooth increasing reparameterization of that interval gives a diffeomorphism fixed on the exterior black boundary. Hence composition is associative on equivalence classes. Gluing an identity cylinder merely lengthens a collar and is equivalent to the original surface by step 2.1.
Ordered disjoint union is associative with the empty surface as strict unit at the level of words and diffeomorphism classes, and interchange makes it a bifunctor. The cylinder that permutes components gives the symmetry. Its double application is the identity permutation. For any morphisms and , the two composites in the symmetry-naturality square are the same disjoint union of and with the same block permutation of boundary components, so they represent the same relative surface, with the component identification equal to the identity in every corresponding black collar. Each of the two hexagon composites for three words is a cylinder for the same permutation of the three blocks, so those composites also agree; a permutation with an empty block is the identity. The unit and associator are identities in this strict category, so the monoidal pentagon and triangle also hold. Thus the component-permutation cylinders satisfy the braiding and symmetry axioms directly.
The condition is preserved by gluing and disjoint union, so the circle-only objects and no-free-boundary morphisms form the stated closed symmetric monoidal subcategory. If , choose : a genus-zero circle-to-circle surface with an additional free circular face colored lies in the full circle-object subcategory but not in the closed category. If , a coloring of a nonempty free boundary would require an element of the empty set, so every morphism has no free boundary and the full subcategory equals the closed category.
For the strong symmetric monoidal functors of [F5] and [F9], identity natural transformations satisfy the binary and unit compatibility equations of [F6]; if two transformations satisfy them, substitution in those equations shows their componentwise vertical composite also satisfies them. Their identity and associativity laws hold componentwise in the target category [F1]. Thus the morphisms between the functors in the definition form the stated category.
Frobenius objects and typed colored knowledgeable sewing data
Definition
Fix a field and write for finite-dimensional -vector spaces and linear maps, with the algebraic tensor product, unit object , canonical associator , unitors and , and flip . The associator sends to ; the unitors send and to . All tensor expressions below use these maps, so no strictification is implicit.
A Frobenius object in is a finite-dimensional vector space and linear maps
such that is a unital associative algebra, is a counital coassociative coalgebra, and the two Frobenius identities hold:
Here associativity is , and the two unit equations use . Coassociativity is , and the counit equations are and .
Its Frobenius pairing is . It is symmetric when . It is commutative when . These are different conditions: commutativity implies symmetry of , but symmetry of does not assert commutativity of .
An S-colored knowledgeable Frobenius datum consists of:
- a commutative Frobenius object ;
- a finite-dimensional vector space for every ordered pair ;
- maps, for every ,
\mu_{abc}:A_{ab}\otimes A_{bc}\to A_{ac},\quad \Delta_{abc}:A_{ac}\to A_{ab}\otimes A_{bc},
and, for every $a\in S$,\eta_a:k\to A_{aa},\quad \epsilon_a:A_{aa}\to k,\quad i_a:C\to A_{aa},\quad i_a^*:A_{aa}\to C.
These maps obey the following typed equations. The first eight equations are the colored category, unit, coalgebra, counit, and Frobenius laws. The two Frobenius equalities are written separately by their domains and codomains; this avoids chaining opposite-direction composites into one equation. 1. For $a,b,c,d\in S$, associativity is\mu_{abd}\circ(1_{A_{ab}}\otimes\mu_{bcd})\circ\alpha_{A_{ab},A_{bc},A_{cd}} =\mu_{acd}\circ(\mu_{abc}\otimes1_{A_{cd}}),
as maps $(A_{ab}\otimes A_{bc})\otimes A_{cd}\to A_{ad}$. 2. The left and right units are\mu_{aab}\circ(\eta_a\otimes1_{A_{ab}})=\lambda_{A_{ab}}, \qquad \mu_{abb}\circ(1_{A_{ab}}\otimes\eta_b)=\rho_{A_{ab}}.
\alpha_{A_{ab},A_{bc},A_{cd}}\circ(\Delta_{abc}\otimes1_{A_{cd}})\circ\Delta_{acd} =(1_{A_{ab}}\otimes\Delta_{bcd})\circ\Delta_{abd},
(\epsilon_a\otimes1_{A_{ab}})\circ\Delta_{aab}=\lambda_{A_{ab}}^{-1}, \qquad (1_{A_{ab}}\otimes\epsilon_b)\circ\Delta_{abb}=\rho_{A_{ab}}^{-1}.
\Delta_{abd}\circ\mu_{acd} =(1_{A_{ab}}\otimes\mu_{bcd})\circ\alpha_{A_{ab},A_{bc},A_{cd}}\circ(\Delta_{abc}\otimes1_{A_{cd}}),
as maps $A_{ac}\otimes A_{cd}\to A_{ab}\otimes A_{bd}$, and\Delta_{acd}\circ\mu_{abd} =(\mu_{abc}\otimes1_{A_{cd}})\circ\alpha^{-1}{A{ab},A_{bc},A_{cd}}\circ(1_{A_{ab}}\otimes\Delta_{bcd}),
as maps $A_{ab}\otimes A_{bd}\to A_{ac}\otimes A_{cd}$. 5. The trace is cyclic across opposite colors:\epsilon_a\circ\mu_{aba} =\epsilon_b\circ\mu_{bab}\circ\tau_{A_{ab},A_{ba}}
as maps $A_{ab}\otimes A_{ba}\to k$. 6. Each $i_a$ is a unital algebra map, its image acts centrally on each $A_{ab}$, and $i_a^*$ is pairing-adjoint to $i_a$:\mu_{aaa}\circ(i_a\otimes i_a)=i_a\circ\mu_C,\qquad \eta_a=i_a\circ\eta_C,
\mu_{aab}\circ(i_a\otimes1_{A_{ab}}) =\mu_{abb}\circ\tau_{A_{bb},A_{ab}}\circ(i_b\otimes1_{A_{ab}})
as maps $C\otimes A_{ab}\to A_{ab}$, and\epsilon_C\circ\mu_C\circ(1_C\otimes i_a^*) =\epsilon_a\circ\mu_{aaa}\circ(i_a\otimes1_{A_{aa}})
as maps $C\otimes A_{aa}\to k$. 7. The colored Cardy equation isi_a\circ i_b^* =\mu_{aba}\circ\tau_{A_{ba},A_{ab}}\circ\Delta_{bab}:A_{bb}\to A_{aa}.
In particular, the reverse labels on $A_{ba}$ and $A_{ab}$ are required for the displayed composites to type-check. A **homomorphism** from unprimed to primed S-colored data is a family of linear maps $f_C:C\to C'$ and $f_{ab}:A_{ab}\to A'_{ab}$ such that $f_C$ preserves the four Frobenius maps on $C$:\mu'_C(f_C\otimes f_C)=f_C\mu_C,\quad f_C\eta_C=\eta'_C,\quad \Delta'_C f_C=(f_C\otimes f_C)\Delta_C,\quad \epsilon'_C f_C=\epsilon_C,
\mu'{abc}(f{ab}\otimes f_{bc})=f_{ac}\mu_{abc},\quad f_{aa}\eta_a=\eta'a,\quad \Delta'{abc}f_{ac}=(f_{ab}\otimes f_{bc})\Delta_{abc},
\epsilon'a f{aa}=\epsilon_a,\quad f_{aa}i_a=i'a f_C,\quad f_C i_a^=i_a^{'}f{aa}
for all indicated labels. Composition and identities are componentwise. For singleton $S=\{*\}$, write $A=A_{**}$, $i=i_*$, and $i^*=i_*^*$; this is the usual pair $(A,C,i,i^*)$. For each $a,b\in S$, define the open pairingb_{ab}:A_{ab}\otimes A_{ba}\to k,\qquad b_{ab}:=\epsilon_a\circ\mu_{aba}.
The cyclic trace equation above identifies $b_{ab}$ with the reversed pairing $b_{ba}\circ\tau_{A_{ab},A_{ba}}$. The equations do not impose nondegeneracy as a separate axiom: [Typed algebraic derivations of the Frobenius sewing moves](/item/lem-frobenius-sewing-derived-moves "forward-reference") proves that both induced maps to algebraic duals are isomorphisms, by exhibiting the two snake composites. For $a=b$, this is the symmetric Frobenius pairing on $A_{aa}$. No equality $C=Z(A_{aa})$ is part of the definition. The Cardy equation is an additional map equality; it does not identify the underlying vector spaces or force the whole open algebra to be commutative.Diagram convention
The diagram records the two typed Frobenius composites in the uncolored case. Both arrows start at and end at ; the associator indicated by is part of the second composite. The diagram is explanatory; the equations above are the definitions.
A\otimes A \arrow[r, bend left=18, "\Delta\circ\mu"] \arrow[r, bend right=18, "{(1\otimes\mu)\circ\alpha\circ(\Delta\otimes1)}"']
& A\otimes A
A Frobenius functional determines a unique Frobenius coproduct
Statement
Let be any field, let be a finite-dimensional unital associative -algebra, and let be a Frobenius functional, so is nondegenerate in both variables. Then there is a unique tensor
such that, for every ,
It is independent of the basis used to construct it and satisfies
The map defined by is coassociative, has counit , and satisfies both Frobenius identities. Conversely, every finite-dimensional Frobenius object in has nondegenerate functional pairing , and this is the unique coproduct with that counit and Frobenius identities.
Symmetry of is not assumed. If it holds, the Frobenius object is symmetric; if is commutative, then is symmetric, but neither condition is identified with the other.
Facts & Assumptions
Given: A field , a finite-dimensional unital associative -algebra , and a linear functional for which is nondegenerate in each variable.
A Frobenius functional on a finite-dimensional unital algebra is exactly a functional whose associative form is nondegenerate (Frobenius functionals and associative pairings).
For a finite basis , the ordinary dual family is a basis of and (The dual family of a finite basis is a basis of the dual space, with the same dimension).
The Frobenius-object conventions are the algebra, coalgebra, and two typed Frobenius identities of Frobenius objects and typed colored knowledgeable sewing data.
Proof
Choose a basis of . The map given by is an isomorphism by [F1]. Define . Then , and [F2] gives For the second identity, apply to its proposed right side: . These functionals separate elements by nondegeneracy in the second variable, so the right side equals . Set .
Conversely, suppose satisfies [F3], and put . With the canonical associators and unitors, the two snake composites are and For , replace by and use the Frobenius identity ; naturality of moves to the first input. The left unit equation reduces the composite to , which is by the right counit. For , use ; the right unit equation reduces it to , which is by the left counit. Thus both snake composites are identities.
The first displayed dual-basis identity gives , and the second gives , so this has the required two contraction properties. If another tensor has the first property, contracting its first factor against every functional gives the same vector for every fixed ; these functionals range over all of by nondegeneracy. Hence the tensors are equal. The contraction map is an isomorphism in finite dimension, so the tensor is intrinsically defined and independent of the basis.
To prove , test the two tensors against arbitrary . Nondegeneracy supplies with and . The first contraction is by the second dual-basis identity applied to . The second is by the same identity applied to . Since such product functionals separate tensors, the two tensors agree.
Define . Then . Also by the second identity in step 1.1 at . The central relation of step 2.2 gives Expanding these two equalities with the associator is exactly the pair of Frobenius identities in [F3].
The defining contraction also yields, for all , This establishes the contraction identity.
If is another coproduct with counit and the two Frobenius identities, write . Applying the counit identities to and using each Frobenius identity gives Step 2.1 therefore gives . The Frobenius identity then gives , so the coproduct is unique.
Use the tensor-product pairing to test coassociativity. For any , step 4.1 gives The pairing is nondegenerate: in any basis its matrix is the Kronecker product of three invertible matrices for . Thus the two tensors are equal, proving coassociativity.
The two snake identities exhibit inverse maps between and for the left and right pairings, respectively; hence is nondegenerate in both variables. It follows that is a Frobenius functional by [F1], and step 4.2 gives uniqueness of . Symmetry of and commutativity of remain the separate properties defined in [F3].
Face-relative Morse decomposition into the ten sewing generators
Statement
Assume . Let be a compact oriented smooth surface with black incoming/outgoing boundary, colored free boundary, and compatible corner collars as in The oriented open-closed surface category with colored free boundary. There is a smooth function such that:
- is exactly the incoming black boundary and is exactly the outgoing black boundary; an absent incoming or outgoing boundary is the empty level;
- near each black face, is its inward collar coordinate or one minus that coordinate, so it has no relative critical point there;
- on each free boundary face, the restriction is a Morse function with no critical point at a corner, and the normal derivative is nonzero at each of its critical points;
- each interior critical point is nondegenerate, and all interior and free-face critical values are distinct.
Cutting at regular levels between its finitely many critical values expresses its morphism as a finite composite of identity cylinders and the following ten boundary-relative cobordisms, with each local color retained:
Here a regular level is a level at which the interior differential and every free-face tangential derivative are nonzero. A critical index is the number of negative squares in the interior Morse normal form, or for a free-face minimum and for a free-face maximum.
Local-model diagram
This case diagram summarizes which generator family a one-critical-point slab belongs to. The proof below supplies the chart and boundary-label argument; the diagram is only a case index and is not used as a proof.
\text{interior index }0 \arrow[r, "\text{disk birth}"] & \eta_C
\\
\text{interior index }2 \arrow[r, "\text{disk death}"] & \epsilon_C
\\
\text{interior index }1,\ \text{circular feet}
\arrow[r, "\text{merge/split}"] & \mu_C\text{ or }\Delta_C
\\
\text{mixed interior index }1 \arrow[r, "\text{two incidences; cut at core and free face}"]
& \text{composites of the ten generators}
\\
\text{free-face critical point}\arrow[r, "\text{index and normal sign}"]
& \eta_a,\epsilon_a,\mu_{abc},\Delta_{abc},i_a,i_a^*
Facts & Assumptions
Given: The compact oriented surface and its black/free face labels and collars, , and the ten object types above.
The category in The oriented open-closed surface category with colored free boundary fixes black parameterizations, free-face colors, corner charts, and the boundary-relative equivalence used for cutting and gluing.
Under , smooth manifolds with boundary admit smooth collars (Collar neighborhood theorem).
Under , the bad parameter set for a finite-dimensional smooth family transverse to the zero section is a null subset of the parameter manifold (Parametric transversality).
In a positive-dimensional manifold, a null subset has dense complement; under this holds for manifold-null sets (A null set has dense complement in a positive-dimensional manifold).
Near an interior nondegenerate critical point, there are coordinates in which (Morse lemma).
A smooth function is Morse when all its critical points are nondegenerate, and excellent when those critical values are pairwise distinct (Morse functions and excellent Morse functions).
A smooth Euclidean map with invertible derivative is a local diffeomorphism without a choice assumption (Choice-free smooth inverse function theorem in Euclidean space).
In every positive Euclidean dimension, nested balls admit smooth functions into equal to one on the smaller closed ball and supported in the larger open ball (A smooth bump between concentric Euclidean balls).
A compact subset of an open set in a smooth manifold admits a smooth bump equal to one on a neighborhood of that compact set and supported in the open set (A manifold bump for a compact set inside an open set). Here this supplier is applied only on the boundaryless interior or on an open free-face coordinate neighborhood.
Smooth vector fields on boundaryless manifolds have unique smooth local flows with open time-state domain and inverse negative-time slices (The fundamental theorem on flows).
A smooth field tangent to the boundary of a smooth manifold with boundary has a two-sided local ambient flow whose defined time slices preserve the boundary (Boundary-tangent fields have boundary-preserving local two-sided flows).
Proof
If , use the empty function and empty generator word; all assertions are vacuous. For nonempty , the finite bump and partition constructions used below also work in its corner charts: extend a chart to an ambient Euclidean open set, use [F8] on nested balls there, restrict to the half-space or quadrant, and extend by zero outside the chart. A strict support margin makes that extension smooth, including on boundary faces. Smaller restricted balls cover each compact set in question; choose a finite subcover. The corresponding nonnegative bumps have positive sum near that compact set, so form a smooth finite subordinate partition there. Each selected bump is one on a smaller chart neighborhood. For a cutoff equal to one near an entire compact set and supported in a prescribed open neighborhood use ; its support lies in the finite union of the strict chart supports. This proves the corner-chart partition and cutoff assertions directly from [F8], rather than applying a boundaryless partition theorem to corners. There are finitely many corners: the depth-two stratum of a compact surface with faces is a closed discrete zero-manifold, so its singleton neighborhoods have a finite subcover. Choose disjoint quadrant charts at these corners. The two coordinate directions in each quadrant give product collars of the two incident faces. Delete smaller quadrant neighborhoods, round their new junctions inside those neighborhoods, and apply [F2] to the remaining ambient smooth surface with boundary. Restrict its collars to the remaining original face arcs. Interpolate the associated inward transverse fields with the coordinate normal fields on the finite overlaps, keeping the latter fields fixed in smaller quadrant charts. Positivity of the inward component is preserved by the partition-of-unity interpolation. The two fields commute and are tangent to the opposite face in those smaller charts, so their local ambient flows from [F10], restricted to inward times and a sufficiently small common collar width, give exactly the product corner collars; elsewhere the faces are disjoint. Thus the black and free faces have compatible collars. On a black collar prescribe at an incoming face and at an outgoing face.
Each free boundary component is either a circle or an interval between corners. On a circle use with . For an interval, its endpoint values are or . If they differ, use the monotone profile or . If both are , take a smooth nonnegative bump symmetric about , supported in and positive at ; such a bump is obtained from [F8] using a ball centered at . Normalize it by its positive finite integral to obtain with . Define and . Then is nonincreasing, equals and near the respective endpoints, satisfies , and has its unique zero at with . Thus has one transverse zero, while , for , and ; its endpoint derivative germs are and . If both endpoints are , use one minus that profile. The endpoint germs match the black-corner collar coordinates. A smooth inward extension is chosen with near the endpoints, so it agrees with the black-corner collars, and at each free-face critical point, so the full differential is nonzero there. Every critical value lies strictly between and . Do not scale a profile after its endpoint germs have been fixed. Instead choose pairwise disjoint free-face coordinate neighborhoods of its finitely many critical points, with closures away from corners. By [F8] choose a cutoff supported in each neighborhood and identically one on a smaller neighborhood of the critical point. Replace there by . On the transition annuli has a positive minimum; choose smaller than that minimum. Hence no new free-face critical point occurs, while the derivative and Hessian near the old point are unchanged and its value shifts by exactly . Choose the finitely many constants successively, avoiding the finitely many previously selected critical values. The supports are away from corners, so every endpoint germ remains fixed. Extend each perturbation constantly in the inward variable on a smaller collar and cut it off farther in using [F8]; its inward derivative on the face is zero, so the prescribed nonzero normal derivative at the critical point is unchanged. The compact perturbation supports have positive distance in value from , so sufficiently small constants retain the range and the prescribed extreme levels.
Use the finite corner-chart cutoff construction of step 1.1 to choose near the compact boundary with support in the neighborhood carrying the prescribed smooth collar function . Shrink that neighborhood so lies in , with equality only on the prescribed black faces. Set , interpreting the first term as zero off that neighborhood. The strict support margin makes it smooth, it agrees with the prescribed function near every face, and its range and extreme levels are correct. On the resulting boundary neighborhood the full differential is nonzero: on black faces the collar derivative is nonzero; on free faces either the tangential derivative or the chosen normal derivative is nonzero; at corners the tangential germ is the nonzero linear endpoint germ. Compactness therefore leaves a compact set in the interior outside which no perturbation is needed. Cover by finitely many coordinate charts and smaller open sets whose union contains . Choose the with compact closures in and apply [F9] on the boundaryless interior to obtain bumps supported in and equal to one near . The differentials of the finitely many functions span every cotangent fiber on a neighborhood of .
If , the constructed differential is already nonzero everywhere in the interior, so there are no interior critical points and no parameter choice or density argument is needed. Retain in this case. If , at least one two-dimensional chart is present and the parameter space below has positive dimension. For parameters in an open ball about , set . Put and , extending each chart-supported function by zero outside its chart. Then is an open neighborhood of , is compact in the interior, and : on each , the differentials span the cotangent fiber, so at least one of those functions has nonzero differential at each point and that point lies in its support. The parameter derivatives therefore span every cotangent fiber on . On , is nonzero because and has no zeros outside . For each point of this compact set, continuity of gives a product neighborhood on which the differential remains nonzero; a finite subcover yields a common parameter neighborhood of preserving nonvanishing throughout . Outside the perturbation vanishes, so the differential remains . Restrict the parameter ball to that neighborhood and small enough that the range stays in . On the evaluation map is transverse to the zero section because its parameter derivatives span each cotangent fiber. Apply [F3] to this family on the positive-dimensional manifold : its bad parameter set is null. The parameter space is positive-dimensional, so [F4] makes the good parameters dense; in particular the restricted open ball contains one. For this choice, all critical points lie in and are nondegenerate. By [F6] the interior restriction is Morse. Its critical set is closed and contained in the compact set , so it is compact; because each nondegenerate critical point is isolated, it is finite.
If there are no interior critical points, skip these interior perturbations. Otherwise choose pairwise disjoint small interior chart neighborhoods of the finitely many critical points and use [F9] to obtain bumps supported there and equal to one on smaller closed neighborhoods. Choose a smooth Riemannian metric on by covering the compact surface with finitely many corner charts and patching their Euclidean metrics with the finite smooth partition construction of step 1.1. For its induced cotangent norm, is continuous and positive on the compact complement of those smaller neighborhoods, so it has a positive minimum. Choose the bump supports and then the constants small enough that the norm of the perturbation differential is smaller than this minimum on the transition annuli; no new critical point is created there. Near each critical point the bump is constant, so its differential and Hessian are unchanged while its critical value shifts by that constant. Choose the constants successively to avoid the finite set of free-face and already fixed interior values. The boundary collars stay fixed, and the constants can be small enough that the range remains in . Thus all critical values are distinct. On a component with no incoming or outgoing black face, first place the free/interior function in a compact subinterval of ; its absent endpoint level is then empty.
An interior critical point of index zero or two has a disk birth or death neighborhood by the Morse lemma, giving or . An interior saddle is a rectangular band attached to two disjoint subintervals of the preceding regular level. This level is a compact one-manifold, so each affected component is a circle or an interval. The band is untwisted, because its orientation extends that of the surface. If both affected level components are circular, or both feet lie on one circular component, the usual two circle configurations give or . If an interval occurs, the only possibilities are two distinct intervals, two feet on one interval, or one interval and one circle. Indeed these exhaust whether the two feet belong to the same or different level components and whether those components have endpoints. Two feet on a single interval split it into an interval and a circle; reversing the slab gives the interval/circle merge. Two different intervals are reconnected into two intervals. A twisted reconnection would give a nonorientable band and is excluded.
The six mixed representatives and their types are the following. A permutation of the listed input or output slots is implemented by the symmetry cylinders; it never changes an interval's own endpoint labels. In rows 1–2 the canonical type is . These are the two choices of which incoming interval is split in a two-interval reconnection. Rows 3–6 have the types shown. The letter at a newly exposed free edge is determined by the free edge already meeting that end of the slab, so no arbitrary color is introduced.
At a free critical point the tangential restriction has a nondegenerate extremum and the inward normal derivative is nonzero by construction. In coordinates inward and tangential its chart can be taken as : apply [F7] to the map , whose Jacobian determinant is the nonzero inward normal derivative, followed by the one-dimensional Morse coordinate on the boundary. A free minimum with positive inward normal derivative births an interval and gives ; a free maximum with negative inward derivative kills one and gives . A free maximum with positive inward derivative joins the two local level ends: if they close the one interval into a circle the slab is (two corners), and otherwise they join two intervals into one, giving (six corners). A free minimum with negative inward derivative is the reverse: has two corners and has six. The label at the extremum is the label of the single free face through that point; all other endpoint labels are carried by product collars. There is no zero-normal-derivative case in the function constructed in the preceding boundary-relative construction, and no assertion about a full boundary Hessian is needed.
Here is a boundary-relative verification of the cuts in that table. Write for an incoming black interval read in induced surface-boundary orientation, for an outgoing interval, and for an intervening free arc of color . In rows 1–2, call the inputs and outputs . The one-saddle slab is two interval product rectangles joined by the untwisted rectangular band along one edge in each rectangle, hence is a disk: successively attaching each rectangle along a full band edge leaves a disk. Its boundary word is For row 1 cut the / seam ; for row 2 cut the / seam . Each composite consists of two disks joined along that seam. Reading the remaining edges gives precisely the displayed word. The apparent crossing in each formula is a permutation of black slots; it does not identify any free edges. In rows 3–4 the slab is an annulus with outer boundary word and inner boundary the incoming closed circle . This can be seen directly from the untwisted band on a circle and an interval: slit the circle at a point away from the band foot, then cut through the intervening product strip to the indicated outer free arc; the band and the slit level collars unfold to a disk. For the composite, the zipper is an annulus with inner boundary ; attaching the product disk along its interval seam replaces an interval of the outer boundary by the complementary boundary arc of that disk. This disk attachment preserves the annulus and gives exactly . Choose an auxiliary arc in the zipper from to the surviving part of its free arc, of color in row 3 and in row 4. Its interior avoids the product seam. Cutting along this auxiliary root-to-hole arc gives one disk. It is not the interval gluing seam: cutting that seam instead separates the original disk and annulus. In either the slab or composite split the outer cyclic word at the auxiliary arc's endpoint, writing it ; the cut word is . Choose corresponding endpoints on the indicated free arc, so the two cut words and their paired seam sides agree, including all black parameterized subarcs and free labels. Rows 5–6 are the height reversals of these annular cut models, with the original interval parameterizations retained. Matching these disk words gives diffeomorphisms relative to black collars: after rounding their nonblack corners, an orientation-preserving circle map extends across the disk by interpolating its lifted angular map to the identity near the disk center; on a prescribed boundary collar use its product extension. Regluing each pair recovers the annular diffeomorphism. Thus these are actual local factorizations, including the two interval reconnections and all four interval/circle orientations.
Choose regular values surrounding each critical value, and first consider a compact slab containing no interior or free-face critical value. Extend it a little through its two regular black level faces using the product level charts supplied by [F7] from the nonzero tangential or interior differential; at an actual incoming or outgoing black face use the given collar to add a short exterior strip. This gives a neighborhood of whose only boundary near is the free boundary, with no remaining corner at the extended black levels. On a free face define the tangent field and extend it smoothly to a smaller collar; its denominator is nonzero throughout the regular slab. Near an interior point choose a coordinate direction with nonzero and divide its coordinate field by that derivative. The finite chart partitions from step 1.1 glue these fields while preserving and tangency along the free faces. The extended neighborhood is a smooth manifold with boundary, and its entire boundary near is the free face to which is tangent; thus [F11], not a theorem requiring tangency to the transverse level faces, gives its boundary-preserving local flows. In interior charts the same flow is supplied by [F10]; uniqueness makes the charts agree. At every point of compact the open flow domain contains for some neighborhood. A finite subcover gives a common positive lower time bound. Since , a trajectory stays in until its level reaches an endpoint; it cannot cross a free face by [F11]. Restarting in this finite cover with increments below the common bound constructs the trajectory through every time needed between and . This proves finite-time existence on the slab without an unjustified completeness assumption. The map , , has inverse . These maps are smooth by [F10]–[F11] and preserve each free component, hence every color; they identify the slab with its product, with the level collars retained. Each critical slab is one of the interior, free-boundary or mixed local models already proved. Concatenating the finitely many slabs gives the generator word and identity cylinders. Apply the finite construction to each connected component and tensor the words; the empty component family gives the empty word.
Proof tables
| Row | Composite | Type |
|---|---|---|
| 1 | ||
| 2 | ||
| 3 | ||
| 4 | ||
| 5 | ||
| 6 |
Elementary colored surface sewings give the Frobenius relations
Statement
In the category of The oriented open-closed surface category with colored free boundary, the ten generator surfaces obey the boundary-relative equalities whose images under a strong symmetric monoidal functor are precisely equations 1–7 in Frobenius objects and typed colored knowledgeable sewing data. Thus the closed pair of pants, disk, and reversed pair of pants give a commutative Frobenius object; the open pair of pants, disk, and reversed pair of pants give the indexed open algebra/coalgebra/Frobenius equations and cyclic trace; the zipper and cozipper give the central unital algebra map, pairing adjunction, and colored Cardy equality. Each equality preserves every black parametrization, corner endpoint color, and free-boundary label. This lemma proves the listed relations; it does not assert that they present all surface morphisms.
For the singleton color set, write and , ; then the open pairing is symmetric, while commutativity is required only of .
Facts & Assumptions
Given: A color set , the collared boundary-relative surface category, and its ten elementary cobordisms with the source and target labels specified in the two linked definitions.
A morphism is an orientation-preserving diffeomorphism class relative to every black parameterization and preserving each free-boundary color; gluing uses matching collars and endpoint colors (The oriented open-closed surface category with colored free boundary).
The ten algebraic generator maps and their typed composites are those in the definition of S-colored knowledgeable data; in particular, the two Frobenius composites have separately typed domains and codomains (Frobenius objects and typed colored knowledgeable sewing data).
A strong symmetric monoidal functor preserves identities and composition, obeys the monoidal coherence equations, and preserves symmetry under its tensor structure maps as in Braided monoidal functor (Lax, strong, and strict monoidal functors, Symmetric monoidal category).
Proof
We first give the elementary cut procedure used in every certificate below. Let be a round disk with disjoint smaller round disks removed. Each is the cyclic word of marked black intervals and colored free arcs on that component, or a single marked black circle. The orientation on is opposite to that on the interior holes, as dictated by the surface orientation. A word is always read in the induced surface-boundary direction; and denote an incoming and outgoing black slot. To cut into a disk, pick a nonblack basepoint on each component with such a point, or a basepoint on a black circle otherwise, and draw disjoint arcs from to . Arrange the arcs at the root in the order . After cutting them the disk boundary word is Black circle basepoints are auxiliary, not extra markings. A desired circle parameterization is respected on its whole collar, including this point. If two cut patches have this same word, match the corresponding black collars by their parameterizations and match each colored free arc by an increasing smooth map. Match the two sides of every by identical product maps. This gives a disk-boundary map extending to the collars. After rounding the nonblack corners, lift the remaining angular map to a strictly increasing map of with . The interpolation has positive derivative for . Use near the center and near the boundary; its polar extension is smooth and orientation preserving, and agrees with the prescribed collar map after the collar is attached. Regluing the paired edges gives the desired diffeomorphism. This proves the cut criterion directly for these planar models; no surface normal-form theorem is used.
Here are the three gluing rules for computing the certificates. A disk generator with cyclic word glued to another disk with word along an interval seam becomes the disk with word ; this follows by placing the two collars along the two sides of the same straight segment in a disk. If either disk has holes, carry their disjoint removed disks through this construction; the holes are simply retained. Gluing a boundary circle of one planar patch to one of a different planar patch joins their annular collars and gives a planar patch with the unglued boundary components; this can be seen by placing one punctured disk in the deleted disk of the other, using inversion of the annular radial coordinate on the collar. Finally, two disks glued along two disjoint interval seams give an annulus when the boundary splicing yields two boundary cycles. To check this without a classification theorem, first glue one seam to obtain a disk; the second seam identifies two boundary intervals with opposite induced orientations. Their standard rectangular collar is a strip joining those intervals outside the disk. The two complementary boundary arcs are distinct, and a cut through that strip returns a disk. Its regluing is precisely . All these constructions respect the marked portions of the boundary. The rule for one interval seam can be applied repeatedly to any tree of disk/annulus patches.
A product generator is a disk with cyclic boundary word . A coproduct generator is the same disk read with reversed heights, with word . The unit and counit are disks with a single black interval and its complementary free arc. A zipper is an annulus with words , and a cozipper is an annulus with words . The closed product and coproduct are punctured disks with three marked circle boundaries; the closed unit and counit have one. These are concrete choices of the elementary patches. The gluing rules in step 2.1 give the following exhaustive table for the defining equations of the data definition. In the table each displayed word belongs to an individual full boundary component; a semicolon separates components. means one free arc of color , including the case of the complementary arc of a single marked interval.
Every row is a finite application of the gluing rules to specified disks or punctured disks. The rules prove planarity by construction; planarity is not inferred merely from an Euler characteristic or an appeal to the classification under proof. For an open row with one boundary component the displayed word is already the cut disk. For the other rows cut the indicated root-to-hole arcs, and use step 1.1. The identical words and paired seam sides give orientation-preserving diffeomorphisms fixed on every external black collar and preserving each free-edge label. In particular the Cardy row retains separate - and -labeled boundary components, and the open Frobenius rows retain their different domains and codomains. The cyclic trace row allows rotation of the disk boundary word but fixes the actual black slots after their specified symmetry; it gives no open commutativity assertion.
The rows give the closed Frobenius, open indexed Frobenius, cyclic trace, zipper algebra, centrality, pairing adjunction and Cardy equations of the data definition. The strong monoidal coherence maps of a functor carry the product-cylinder associators and unitors coherently, and its symmetry-preservation equation from [F3] carries every symmetry cylinder to the target symmetry. Applying it to these actual surface equalities therefore gives exactly the typed equations in the data definition. No relation-completeness assertion has been used.
Proof tables
| Equation, with external slots fixed | Common boundary certificate | Internal seams and reduction to the certificate |
|---|---|---|
| Closed associativity | Two pants, one circle seam; the seam separates from on the left and from on the right. Apply the circle rule. Cut three root-to-hole arcs as in 1.1. | |
| Closed left unit | Cap the first input circle of the pants with the unit disk. Its complementary annular collar is the displayed annulus. | |
| Closed right unit | Cap the second input circle instead. | |
| Closed coassociativity | Reverse the associativity certificate and its circle seam. | |
| Closed left and right counits | Reverse, separately, the two unit certificates. | |
| Closed Frobenius, left attachment | Two pants, one circle seam; on the left the seam separates the two inputs from the two outputs, on the right it separates from . Apply the circle rule and the three root cuts. | |
| Closed Frobenius, right attachment | The right seam now separates from with the other pants designated first. The marked four circles are retained individually; the same three root cuts apply. | |
| Closed commutativity | There is no seam; label the two holes by their actual external slots after applying the symmetry cylinder. Root-to-hole cuts give the same word. This argument fixes the output circle parameterization. | |
| Open associativity on | Left seam , right seam ; apply the one-interval rule to the two product disks. | |
| Open left unit on | Seam joins the unit disk to the first product slot; splice the words, joining the adjacent free arcs. The result is the identity strip. | |
| Open right unit on | Seam joins the unit to the second slot; the adjacent arcs join. | |
| Open coassociativity and the two counits | Reversed words of the preceding three rows | Reverse each interval seam and each black sign in the corresponding row. The labels are unchanged, so this gives all three separate certificates. |
| First typed open Frobenius on , outputs | Left seam in ; right seam in . Word splicing on either seam gives the displayed disk. | |
| Second typed open Frobenius on , outputs | Left seam in ; right seam in . The one-interval rule again gives the displayed disk. | |
| Cyclic trace on | Left product/counit seam , right product/counit seam . Splicing yields the same cyclic word, with its two marked inputs individually fixed after the symmetry. | |
| Zipper unit | The closed unit fills the sole hole of the zipper annulus. | |
| Zipper product on circles | Left: circle seam joins a pants to a zipper. Right: interval seams join the two separate zipper annuli to the product disk. Apply the circle rule on the left and the interval rule twice on the right. Both give two holes, individually marked , and root word . | |
| Centrality on | Left interval seam joins to ; right interval seam joins to after the slot symmetry. The interval rule leaves the same hole and the same outer word. Use one root-to- cut. | |
| Pairing adjunction on | Left: circle seam between and , then the circle seam to . Right: interval seam between and , then the interval seam to . The circle and interval rules leave the same annulus; cut from its outer free arc to its inner collar. | |
| Cardy on , output | Left: one circle seam joins the two annuli . Right: two interval seams, and , join the coproduct disk and product disk in the order specified by . Splicing the two disk words gives exactly the two cycles and . The two-seam rule gives the annulus. Cut it from to ; the cut-disk word is . |
Cardy diagram
The equation has source and target ; the intermediate factors on its right-hand expression are before the flip and after it.
A_{bb} \arrow[rrr, bend left=18, "i_a\circ i_b^*"']
\arrow[r, "\Delta_{bab}"]
& A_{ba}\otimes A_{ab} \arrow[r, "\tau"]
& A_{ab}\otimes A_{ba} \arrow[r, "\mu_{aba}"]
& A_{aa}
Typed algebraic derivations of the Frobenius sewing moves
Statement
For S-colored knowledgeable data of Frobenius objects and typed colored knowledgeable sewing data, all of the following identities follow from its typed equations: open and closed evaluation/coevaluation snakes; symmetry and cyclic invariance of the pairings and their adjoint copairings; both zipper/cozipper pairing and copairing transports; coalgebra and counit preservation by each cozipper; sliding of closed-window and handle operators; the Cardy reduction of an open handle through the closed sector; and cyclic rotation of an open product followed by a cozipper. In particular, define
Both maps to algebraic duals induced by and are isomorphisms. With , , , , and , the typed consequences include
The same map identities hold in the formal symmetric monoidal presentation generated by the ten typed elementary surfaces and their equations in Elementary colored surface sewings give the Frobenius relations. Here the tensor unit replaces , and finite-dimensional dual-isomorphism statements are confined to the vector-space specialization. Thus the identities may be used as surface rewrites before classification. This formal assertion is proved by faithful bending in step 4.1; equality of vector-space evaluations alone is not used to infer a surface equality.
Facts & Assumptions
Given: A field , a color set , and S-colored knowledgeable data satisfying all typed equations 1–7 of the linked definition. For the formal-presentation assertion, interpret the same typed equations as maps in the symmetric monoidal surface presentation; the argument uses evaluations and coevaluations derived from those equations, without finite-dimensionality.
In the vector-space specialization each is finite-dimensional; its maps have the displayed sources and targets, and its composition, Frobenius, trace, centrality, adjunction, and Cardy equations are exactly those in Frobenius objects and typed colored knowledgeable sewing data.
The closed object is a commutative Frobenius object, and the indexed elementary sewing relations hold as the equations listed in the definition (Elementary colored surface sewings give the Frobenius relations).
In a Frobenius object , the two Frobenius equalities, unit equations, and counit equations have the associator and unitor types displayed in Frobenius objects and typed colored knowledgeable sewing data.
Proof
For each , write and take . Apply the first typed Frobenius identity with labels to . The left unit equation gives ; the right-hand composite gives . Applying and the right counit to this equality gives This is the typed snake where the associator maps to . Apply the second Frobenius identity with labels to , then apply and the left counit. For and the same , this gives , which is the other typed snake The closed object has the same two snakes with and : apply its uncolored Frobenius identities to and and then use its two counits. Writing , the first snake says has inverse , because . The second says has inverse . Thus both induced maps to the opposite algebraic duals are isomorphisms.
The trace equation says . To prove copairing symmetry explicitly, put and . For arbitrary and , contract each proposed tensor in against , where and . The two contractions are respectively The first equality uses the second snake for ; the second uses trace symmetry followed by the first snake for . By step 1.1 the maps and exhaust the two dual spaces. Their tensor products separate tensors, proving the typed equality . The same proof gives .
For , the full copairing-invariance identity is the following equality of maps : The first composite goes through , , . The last goes through , , . To prove the first equality, precompose the second typed Frobenius law with labels by . Its left side becomes by the right unit, and its right side becomes by . For the last equality precompose the first typed Frobenius law with labels by . Its left side becomes by the left unit, and its right side becomes by . Thus every displayed map is well typed and the equality follows directly from defining relations, without an implicit transpose. Replacing the three open spaces by gives both closed copairing invariances with the same associators/unitors.
Here is the full reversed-factor transpose behind that identity. Set , , , , , . Let be the following specified composite of associators and flips: Thus . Define , a perfect pairing between and . Its perfection follows from the two finite-dimensional perfect pairings of step 1.1: in dual bases its matrix is a permutation of the tensor product of two invertible pairing matrices, hence invertible. The explicit transpose equality of maps is For its verification write . Step 2.2 with labels gives . Therefore the right side at equals The first intervening equality is indexed associativity under ; the next is the second snake for ; the last is indexed associativity under . This proves the reversed-factor transpose including its exact flip. The pairing invariance itself is the equality on . Hence both the pairing and its coproduct transpose, for every triple of labels, have been expanded as actual typed composites.
For arbitrary put For all , the full multiplication slides, as maps , are To prove the first, the first Frobenius law with labels gives The last equality is indexed associativity. For the second use the second Frobenius law with labels : Set the first or second input to the appropriate unit to obtain . Consequently for , Here is the preceding unit specialization, so this step needs no unproved centrality or extra symmetry.
We justify formal use by faithful bending. Suppose has the dual , evaluation and coevaluation , with both snakes proved from Frobenius and units as in this lemma step 1.1. For define For define Naturality of associators/unitors and the snake on give . In detail the composite is the map obtained by tensoring with and then evaluating on its first two factors; the snake is Precomposing this map by proves the identity. Thus D is injective on Hom sets with no vector-space assumption. For tensor outputs use , dual , evaluation exactly the reversed-factor P-composite in step 3.1, and coevaluation formed by inserting between the two factors of , using canonical unitors and reassociating to . In flattened tensor notation this is . The two constituent snakes cancel successively, so the tensor version of D is also injective. Every pairing calculation below is an equality of maps with external tensor factors of the indicated types. For example the two sides of the module equation in the later module calculation are maps ; applying D adds one external C factor and gives the three-composite equality displayed there. The product-transpose in step 3.1 uses the external factors ; after inserting the coproduct expression from step 2.2, its contraction is precisely the second snake composed with indexed associativity. The tensor-output tests in the later transport, coalgebra and window calculations use P with both external dual factors, so injectivity of D applies. In all such displays, input letters name these external factors, juxtaposition is the displayed indexed product, and evaluation is the displayed pairing. The equalities use only the defining maps, their tensor products and structural equations; they do not assume scalar-valued points separate morphisms in a general category. Thus the displayed identities hold in the formal presentation. In the vector-space specialization, pure-tensor evaluations give the same formulas, and the additional finite-dimensional nondegeneracy assertion follows from step 1.1.
The coproduct slides, maps , are Test against and by the perfect output pairing . The scalar for the left composite is by the transpose identity above. By the product slides this is both and . Transposing or under its opposite pairing gives respectively the rightmost and middle composite. The general coproduct-contraction identity used here is the reversed-factor transpose from step 3.1 with labels renamed: . Since the product pairing is perfect, these scalar equalities prove both typed map equalities.
Pairing adjunction in [F1] is the equality of maps Precomposing with the flip and using the symmetries of and gives its reflected equality on . Faithful bending from step 4.1 and the two snakes from step 1.1 give both copairing transports: For the first equality let and in vector notation. The complete contraction against external factors and is Each first equality is adjunction or its reflection; each contraction cancellation is a snake. As composites these are tensor-output applications of D from step 4.1, so their equality proves the first transport in the formal presentation too. Applying the flip to that equality and using and proves the second, with source and target exchanged exactly as displayed. This gives both transports, including the source's exercise.
Pair the proposed cozipper coalgebra identity against arbitrary using the nondegenerate pairing . For either symmetric Frobenius object or , the snake and Frobenius identities imply with the multiplication and tensor order shown. Hence the left side of pairs to . The right side pairs to , because preserves multiplication and is commutative. Pairing adjunction makes this as well. Nondegeneracy proves the coproduct equality. Setting the first argument of pairing adjunction to gives for every , proving counit preservation.
The relation holds for , . To prove it, pair both sides against arbitrary . Pairing adjunction, the unital algebra equation for , centrality, and associativity give The middle equality uses and -commutativity; the last uses associativity of . Since is nondegenerate by step 1.1 with the closed object, equality against every proves the claim. Thus is multiplication by and is a -bimodule map. The Frobenius identities for then slide across either leg of and ; for example and .
Finally the colored open-window reduction is, for arbitrary , For write with . For arbitrary the scalar pairing of the left side against is The first equality is the indexed trace on , after associating; the second is centrality on ; the third is the colored Cardy composite ; the last is pairing adjunction for . Perfectness of proves the reduction. This proves a window of every free-boundary color t, not just t=a. In the singleton case it specializes to the existing calculation. All color sums here are finite tensor decompositions; none is a sum over S.
Let and . For any Frobenius object and , the first and second Frobenius identities respectively give For example, the first formula expands as and then multiplies its two factors; the second expands it as . Thus is a -bimodule map and an -bimodule map. Their coproduct slides follow by composing the two typed Frobenius identities with : By coassociativity, the outer expressions are and . Since is multiplication by and is a -bimodule map, . These are the required closed-window and handle slides.
The Cardy relation says . For and , cyclicity of the symmetric open trace and centrality of give For the middle equality, write ; the two scalar expressions are and . Cyclicity moves to the front in the first expression, and centrality moves back to the front, giving the second. Cardy changes the final term to . Pairing adjunction makes this . Nondegeneracy of proves the typed equality . This is the open-handle reduction used when a cozipper follows an open handle.
For , let be the iterated product, parenthesized to the left; indexed associativity makes it independent of parenthesization after the canonical associators. When , the map is invariant under cyclic rotation of the factors together with their endpoint labels. The claim is immediate for . For , put and . Pair the original value against ; pairing adjunction gives . The indexed trace equation gives . Centrality says , so the latter is , which is the pairing against of the cyclically rotated cozipper output. Since is nondegenerate, those outputs in agree. In the singleton case this is This proves the cyclic cozipper rotation without assuming that is commutative.
Every operation just derived is local to the labels occurring on its factors. The snakes pair only with ; the products and coproducts preserve the concatenated endpoint sequence; and meet only at the matching color ; and retain their color; and the Cardy equation uses exactly before the flip. Consequently inserting any derived move into a larger composite changes no free-boundary label or black parameterization. This checks the color side condition required when the identities are used in surface normal-form reductions.
The marked boundary-relative open-closed normal word
Definition
The normal word is first a formal composite of the ten typed surface generators, with the circle symbol and the interval symbol . Tensor, associators, unitors and flips are those of their symmetric monoidal presentation with the elementary sewing relations. The formulas below also specify its evaluation in after choosing knowledgeable data. Equality of such vector-space evaluations is not used to infer equality of formal words or surfaces; that distinction is essential before the normal-form theorem.
Let be a connected morphism in , with the marked incoming and outgoing black boundary parameterizations of The oriented open-closed surface category with colored free boundary. The marked data of are:
- the partition of its marked black boundary components into connected components of ;
- the genus of each connected component;
- for each color , the number of free-boundary circles (windows) of color on that component;
- the cyclically ordered open-boundary cycles, each recorded as the ordered list of its marked interval slots together with the full endpoint-color sequence along those intervals and free edges.
An open-boundary cycle is obtained by following the oriented boundary of through alternating black interval collars and the intervening free-boundary interval faces. Its successive black slots are distinct within the cycle and each slot appears in exactly one cycle. For the multiplication word after bending all open slots to inputs, traverse this cycle in the direction opposite to the induced surface-boundary orientation. If its slots in this reverse traversal are , write their endpoint labels in their incoming object orientations as
Each incoming interval is oppositely oriented to its surface-boundary segment, so this reverse traversal follows its object orientation. The color at each join agrees because the free face has a single label. In particular, an induced-boundary cycle through incoming has multiplication order after starting at the first slot; no factor is replaced by its opposite-colored space. Distinct cycles may have different endpoint-color sequences even when their lengths agree.
Use the snakes of Typed algebraic derivations of the Frobenius sewing moves to bend every outgoing interval to an incoming interval of reversed endpoint order and every incoming circle to an outgoing circle. Thus a connected component is reduced to a typed word with incoming intervals, outgoing circles, and the same marked open-boundary cycles. Let be those cycles, ordered by their least marked interval slot; within each cycle start at its least slot and use the reverse-boundary multiplication order just specified. For cycle , let its slots be and its cyclic endpoint colors be . Define
Let be the symmetry isomorphism that permutes the interval factors into this listed cycle order, preserving each factor and its endpoint colors. Set
For , set , the identity on the empty tensor. Let be the iterated closed multiplication for , with and . Let be the iterated closed comultiplication for , with and . The ordered product of window operators is
where the product is a finite composite: compactness gives only finitely many windows on . Its order is immaterial by the -linearity of the ; if there are no windows, . Let and define the candidate normal word
with the canonical associators, unitors, and symmetry maps inserted. This formula is the word for the bent surface; for the original marked source and target, apply the inverse bends and restore their slot permutations to define . The identity on each marked closed output slot is retained by the final output permutation. If , the final map is ; if , the initial closed input is . In particular a component with no black boundary has the scalar word and keeps every colored window count.
For a disconnected morphism, define its candidate normal word as the ordered tensor product of its connected candidate words, preceded and followed by the symmetry maps that restore the original marked source and target slot orders. No assertion that is independent of a surface decomposition is part of this definition; that assertion is the claim of The complete colored boundary-relative surface normal-form theorem ↗.
Normal-word diagram
For the candidate map factors through the open boundary cycles, their cozipper images in , and the closed multiplication/window/handle/comultiplication word. The displayed arrows have exactly the domains specified above; when or , replace the corresponding map using the stated unit or counit convention.
\bigotimes_{\ell=1}^{m} A_{a_\ell b_\ell}
\arrow[r, "P"]
& \bigotimes_{j=1}^{r}\bigotimes_{\ell=1}^{q_j} A_{a_{j,\ell-1}a_{j,\ell}}
\arrow[r, "\bigotimes_j(i_{a_{j,0}}^*\mu^{(q_j)}_{a_{j,0},\ldots,a_{j,q_j}})"]
& C^{\otimes r} \arrow[r, "\mu_C^{[r]}"]
& C \arrow[r, "W_M"]
& C \arrow[r, "H^g"]
& C \arrow[r, "\Delta_C^{[n]}"]
& C^{\otimes n}
Facts & Assumptions
Given: A compact oriented collared -colored surface with its black parameterizations, the formal pairing moves and face-relative decomposition of the linked items, and, for a vector-space evaluation, finite-dimensional S-colored knowledgeable data.
The black interval and circle objects, free-boundary colors, corners, and relative diffeomorphism convention are those of The oriented open-closed surface category with colored free boundary.
The typed products, zippers, cozipper maps, and closed Frobenius structure have the indicated source and target spaces (Frobenius objects and typed colored knowledgeable sewing data).
The pairing snakes, cyclic cozipper rotation, and commutativity/cocommutativity of the closed Frobenius pairing and copairing are proved in Typed algebraic derivations of the Frobenius sewing moves.
Every compact surface has a finite decomposition into the ten typed elementary cobordisms, and its connected-component genus and boundary features are finite (Face-relative Morse decomposition into the ten sewing generators).
Proof
An orientation-preserving diffeomorphism in [F1] preserves connected components, genus, the number and colors of free-boundary circles, the marked black boundary components, and the cyclic order in which boundary segments are encountered. It therefore preserves the marked data in the definition. Compactness gives finitely many boundary components and corners, so only finitely many open cycles and nonzero window counts occur; hence each tensor product and the composite defining is finite. Every iterated product is well-typed because the reverse-boundary traversal follows each incoming object orientation, so consecutive endpoint colors match and makes its output , the domain of .
Changing the starting slot of a cycle cyclically rotates its indexed product and changes the basepoint color to the new first endpoint. The cyclic cozipper identity of [F3] equates the resulting maps to . Reordering the cycles only permutes the factors before ; commutativity and the symmetry of the closed pairing show that the composite is unchanged. Reordering colored window factors does not change because every is multiplication by an element of the commutative algebra , and each window contributes exactly its own color operator. The target circle order is restored by the explicitly retained symmetry permutation. Thus the candidate word does not depend on the auxiliary choice of cycle starting points or the order of cycles and windows. The independence from choices of cutting or decomposition is deliberately deferred to the linked normal-form lemma.
The bending maps in the definition are inverse to bending back because the two snakes of [F3] cancel each paired evaluation/coevaluation. Hence they preserve the relative surface class and all marked slots. The empty-input and empty-output conventions are well-defined maps by the unit and counit types of [F2]; when a connected component has no open cycle its closed input is the unit, and when it has no outgoing circle its final closed map is the counit. For zero black boundary the formula therefore reduces to the stated scalar and still records its genus and colored windows.
The complete colored boundary-relative surface normal-form theorem
Statement
Let be any set and let be compact oriented -colored surfaces in with the same marked source and target words. Then and represent the same morphism if and only if they have the same partition of marked black boundary slots into components, the same genus and colored-window multiplicities on every component meeting a marked slot, and the same cyclic open-boundary slot cycles with their complete endpoint-color sequences, together with the same multiset of genus/window data for components meeting no marked black slot. For each connected component, the common morphism is equal to the candidate word of The marked boundary-relative open-closed normal word. For disconnected surfaces the word is the tensor product of the component words, with the marked slot permutations restored.
The claim includes components with no black boundary: their data are genus and the finite multiplicities of colored free-boundary circles, and their word is . No color sequence may be discarded, and the theorem makes no semisimplicity or characteristic assumption.
Facts & Assumptions
Given: , the exact boundary-relative surface category and its marked colors, and the formal symmetric monoidal presentation generated by its ten typed elementary surfaces and elementary relations. A chosen finite-dimensional evaluation is not assumed to detect surface equality.
is the countable-choice principle used by the smooth collar and finite-dimensional parametric-transversality suppliers (The Axiom of Countable Choice ()).
The category fixes all black parameterizations, incoming/outgoing orientations, interval endpoint colors, free-boundary labels, and collar gluing (The oriented open-closed surface category with colored free boundary).
Every such surface has a finite face-relative decomposition into the ten colored generator types, with an explicit case list for interior and free-boundary critical points (Face-relative Morse decomposition into the ten sewing generators).
The elementary boundary-relative relation surfaces are equal and their algebraic images are exactly the typed Frobenius/knowledgeable equations (Elementary colored surface sewings give the Frobenius relations).
The snakes, zipper/cozipper transports, cyclic rotations, window slides, handle slides, and Cardy reduction used below are derived as typed algebraic equalities (Typed algebraic derivations of the Frobenius sewing moves).
The candidate normal word, marked slot convention, empty source/target conventions, and colored window operators are defined in The marked boundary-relative open-closed normal word.
Proof
Bend every outgoing open interval into an incoming interval with reversed endpoint order, and every incoming closed circle into an outgoing circle, keeping the original slot markings and the explicit symmetry maps. The formal snakes give inverse unbending; geometrically these are the boundary-relative pairing/copy-pairing surfaces of [F3]–[F4]. It suffices to treat a connected surface with open source and closed target. By [F2] it has a finite expression in the ten generators. Delete its open units and counits by and . This deletes one open extremum at a time and creates none. Expand every packaged open window when counting open coproducts. The resulting expression is a finite directed acyclic graph of typed wires and generator occurrences. Acyclicity follows from its expression by tensor and composition, not from any assertion about the undirected graph.
If open coproducts remain, choose one with no open coproduct in its strict directed downstream graph. Such a choice exists because the graph is finite and acyclic. This is the consequence for which LP uses a minimum downstream height; the source's height convention is toward the target. Until its outputs encounter a cozipper, their open continuation wires cannot branch: the only vertex with multiple open outputs is an open coproduct, absent downstream by the choice. Each path therefore passes through a chain of open products, eventually reaching either the other path at a product, or a cozipper. There is no open exterior target, no remaining open counit, and no other generator accepting an open wire. In particular a zipper cannot be the next vertex on an open wire, since its domain is .
Choose a first event consisting either of the first merge of these two open paths or of a cozipper reached by either path. More precisely take a minimal such event in any topological ordering of the finite downstream graph. Before this event, every additional input feeding the open-product paths is independent of the two distinguished coproduct outputs. If an additional input depended on one of them through an open path, that would already be a merge; if it depended on one through a closed path, that path would already have passed through a cozipper. Either possibility contradicts the first-event choice. Thus all intervening side inputs can be retained as independent typed input blocks, even if their upstream expressions share other suppliers or contain coproducts that are not downstream of the marked one. Indexed associativity flattens each path into its actual ordered word without changing that order. We can therefore isolate the marked coproduct and this first event as a subexpression with independent side-input blocks and with the rest of the original expression attached to its output ports. The three finite possibilities are an uncrossed merge, a crossed merge, or a cozipper event, with the two left/right cozipper positions distinct.
For an uncrossed merge the flattened product has the form , where and has type . The outer words remain in the context. Associativity isolates the sandwich . For a crossed merge the flattened word has the form , where has type ; again isolate the middle sandwich. These are the two possible orders of the two distinguished wires in an ordered product. At a cozipper event the flattened input has the form , or . The cyclic cozipper identity moves the external block round the trace, yielding or , with the indexed product of the remaining side inputs in its preserved cyclic order. Thus the four typed identities in the following steps exhaust the first-event configurations, including paths of arbitrary finite length.
The uncrossed sandwich has the formal identity Here is its full derivation. Frobenius and the unit give , with . Write the copairing output wires as . Associativity changes to . The copairing symmetry is , and Frobenius gives . Consequently the formal composite with output string is exactly , which is by the colored Cardy equation. This proves the identity as an equality of composites. For a crossed sandwich, the first Frobenius identity with labels is Compose with . Colored Cardy then gives the separately typed identity Both replacements remove the marked open coproduct and create no open coproduct at their completed endpoints. Reflected external positions are handled by tensoring these equalities with and composing with their ordered products. If the uncrossed side word is empty, take in the derivation and simplify ; the endpoint is and has no open unit or coproduct. If the crossed side word is empty, its type forces ; use and the unit equation to obtain , precisely Cardy. No open unit is retained in either result.
For a left cozipper event the exact subexpression, after the cyclic rotation of step 4.1, is Indexed cyclicity and tensor naturality give The second Frobenius identity with labels changes the middle two factors to . Finally the copairing transport yields For clarity the transport is formal: , and . Thus no open coproduct remains at the completed endpoint. The output types are still , so any downstream continuation, including a later zipper or reconnection, is attached unchanged.
The right cozipper position has type and the composite Cyclicity changes to . The first Frobenius identity with labels then gives The last equality uses and . Empty side words give the corresponding direct cozipper transport after the unit is canceled. Every external interval type is retained; the change from cozipper basepoint to is precisely the stated cyclic identity.
Replace the first-event subexpression by the applicable first-event equality just proved, then repeat the selection of step 2.1. Each completed replacement deletes one actual open coproduct occurrence and creates none; arbitrary side-input and downstream blocks are attached by tensor and composition, so they are not duplicated. The finite number of actual open coproduct vertices is therefore a strictly decreasing outer measure. This terminates with no open coproduct. It also eliminates every packaged open window, because its coproduct was included in that count. Thus termination uses the primitive coproduct count and no simultaneous normalizing sweep.
In the resulting expression every connected subgraph consisting of open wires and open products is a finite product tree: products have one output, and no open coproduct can branch an open wire. Its leaves are exterior incoming intervals or zipper outputs; its root is a cozipper, because there is no exterior outgoing interval or open counit. Unary identity segments are ignored. A component with no product is one leaf feeding one cozipper. For each tree, associativity flattens its leaf products in multiplication order, opposite to the induced surface-boundary order and following each incoming interval in its object orientation. If a zipper is its sole leaf, removes it. Otherwise indexed centrality and associativity move a selected zipper leaf successively through the adjacent open products to the basepoint of the cozipper. The precise centrality equality is Removing the zipper from a cyclic word leaves a correctly indexed cyclic word of the remaining leaves: its two neighboring free labels had been the same basepoint color. Thus it reduces to a terminal zipper/product/cozipper configuration with one remaining diagonal open input.
The terminal equality is To prove it formally, bend its target by , retaining a full additional input. On , pairing adjunction, invariance, the zipper algebra equation, pairing adjunction again, and closed invariance give in order Faithful unbending cancels the closed snake and proves the equality. Centrality gives the reflected input order . Each completed removal deletes one zipper and creates none; each preceding push crosses a finite number of products on its unique path to the cozipper. Repeating terminates by the number of zipper leaves. No open coproduct or extremum is created.
The surviving open trees have only exterior incoming interval leaves and one cozipper root. They are precisely the components of the boundary carrying the marked incoming intervals: a product disk concatenates successive interval slots in reverse induced-boundary order, following their incoming object orientations along matching free-edge labels, and the cozipper closes that ordered string into one boundary cycle. This follows directly from the generator boundary words in [F3], rather than from a proposed classification theorem. Each tree therefore has the form with , keeping its full marked slot and endpoint-color sequence. The cyclic cozipper identity equates all starting points of this same cycle. A cycle cannot be split or reconnected by any preceding replacement because every replacement is an actual boundary-relative equality. Start each cycle at its least marked slot in this reverse-boundary multiplication order, order the cycles by their least slots, and restore this prescribed factor order by the explicit symmetry of [F5].
It remains to normalize a connected graph made entirely of closed Frobenius generators, the closed inputs from these open-cycle trees, windows , and the exterior closed outputs. The following finite closed-spider fusion proves the purposes of LP stages VII–VIII directly. Write for . If one output of is glued to one input of , where and , then, after retaining the other ports in their marked order, the fusion equality is with the tensor permutations placing the sewn ports last and first. For completeness this identity is valid in every orientation: bend all remaining ports to inputs. Define , including . Associativity and commutativity make invariant under all input permutations. Pairing invariance identifies the bent form of every with . Contracting one input of with one of through gives for : reassociate the uncontracted inputs into their two products; pairing invariance moves those products to the two free legs of the contracted pairings, and the snake contracts the middle to the single pairing of the two products. When one list is empty its product is and the same equality is the unit/counit equation. This supplies all induction base and empty cases, and proves fusion after faithful unbending. Thus it is a formal consequence of associativity, commutativity, Frobenius, unit/counit and the snakes, not an assumption about all surface morphisms.
There is also a self-gluing equality: joining any one input and output port of produces , where . Indeed bend its remaining ports to inputs; the self-gluing inserts into two arguments of . Commutativity and associativity put those two arguments next to each other; their product is . Frobenius gives , so the contracted map is . Faithful unbending gives the displayed equality. Iterating a self-gluing inserts one further each time; no additional generators or unreduced cases are hidden in this formula.
Keep each colored window as a unary vertex and choose an undirected spanning tree of the finite connected closed graph, treating the marked input/output ports as external legs. A window slides through every closed product and coproduct by the typed window relations, so it can be carried along the chosen tree to a distinguished central strand while retaining its label. Its passage through a unit, counit or an edge with a bent orientation is the same formal relation after bending with a snake. Contract the spanning-tree edges between the Frobenius vertices by step 10.1; each contraction lowers the number of vertices by one and never identifies or permutes marked external slots. If needed insert an identity spider to give a vertex to a component consisting initially of a single strand. Every remaining internal edge now self-glues two ports of the one spider, so apply step 11.1 once per such edge. This algorithm terminates by the finite tree-edge count followed by the finite remaining-edge count. It gives The window operators commute because their formal closed-module slide identifies each with multiplication by its own state in the commutative object ; the same argument slides them across . Hence their order is immaterial, while each color and multiplicity is retained. This is the finite inversion-ordering purpose of LP IX without a repeated normalization sweep.
The exponent is the genus of the original component. After window vertices are suppressed, a connected graph with vertices and internal edges has non-tree edges. Fusing one tree seam between two genus-zero spiders makes one genus-zero spider, as its planar cut models show. Closing two of its circle ports leaves Euler characteristic unchanged and lowers the number of full boundary components by two, so it raises genus by one. Each window is an annulus-with-window: its genus is zero, it contributes one free boundary circle of color , and it changes Euler characteristic by minus one while leaving the graph's first Betti number unchanged as a unary insertion. Each open tree is genus zero and replaces one closed input circle by exactly one mixed open boundary cycle. Thus the surface built by the algorithm has exactly the original boundary partition and boundary cycles, the original free-window multiplicities, and genus . These assertions also follow from the fact that every contraction was an actual boundary-relative equality. No colored arc is identified with a different color.
In the empty cases, means there is no exterior source after bending, and the initial closed spider product is precisely ; means there is no exterior target, and its final closed spider coproduct is precisely . These are already included in the fusion and self-gluing formulas, rather than inferred from an ill-typed assertion that a counit's own domain is empty. In particular a connected component with no black boundary is exactly . Combining the open-tree and closed-graph reductions, the resulting full composite is exactly the candidate word in [F5]. Unbend the original marked slots using the inverse snakes of step 1.1.
Every finite transformation above is a formal consequence of the elementary boundary-relative equalities of [F3] and formally derived identities of [F4]; it therefore gives equality of actual surface morphisms. Hence . If two connected surfaces have the listed identical marked data, [F5] gives the same word for both, so they are equal. Conversely, an orientation-preserving diffeomorphism relative to all black parameterizations preserves each component, its genus, its colored free circles, and the cyclic orders and complete color sequences of the marked intervals. The same data are therefore necessary. For a disconnected surface apply the finite argument separately to each connected component, tensor the resulting words, and restore the original marked source and target orders by their symmetry cylinders. This proves both the full colored classification and the stated tensor formula, including components without marked black slots.
Typed local move table
The finite table records the separately typed local equalities used by the graph reduction. Its stage labels refer to the corresponding source moves; the preceding proof fixes a terminating order and gives the nonlocal return identities. In particular it retains both corrected colored Frobenius directions, both cozipper branches, all four positions of an open window, and all closed unit/counit and window/handle positions.
| Stage / attachment | Directed replacement and type |
|---|---|
| I, open unit | . |
| I, open counit | . |
| II, adjacent open coproducts | , directed so the tracked coproduct moves down to the chosen continuation. |
| II(c)1, uncrossed return | . This packages two vertices and remembers the window color. |
| II(c)2, crossed return | . |
| II(c)3, left cozipper output | . |
| II(c)3, right cozipper output | . |
| II(c)4, left Frobenius attachment | . |
| II(c)4, right Frobenius attachment | . |
| II(c)5, window on the left output | . |
| II(c)5, window on the right output | . |
| III(a)1, product reassociation | . Orient for the tracked product to move upward, increasing its downstream height. |
| III(a)2, window on the first input | . |
| III(a)2, window on the second input | . |
| III(a)3, two zipper inputs | . Both inputs being diagonal forces the same color . |
| III(b)1, window before cozipper | . Here is arbitrary; this is stronger than only . |
| III(b)2, cozipper after zipper | . |
| III(b)3 | The two II(c)3 rows; these remove an open coproduct immediately before a cozipper. |
| III(c), move a window downstream past a coproduct, left output | . The tracked window now has the left output continuation and loses the coproduct from its downstream height. |
| III(c), move a window downstream past a coproduct, right output | . Choose this branch when following that continuation; the window color is retained. |
| III(c), move a window downstream past a product from its first input | . This is the forward III(a)2 row. |
| III(c), move a window downstream past a product from its second input | . |
| VI(b)1, zipper centrality | . This changes the endpoint at which the closed input is attached, not its marked slot. |
| VI(b)2, zipper through a product chain | Apply III(a)1 to reassociate the next two open product vertices, then VI(b)1 to move the zipper to the next branch. This is a typed two-step replacement for any consecutive colors . The terminal module equality is supplied in the proof. |
| VII(b), closed associativity | , directed for the tracked product to move upward. |
| VII(b), left unit | . |
| VII(b), right unit | . |
| VII(c), closed return | ; by closed commutativity. |
| VII(d), left Frobenius attachment | . |
| VII(d), right Frobenius attachment | . |
| VII(e), window on first input | . |
| VII(e), window on second input | . |
| VII(f), handle on first input | . |
| VII(f), handle on second input | . |
| VIII(c)1, adjacent closed coproducts | , directed to lower the tracked coproduct. |
| VIII(c)2, first counit | . |
| VIII(c)2, second counit | . |
| VIII(c)3, window on first output | . |
| VIII(c)3, window on second output | . |
| VIII(c)4, handle on first output | . |
| VIII(c)4, handle on second output | . |
| IX, window/handle inversion | , directed to put every window before every handle in the composite. |
| IX, reorder differently colored windows | . This preserves both colors. |
Closed oriented two-dimensional TQFTs are commutative Frobenius algebras
Statement
For any field , the category of strong symmetric monoidal functors and monoidal natural transformations is equivalent to the category of finite-dimensional commutative Frobenius -algebras and maps preserving multiplication, unit, comultiplication, and counit. Here has circle words as objects and only surfaces with no free boundary at all as morphisms. For a nonempty set of free-boundary colors it is not the full subcategory on circle objects inside the open-closed category, since that larger category also has circle-to-circle morphisms with colored free windows. For the empty color set, the open-closed category equals the closed category.
If is connected with genus , incoming circles and outgoing circles, its value under the functor corresponding to is
where , , and . Disconnected surfaces are evaluated by tensor products and the boundary-slot symmetries.
Facts & Assumptions
Given: An arbitrary field and the no-free-boundary oriented surface category specified above.
The face-relative smooth category/decomposition uses only through the stated collars and normal-form result (The Axiom of Countable Choice (), The complete colored boundary-relative surface normal-form theorem).
Objects and morphisms of a category, composition, and identities obey the typed category laws (Category, object, morphism, domain, codomain, identity, composition, and hom-collection).
A closed surface has no free boundary; the category of such surfaces is a symmetric monoidal subcategory with disjoint union (The oriented open-closed surface category with colored free boundary).
Strong symmetric monoidal functors obey the monoidal coherence equations and preserve the symmetry under their tensor structure maps as in Braided monoidal functor; monoidal natural transformations obey the structure and compatibility equations of Lax, strong, and strict monoidal functors, Symmetric monoidal category, and Monoidal natural transformation.
The closed elementary surfaces give exactly the algebra, coalgebra, commutativity, and Frobenius equations (Elementary colored surface sewings give the Frobenius relations).
Every closed oriented surface has the marked boundary-relative normal word, and two surfaces agree exactly when the normal-form invariants agree (The complete colored boundary-relative surface normal-form theorem). Its proof, steps 10.1–14.1, establishes more than this geometric statement: closed generator expressions reduce formally to that word by spider fusion and self-gluing, using only the closed Frobenius equations and their snakes, including zero-arity cases.
Proof
Let be a strong symmetric monoidal functor. Put , a finite-dimensional vector space. Apply to the pair of pants , the disk , and their height reversals. Transport their images along the strong monoidal structure maps to obtain , , , and . The associativity, unit, coassociativity, counit, and both Frobenius surface equalities in [F4] give those Frobenius equations. For commutativity, the symmetry cylinder is sent to the vector-space flip by the symmetry-preservation equation in [F3]; applying to the pair-of-pants swap equality in [F4] therefore gives . Thus is a finite-dimensional commutative Frobenius algebra.
Conversely let be a finite-dimensional commutative Frobenius algebra. Assign to a word of circles the vector space , with . Assign to a connected morphism with the indicated genus and boundaries the formula in the statement, inserting the canonical associators, unitors, and boundary permutations; assign to a disconnected morphism the ordered tensor product of the connected formulas. Use the formal reduction in the proof cited in [F5], rather than inferring algebraic evaluation from geometric equality: contract a spanning tree of the closed generator graph by spider fusion, then contract each remaining edge by self-gluing. Fusion follows from Frobenius and the snake and merges two genus-zero spiders; each self-gluing inserts one . The number of remaining edges is the genus, and the unit and counit handle empty boundary lists. Thus every decomposition reduces through closed Frobenius equations to the formula assigned above; the marked boundary symmetries are retained. Consequently these data are independent of the chosen surface decomposition. If two morphisms are glued, their chosen decompositions concatenate; evaluating the concatenated generator word is the composite of the two linear maps. Reducing the glued surface to its unique normal word preserves that value by the Frobenius equations. Hence identities, composition, tensor product and symmetry are preserved. The block-permutation cylinders evaluate to the corresponding vector-space factor permutations; under the canonical tensor comparison maps this is exactly the symmetry-preservation equation in [F3]. The canonical associators and unitors of vector spaces give the remaining strong monoidal coherence maps, so this defines a strong symmetric monoidal functor.
If is connected with incoming circles, outgoing circles, and genus , the closed normal-form theorem [F5] reduces it to -fold multiplication, copies of the handle , and -fold comultiplication. The empty input and output reductions are the unit disk and counit disk; a cylinder gives the identity convention at arity one. Therefore is the stated formula. For a disconnected surface, the components are a disjoint union, so the strong monoidal structure and [F3] give the tensor product formula.
A map preserving all four Frobenius maps defines a component on every -circle word, with the unit component at . It is natural for each of the four generating surfaces by the four preservation equations; it is natural for a composite by induction on the number of generator factors, and for disjoint union by the tensor product rule. Thus it is a monoidal natural transformation. Conversely a monoidal natural transformation between two TQFTs restricts at the circle to a linear map . Naturality at the pair of pants and the two disks gives the multiplication, unit, comultiplication, and counit preservation equations, and monoidal compatibility forces its component on every circle word to be . The two constructions therefore give inverse maps on every hom-set.
Write for extraction of the commutative Frobenius algebra and for the construction from that algebra. Step 2.2 proves that is fully faithful. Step 1.2 constructs a functor from each algebra, so every object in the algebra category is in the image of ; on objects and generating maps, is the identity after the fixed tensor-structure identifications. For any TQFT , the canonical comparison maps from its monoidal structure identify with on each circle word; naturality on the four generators from step 1.1 and the normal-form reduction in step 2.1 prove naturality on every surface. These comparison maps are monoidal by [F3], so is naturally isomorphic to the identity. Hence and are quasi-inverse equivalences of categories.
Typed colored knowledgeable Frobenius data classify open-closed sewing
Statement
For any set and field , the category of strong symmetric monoidal functors
and monoidal natural transformations is equivalent to the category of S-colored knowledgeable Frobenius data and the homomorphisms defined in Frobenius objects and typed colored knowledgeable sewing data. The open objects are the typed spaces , not one common algebra for every interval. The closed object is commutative Frobenius; each has symmetric Frobenius pairing; and , satisfy the stated centrality, adjunction, and Cardy equations. For this is the usual knowledgeable pair .
The theorem does not identify with the center of , does not imply that every symmetric Frobenius algebra admits an open/closed extension, and makes no claim about modular three-dimensional or point-level fully extended TQFTs.
Facts & Assumptions
Given: An arbitrary set , an arbitrary field , and the exact S-colored surface category with boundary conventions of The oriented open-closed surface category with colored free boundary.
is required only by the collar/Morse decomposition and surface normal-form suppliers (The Axiom of Countable Choice (), Face-relative Morse decomposition into the ten sewing generators, The complete colored boundary-relative surface normal-form theorem).
A strong symmetric monoidal functor obeys the monoidal coherence equations and preserves symmetry under its tensor structure maps as in Braided monoidal functor. A monoidal natural transformation obeys the binary and unit compatibility equations (Lax, strong, and strict monoidal functors, Symmetric monoidal category, Monoidal natural transformation).
The ten elementary surfaces have the exact typed algebraic generator maps, and their boundary-relative relations are equations 1–7 of Frobenius objects and typed colored knowledgeable sewing data (Elementary colored surface sewings give the Frobenius relations).
Pairing duality, both snakes, zipper/cozipper transports, cozipper coalgebra preservation, cyclic rotation, and the window/handle/Cardy reductions are proved with every endpoint label retained (Typed algebraic derivations of the Frobenius sewing moves).
Every surface has a finite decomposition into the ten generators, and its marked colored boundary data have the unique candidate normal word of The complete colored boundary-relative surface normal-form theorem (Face-relative Morse decomposition into the ten sewing generators, The marked boundary-relative open-closed normal word). The proof of the normal-form lemma, steps 1.1–15.1, establishes a formal reduction of every generator expression to this word using only the elementary relations and the formally derived moves of [F3]; its geometric equality statement alone would not suffice for this stronger conclusion.
An equivalence of categories consists of functors with natural isomorphisms between both composites and the identity functors (Equivalence, quasi-inverse, and adjoint equivalence of categories).
Proof
Let be a strong symmetric monoidal functor. Set and . Transport the images of the ten elementary surfaces along the structure isomorphisms of to obtain the maps , the indexed maps , and the zipper/cozipper maps . Each vector space is finite-dimensional because lands in .
Conversely, let be S-colored data. Assign to a circle, to , the tensor product of the assigned spaces to each ordered word, and to the empty word. Use the canonical associators, unitors, and flips of vector spaces for the strong symmetric monoidal structure. By [F4], every surface has a finite elementary decomposition; evaluate it by composing and tensoring the maps of along that decomposition. Apply the formal reduction proved in the supplier proof cited in [F4]. After invertible bending, its first-event replacements remove one open coproduct at a time without creating another; centrality and the cozipper module identity then remove zipper leaves. The surviving open product trees retain exactly the marked cyclic endpoint sequences. Closed spider fusion along a spanning tree and self-gluing of each remaining edge give the genus/window word. These are finite equations in the formal presentation, using only [F2] and [F3], and hence hold under evaluation in . Two decompositions of the same surface have the same marked invariants and therefore the same final normal word, including the slot permutations. Both evaluations are consequently equal. The assignment is therefore independent of the decomposition and of the representative surface.
By [F2], every defining relation is a boundary-relative equality of elementary surfaces. Applying to the closed and open pair-of-pants, disk, zipper, and cozipper relations gives each equation 1–7 of the data definition, including cyclic trace, centrality, adjunction, and the exact colored Cardy map . In particular, the pair-of-pants swap gives commutativity because symmetry cylinders are carried to vector-space flips by [F1]. The snakes and indexed trace in [F3] show that each pairs perfectly with ; no extra nondegeneracy or semisimplicity hypothesis is needed. Thus extraction sends to an object of the stated data category.
The identity cylinder evaluates to the identity map by the unit and counit equations. If two surfaces are composable, concatenate their finite decompositions along the matching parameterized black boundary; the composite word evaluates to the composite of their linear maps. By [F4] it reduces to the normal word of the glued surface without changing that evaluation, so composition is preserved. Ordered disjoint union concatenates generator words, and the symmetry cylinder evaluates to the vector-space factor permutation. Under the canonical tensor comparison maps this is exactly the symmetry-preservation equation in [F1]; hence tensor, symmetry, and interchange are preserved. The canonical reassociation and unit maps satisfy the coherence equations in [F1], proving that the construction is a strong symmetric monoidal functor.
A data homomorphism defines on each object word the tensor product of its component maps, with the prescribed unit component on . The equations defining a data homomorphism are exactly naturality on the ten generating surfaces. Naturality on an arbitrary surface follows by induction over its finite decomposition: it is preserved under composition by the induction hypothesis and under disjoint union by tensoring the naturality squares. Conversely, a monoidal natural transformation restricts at each circle and interval to maps ; its naturality squares on the ten generators give every structure-preservation equation, while monoidal compatibility determines all word components. Therefore extraction is fully faithful.
Let be extraction and be the reconstruction above. On a data object, recovers exactly its named vector spaces and generator maps. On a functor , the components of the canonical monoidal structure maps of identify with on every word, including the empty word. They are natural on the ten generators by the definitions in step 1.1; [F4] extends their naturality to every surface. They form a monoidal natural isomorphism by [F1]. Thus is the identity and is naturally isomorphic to the identity, which proves the equivalence in [F5]. When is a singleton, the indexed maps reduce to and the same construction is the usual knowledgeable pair. No step identifies with a center: only the explicitly stated equations are used.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Aaron D. Lauda and Hendryk Pfeiffer, Open-closed strings: Two-dimensional extended TQFTs and Frobenius algebras, arXiv:math/0510664v3
- Joachim Kock, Frobenius algebras and 2D topological quantum field theories, complete minicourse notes
- Gregory W. Moore and Graeme Segal, D-branes and K-theory in 2D topological field theory, arXiv:hep-th/0609042v1
- Joachim Kock, Frobenius algebras and 2D topological field theories, complete minicourse notes