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.
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.
Depends on
Used by
Dependency tree · two levels
24 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)
- Gregory W. Moore and Graeme Segal, D-branes and K-theory in 2D topological field theory, arXiv:hep-th/0609042v1 (standard reference, not scraped)
- Joachim Kock, Frobenius algebras and 2D topological quantum field theories, complete minicourse notes (standard reference, not scraped)