Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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

bab:=ϵaμaba:Aab⊗Aba→k,dab:=Δabaηa:k→Aab⊗Aba.

Both maps to algebraic duals induced by bab and bba are isomorphisms. With bC=ϵCμC, dC=ΔCηC, Wa=ia∗ia:C→C, H=μCΔC:C→C, and Oa=μaaaΔaaa:Aaa→Aaa, the typed consequences include

ΔCia∗=(ia∗⊗ia∗)Δaaa,ϵCia∗=ϵa,ia∗Oa=Waia∗.

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 k, 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 k, a color set S, 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.

[F1]

In the vector-space specialization each Aab 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.

[F2]

The closed object C 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).

[F3]

In a Frobenius object (X,μ,η,Δ,ϵ), 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

1.1givenF1F3algebra

For each a,b, write dab(1)=∑jpj⊗qj and take x∈Aab. Apply the first typed Frobenius identity with labels (a,b,a,b) to ηa(1)⊗x. The left unit equation gives Δabb(x); the right-hand composite gives ∑jpj⊗μbab(qj,x). Applying 1Aab⊗ϵb and the right counit to this equality gives ∑jpj bba(qj,x)=x. This is the typed snake ρAab(1Aab⊗bba) αAab,Aba,Aab (dab⊗1Aab)λAab−1=1Aab, where the associator maps (Aab⊗Aba)⊗Aab to Aab⊗(Aba⊗Aab). Apply the second Frobenius identity with labels (b,a,b,a) to y⊗ηa(1), then apply ϵb⊗1Aba and the left counit. For y∈Aba and the same dab(1)=∑jpj⊗qj, this gives ∑jbba(y,pj)qj=y, which is the other typed snake λAba(bba⊗1Aba) αAba,Aab,Aba−1 (1Aba⊗dab)ρAba−1=1Aba. The closed object C has the same two snakes with bC and dC: apply its uncolored Frobenius identities to ηC⊗x and x⊗ηC and then use its two counits. Writing dab(1)=∑jpj⊗qj, the first snake says x↦(y↦bab(x,y)) has inverse ϕ↦∑jpjϕ(qj), because bab(x,qj)=bba(qj,x). The second says y↦(x↦bba(y,x)) has inverse ψ↦∑jψ(pj)qj. Thus both induced maps to the opposite algebraic duals are isomorphisms.

2.1step 1.1F1algebra

The trace equation says bab=bbaτAab,Aba. To prove copairing symmetry explicitly, put dab(1)=∑jpj⊗qj and dba(1)=∑krk⊗sk. For arbitrary x∈Aab and y∈Aba, contract each proposed tensor in Aab⊗Aba against ϕy⊗ψx, where ϕy(t)=bba(y,t) and ψx(t)=bab(x,t). The two contractions are respectively ∑jbba(y,pj)bab(x,qj)=bab(x,y), ∑kbba(y,sk)bab(x,rk)=∑kbab(sk,y)bab(x,rk)=bab(x,y). The first equality uses the second snake for dab; the second uses trace symmetry followed by the first snake for dba. By step 1.1 the maps y↦ϕy and x↦ψx exhaust the two dual spaces. Their tensor products separate tensors, proving the typed equality dab=τAba,Aabdba:k→Aab⊗Aba. The same proof gives dC=τC,CdC.

2.2step 1.1F1F3algebra

For a,b,c∈S, the full copairing-invariance identity is the following equality of maps Aab→Aac⊗Acb: Labc:=(μabc⊗1Acb)αAab,Abc,Acb−1(1Aab⊗dbc)ρAab−1=Δacb=(1Aac⊗μcab)αAac,Aca,Aab(dac⊗1Aab)λAab−1=:Rabc. The first composite goes through Aab⊗k, Aab⊗(Abc⊗Acb), (Aab⊗Abc)⊗Acb. The last goes through k⊗Aab, (Aac⊗Aca)⊗Aab, Aac⊗(Aca⊗Aab). To prove the first equality, precompose the second typed Frobenius law with labels (a,b,c,b) by (1Aab⊗ηb)ρAab−1. Its left side becomes Δacb by the right unit, and its right side becomes Labc by dbc=Δbcbηb. For the last equality precompose the first typed Frobenius law with labels (a,c,a,b) by (ηa⊗1Aab)λAab−1. Its left side becomes Δacb by the left unit, and its right side becomes Rabc by dac=Δacaηa. 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 C gives both closed copairing invariances with the same associators/unitors.

3.1step 1.1step 2.2F1algebra

Here is the full reversed-factor transpose behind that identity. Set U=Aab, V=Abc, W=Aac, U∨=Aba, V∨=Acb, W∨=Aca. Let P:(U⊗V)⊗(V∨⊗U∨)→(U⊗U∨)⊗(V⊗V∨) be the following specified composite of associators and flips: (U⊗V)⊗(V∨⊗U∨)→αU,V,V∨⊗U∨U⊗(V⊗(V∨⊗U∨))→1U⊗αV,V∨,U∨−1U⊗((V⊗V∨)⊗U∨)→1U⊗τV⊗V∨,U∨U⊗(U∨⊗(V⊗V∨))→αU,U∨,V⊗V∨−1(U⊗U∨)⊗(V⊗V∨). Thus P((x⊗y)⊗(r⊗s))=(x⊗s)⊗(y⊗r). Define B=λk(bab⊗bbc)P, a perfect pairing between U⊗V and V∨⊗U∨. 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 (U⊗V)⊗W∨→k is bac(μabc⊗1Aca)=B(1U⊗V⊗Δcba). For its verification write dab(1)=∑jpj⊗qj. Step 2.2 with labels (c,a,b) gives Δcba(z)=∑jμcab(z,pj)⊗qj. Therefore the right side at (x⊗y)⊗z equals ∑jbab(x,qj)bbc(y,zpj)=∑jbab(x,qj)bba(yz,pj)=bab(x,yz)=bac(xy,z). The first intervening equality is indexed associativity under ϵb; the next is the second snake for dab; the last is indexed associativity under ϵa. This proves the reversed-factor transpose including its exact flip. The pairing invariance itself is the equality bac(μabc⊗1)=bab(1⊗μbca)αAab,Abc,Aca on (Aab⊗Abc)⊗Aca. Hence both the pairing and its coproduct transpose, for every triple of labels, have been expanded as actual typed composites.

3.2step 2.2F1F3algebra

For arbitrary a,b,t∈S put Oabt:=μatbΔatb:Aab→Aab,eat:=Oaatηa(1)∈Aaa. For all a,b,c,t, the full multiplication slides, as maps Aab⊗Abc→Aac, are Oactμabc=μabc(Oabt⊗1Abc)=μabc(1Aab⊗Obct). To prove the first, the first Frobenius law with labels (a,t,b,c) gives μatcΔatcμabc=μatc(1Aat⊗μtbc)αAat,Atb,Abc(Δatb⊗1Abc)=μabc(μatbΔatb⊗1Abc). The last equality is indexed associativity. For the second use the second Frobenius law with labels (a,b,t,c): μatcΔatcμabc=μatc(μabt⊗1Atc)αAab,Abt,Atc−1(1Aab⊗Δbtc)=μabc(1Aab⊗μbtcΔbtc). Set the first or second input to the appropriate unit to obtain Oabt(x)=eatx=xebt. Consequently for x∈Aab,y∈Aba, bab(Oabtx,y)=ϵa(eatxy)=ϵa(xebty)=bab(x,Obaty). Here eatx=xebt is the preceding unit specialization, so this step needs no unproved centrality or extra symmetry.

4.1step 1.1step 2.2step 3.1F1F3algebra

We justify formal use by faithful bending. Suppose V has the dual V∨, evaluation bV:V⊗V∨→1 and coevaluation dV∨:1→V∨⊗V, with both snakes proved from Frobenius and units as in this lemma step 1.1. For f:U→V define D(f):=bV(f⊗1V∨):U⊗V∨→1. For h:U⊗V∨→1 define J(h):=λV(h⊗1V)αU,V∨,V−1(1U⊗dV∨)ρU−1:U→V. Naturality of associators/unitors and the snake on V give J(D(f))=f. In detail the composite is the map obtained by tensoring f with dV∨ and then evaluating bV on its first two factors; the snake is λV(bV⊗1V)αV,V∨,V−1(1V⊗dV∨)ρV−1=1V. Precomposing this map by f proves the identity. Thus D is injective on Hom sets with no vector-space assumption. For tensor outputs use V=V1⊗V2, dual V2∨⊗V1∨, evaluation exactly the reversed-factor P-composite in step 3.1, and coevaluation formed by inserting dV1∨ between the two factors of dV2∨, using canonical unitors and reassociating to (V2∨⊗V1∨)⊗(V1⊗V2). In flattened tensor notation this is (1V2∨⊗dV1∨⊗1V2)dV2∨. 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 C⊗Aaa→C; 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 Aab,Abc,Aca; 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.

4.2step 3.1step 3.2F1algebra

The coproduct slides, maps Aac→Aab⊗Abc, are ΔabcOact=(Oabt⊗1Abc)Δabc=(1Aab⊗Obct)Δabc. Test against u∈Aba and v∈Acb by the perfect output pairing ⟨r⊗s,u⊗v⟩=bab(r,u)bbc(s,v). The scalar for the left composite is ϵa((Oactx)vu)=ϵa(xOcat(vu)) by the transpose identity above. By the product slides this is both ϵa(x(Ocbtv)u) and ϵa(xv(Obatu)). Transposing Obct or Oabt 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: ⟨Δabcx,u⊗v⟩=ϵa(xvu). Since the product pairing is perfect, these scalar equalities prove both typed map equalities.

5.1step 1.1step 2.1F1algebrastep 4.1

Pairing adjunction in [F1] is the equality of maps C⊗Aaa→k bC(1C⊗ia∗)=baa(ia⊗1Aaa). Precomposing with the flip and using the symmetries of bC and baa gives its reflected equality bC(ia∗⊗1C)=baa(1Aaa⊗ia) on Aaa⊗C. Faithful bending from step 4.1 and the two snakes from step 1.1 give both copairing transports: (ia⊗1C)dC=(1Aaa⊗ia∗)daa:k→Aaa⊗C, (1C⊗ia)dC=(ia∗⊗1Aaa)daa:k→C⊗Aaa. For the first equality let dC(1)=∑jpj⊗qj and daa(1)=∑krk⊗sk in vector notation. The complete contraction against external factors u∈Aaa and c∈C is ∑jbaa(u,ia(pj))bC(c,qj)=∑jbC(ia∗u,pj)bC(c,qj)=bC(c,ia∗u),∑kbaa(u,rk)bC(c,ia∗sk)=∑kbaa(u,rk)baa(ia(c),sk)=baa(ia(c),u)=bC(c,ia∗u). 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 τdC=dC and τdaa=daa proves the second, with source and target exchanged exactly as displayed. This gives both transports, including the source's exercise.

6.1step 1.1step 5.1F1F2F3algebra

Pair the proposed cozipper coalgebra identity against arbitrary c,d∈C using the nondegenerate pairing bC⊗bC. For either symmetric Frobenius object X=C or X=Aaa, the snake and Frobenius identities imply (bX⊗bX)(u⊗v,ΔX(x))=bX(vu,x) with the multiplication and tensor order shown. Hence the left side of ΔCia∗=(ia∗⊗ia∗)Δaaa pairs to bC(dc,ia∗x). The right side pairs to baa(ia(d)ia(c),x)=baa(ia(dc),x), because ia preserves multiplication and C is commutative. Pairing adjunction makes this bC(dc,ia∗x) as well. Nondegeneracy proves the coproduct equality. Setting the first argument of pairing adjunction to 1C gives ϵC(ia∗x)=ϵa(x) for every x, proving counit preservation.

6.2step 1.1step 5.1F1F2F3algebra

The relation ia∗(ia(c)x)=c ia∗(x) holds for c∈C, x∈Aaa. To prove it, pair both sides against arbitrary d∈C. Pairing adjunction, the unital algebra equation for ia, centrality, and associativity give bC(d,ia∗(ia(c)x))=baa(ia(d),ia(c)x)=baa(ia(dc),x)=bC(d,c ia∗(x)). The middle equality uses ia(d)ia(c)=ia(dc) and C-commutativity; the last uses associativity of bC. Since bC is nondegenerate by step 1.1 with the closed object, equality against every d proves the claim. Thus Wa=ia∗ia is multiplication by wa:=Wa(1C) and is a C-bimodule map. The Frobenius identities for C then slide Wa across either leg of μC and ΔC; for example WaμC=μC(Wa⊗1C)=μC(1C⊗Wa) and (Wa⊗1C)ΔC=(1C⊗Wa)ΔC=ΔCWa.

6.3step 1.1step 5.1step 3.2F1F2algebra

Finally the colored open-window reduction is, for arbitrary a,t, ia∗Oaat=Wtia∗:Aaa→C,Wt=it∗it. For x∈Aaa write Δatax=∑jrj⊗sj with rj∈Aat,sj∈Ata. For arbitrary c∈C the scalar pairing of the left side against c is ∑jϵa(ia(c)rjsj)=∑jϵt(sjia(c)rj)=∑jϵt(it(c)sjrj)=ϵt(it(c)it(ia∗x))=bC(c,it∗itia∗x). The first equality is the indexed trace on Aat⊗Ata, after associating; the second is centrality on Ata; the third is the colored Cardy composite itia∗=μtatτAat,AtaΔata:Aaa→Att; the last is pairing adjunction for it. Perfectness of bC 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 ia∗Oa=Waia∗ calculation. All color sums here are finite tensor decompositions; none is a sum over S.

7.1step 1.1step 6.2F1F3algebra

Let H=μCΔC and Oa=μaaaΔaaa. For any Frobenius object X and x,y∈X, the first and second Frobenius identities respectively give μΔ(xy)=x μΔ(y),μΔ(xy)=μΔ(x) y. For example, the first formula expands Δ(xy) as (x⊗1)Δ(y) and then multiplies its two factors; the second expands it as Δ(x)(1⊗y). Thus H is a C-bimodule map and Oa an Aaa-bimodule map. Their coproduct slides follow by composing the two typed Frobenius identities with Δ: ΔμΔ=(μ⊗1)(1⊗Δ)Δ=(1⊗μ)(Δ⊗1)Δ. By coassociativity, the outer expressions are (O⊗1)Δ and (1⊗O)Δ. Since Wa is multiplication by wa and H is a C-bimodule map, WaH=HWa. These are the required closed-window and handle slides.

7.2step 1.1step 5.1step 6.2F1F2algebra

The Cardy relation says iaia∗=μaaaτΔaaa. For x∈Aaa and c∈C, cyclicity of the symmetric open trace and centrality of ia(c) give bC(c,ia∗Oax)=ϵa(ia(c) μaaaΔaaax)=ϵa(ia(c) μaaaτΔaaax). For the middle equality, write Δx=∑jxj⊗yj; the two scalar expressions are ∑jϵa(ia(c)xjyj) and ∑jϵa(ia(c)yjxj). Cyclicity moves yj to the front in the first expression, and centrality moves ia(c) back to the front, giving the second. Cardy changes the final term to ϵa(ia(c)ia(ia∗x)). Pairing adjunction makes this bC(c,Waia∗x). Nondegeneracy of bC proves the typed equality ia∗Oa=Waia∗. This is the open-handle reduction used when a cozipper follows an open handle.

7.3step 1.1step 5.1step 6.2F1F2algebra

For q≥1, let μa0…aq(q):Aa0a1⊗⋯⊗Aaq−1aq→Aa0aq be the iterated product, parenthesized to the left; indexed associativity makes it independent of parenthesization after the canonical associators. When aq=a0, the map ia0∗μ(q) is invariant under cyclic rotation of the factors together with their endpoint labels. The claim is immediate for q=1. For q≥2, put X=ia0(c)x1∈Aa0a1 and Y=x2⋯xq∈Aa1a0. Pair the original value against c∈C; pairing adjunction gives ϵa0(XY). The indexed trace equation gives ϵa0(XY)=ϵa1(YX). Centrality says Yia0(c)=ia1(c)Y, so the latter is ϵa1(ia1(c)Yx1), which is the pairing against c of the cyclically rotated cozipper output. Since bC is nondegenerate, those outputs in C agree. In the singleton case this is i∗μA(q)(x1,…,xq)=i∗μA(q)(x2,…,xq,x1). This proves the cyclic cozipper rotation without assuming that Aaa is commutative.

8.1F1step 1.1step 2.1step 5.1step 6.1step 6.2step 7.1step 7.2step 7.3∎

Every operation just derived is local to the labels occurring on its factors. The snakes pair Aab only with Aba; the products and coproducts preserve the concatenated endpoint sequence; ia and ia∗ meet only at the matching color a; Wa and Oa retain their color; and the Cardy equation uses exactly Aba⊗Aab 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

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