Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Flip-category colored unlink and braid evaluations

Example

Let k be a field and let V be a d-dimensional finite-dimensional vector space with the ribbon structure of finite-dimensional vector spaces, ordinary flip braiding, standard duality, and trivial twist. For each n≥1 and β∈Bn, put W=V⊗n, let ρ(β) be the braid action, and let jW:W→W∨∨ be the ribbon-induced pivotal comparison. Define the finite blackboard-framed braid-closure value by the categorical trace tnV(β)=Tr⁡L(jWρ(β)). Then tnV(β)=dc(π(β)), where π:Bn→Sym⁡({1,…,n}) is the homomorphism π(σi)=(i i+1) and c(π(β)) is the number of cycles in its disjoint-cycle decomposition, including fixed points as one-cycles. Thus the one-component unknot has value d, the two-component unlink has value d2, and the closure of the positive generator σ1∈B2 has value d.

The two-strand positive generator used in the last calculation is shown schematically below; its endpoint permutation is the transposition (1 2).

12

Facts & Assumptions

Given: The vector space V, the flip ribbon structure, n≥1, and a braid β∈Bn.

[F1]

The left categorical trace of a morphism into the double dual is the coevaluation–morphism–evaluation composite (The categorical trace of a morphism into the double dual).

[F2]

The Drinfeld morphism in a braided rigid category is given by the evaluation–braiding–coevaluation composite (A braided rigid category has a Drinfeld morphism).

[F3]

Every permutation of a finite set has a disjoint-cycle decomposition, unique up to reordering and cyclic rotation, and fixed points are counted as one-cycles (Every permutation of a finite set is a product of pairwise disjoint cycles, uniquely up to reordering and cyclic rotation, Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type).

[F4]

In the specified vector-space ribbon structure, each positive and negative braid generator acts by the ordinary flip of the adjacent factors, and the twist is identity.

[F5]

A generator assignment on Bn that sends every Artin relator to the identity extends to a homomorphism (The braid group by Artin presentation, Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

Proof

technique · direct

Given: The data in the Example and [F1]–[F5].

1.1F1F2F4F5givenconstruct

If n=1, the braid group is trivial and π is its unique homomorphism. If n≥2, put si=(i i+1). For ∣i−j∣>1, si and sj commute because they have disjoint supports; for adjacent indices, both sisi+1si and si+1sisi+1 equal (i i+2). These are the Artin relators, so [F5] gives the homomorphism π. By [F4], each positive or negative braid generator swaps its two adjacent tensor factors, so the action on W=V⊗n is the factor permutation given by π(β). The twist is identity. Let w1,…,wdn be the tensor basis of W and w1∗,…,wdn∗ its ordinary dual basis. Substitution in [F2]'s formula gives uW(wr)(ws∗)=1 when r=s and 0 otherwise, so the pivotal comparison is the canonical double-dual identification. The categorical trace formula [F1] is therefore the ordinary matrix trace of that permutation operator.

2.1F3step 1.1algebra

Fix a basis e1,…,ed of V. A basis tensor ei1⊗⋯⊗ein is fixed by the factor permutation exactly when its indices are constant on each orbit of π(β); by [F3], these orbits are exactly the cycles counted by c(π(β)), including fixed points. There are d independent choices for each cycle, hence exactly dc(π(β)) fixed basis tensors. A permutation matrix has trace equal to its number of fixed basis vectors, proving the formula.

3.1step 2.1givenalgebra∎

The identity in B1 has one permutation cycle, the identity in B2 has two, and σ1 has the transposition permutation with one cycle. Substitution into the formula gives d, d2, and d, respectively; the latter closure is a single component because its endpoint permutation has one cycle. These calculations include d=0 because every listed cycle count is positive.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 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