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.
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.
Depends on
Used by
- The marked boundary-relative open-closed normal word Definition
- The complete colored boundary-relative surface normal-form theorem Lemma
- Typed colored knowledgeable Frobenius data classify open-closed sewing Theorem
Cited to discharge well-definedness by Frobenius objects and typed colored knowledgeable sewing data.
Dependency tree · two levels
10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Aaron D. Lauda and Hendryk Pfeiffer, Open-closed strings: Two-dimensional extended TQFTs and Frobenius algebras, arXiv:math/0510664v3 (standard reference, not scraped)
- Joachim Kock, Frobenius algebras and 2D topological quantum field theories, complete minicourse notes (standard reference, not scraped)
- Gregory W. Moore and Graeme Segal, D-branes and K-theory in 2D topological field theory, arXiv:hep-th/0609042v1 (standard reference, not scraped)