Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passverified 2026-11-05 (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.

Rank-one Frobenius defect sewing with every coefficient equal to one

Example

Assume that every set-indexed family of nonempty sets has a choice function, and that every sequence (Xn)n∈N of nonempty sets admits a function f with f(n)∈Xn for all n. These are the Axiom of Choice and countable choice required by the weighted RT construction used below.

Take C=Vect⁡Cfd, the category of finite-dimensional complex vector spaces and linear maps, with ordinary tensor product, flip braiding cU,V(u⊗v)=v⊗u, identity twist, linear duals, and the canonical double-dual pivotal map. There is one simple label 0, represented by U0=1=C; choose its basis vector 1. Set A=B=C and use m(a⊗b)=ab,η(z)=z,Δ(a)=a(1⊗1),ϵ(a)=a. Take the identity defect X=C with left and right scalar multiplication, and boundary modules Mℓ=Mr=C with scalar action. All chosen chiral, region, defect, and boundary labels are this unit. Identify every tensor power of the unit with C using 1⊗n↦1; all normalized structural coupons, chosen field-basis coupons, evaluations, and coevaluations then have scalar 1.

For the normalized ribbon/TQFT data choose D=1, S=(1), κ=1, unit Kirby color, and the basis 1 of every resulting unit-labeled RT state space. Give a compact oriented doubled worldsheet any of the permitted Lagrangians and integer weights. The selected trivial weighted TQFT assigns C to every such surface, including the empty surface, and the identity map to each weighted bordism whose labels and coupons are the selected unit data. Tensor identifications use 1⊗1↦1. For a graph with additional scalar coupons t1,…,tn, its map is multiplication by ∏jtj; the empty product is 1. The normalized RT surgery expression for these data has exactly this value.

For every finite oriented FRS worldsheet built from these labels with all coupons equal to the selected basis coupons, the connecting-graph correlator is 1. The relative-tensor projector and marked-torus projector are identities on C. Every nonempty bulk or boundary field space has basis 1, every paired two-point matrix is (1), and the bulk and boundary sewing coefficients are both 1. Thus cutting and capping along either of the declared cut geometries, followed by its weighted gluing, gives the directly checked identity 1=1⋅1. This checks a concrete instance without using the general defect factorization theorem. It neither proves that theorem nor constructs an analytic full CFT or a physical path-integral measure.

Facts & Assumptions

Given: The finite-dimensional category, scalar maps, normalizations, worldsheet labels, basis coupons, and weighted TQFT data specified in the Example. Arbitrary scalar coupons are used only to verify compatibility of the selected functor with linearity and composition; the asserted correlator 1 uses the selected coupons 1.

[F1]

MTC-valued Frobenius algebra and defect data for oriented rational CFT specifies the modular category, symmetric special Frobenius algebra, module and bimodule equations, induced field spaces, relative tensor product, connecting-graph correlators, and two-point pairings to be checked. No general sewing or nondegeneracy theorem is used below.

[F2]

The weighted Reshetikhin–Turaev TQFT and modular-functor factorization supplies the normalized weighted RT functor, its Hom state spaces, composition, duality and normalized sewing maps under its stated choice assumptions. The unit-label calculation below evaluates that construction directly; it does not use the theorem's general factorization conclusion.

[A1]

The two choice assumptions are the set-indexed and countable-family principles stated in the Example; their formal definitions are The Axiom of Choice and The Axiom of Countable Choice (ACω). They enter only through [F2], not through any finite-dimensional selection in this example.

Verification

1.1givenF1algebra

Every finite-dimensional vector space is a finite direct sum of copies of C, and a subspace has a linear complement by finite basis extension. The unit is simple, its endomorphisms are scalars, and there is exactly one simple isomorphism class. The flip obeys the braiding identities on pure tensors; its square is the identity. Ordinary evaluations and coevaluations satisfy both duality snakes on each basis vector. The canonical pivotal trace is the ordinary trace, hence d0=1. The identity twist obeys the ribbon identities because the double flip and its dual are identities. The unnormalized Hopf-link matrix is (tr⁡(id⁡C))=(1) and is invertible, so this is a modular ribbon fusion category.

2.1givenF1step 1.1algebra

Under the selected tensor identifications, all four algebra maps have scalar 1. Associativity, unitality, coassociativity, counitality, and the three Frobenius composites are consequently equal maps with scalar 1 on their common one-dimensional source and target. In particular mΔ=id⁡, ϵη=1=dA, and dA≠0. Both transposes of the pairing a⊗b↦ab send a to the functional b↦ab, proving symmetry. Scalar bimodule endomorphisms of A form Cid⁡, so A is simple as a bimodule; the same holds for B. Scalar actions are associative, unital and commuting, verifying every module and bimodule clause for Mℓ,Mr,X.

3.1givenF1step 2.1algebra

The two balancing maps X⊗B⊗Mℓ⇉X⊗Mℓ both send x⊗b⊗m to the scalar xbm. Their coequalizer is therefore the identity of the one-dimensional target, with the canonical identification X⊗BMℓ=C. Also eB=Δη sends 1 to 1⊗1, so the explicit projector PX,Mℓ sends x⊗m to x⊗m. Choose its inclusion and restriction to be the identity under the selected tensor identifications. The descended A-action is scalar multiplication. The boundary projector on Mr∨⊗(X⊗BMℓ) is identically 1 by the same calculation.

4.1givenF1step 1.1step 2.1step 3.1algebra

Since every simple label is 0=0ˉ, both bulk defect-field spaces in [F1] are Hom⁡C∣C(C,C)=C; the induced left and right actions are scalar multiplication, including the inverse-braiding convention since both flips are identity on the unit. Choose the basis morphism 1↦1 in each space. Both boundary-defect spaces, and both defect-free boundary spaces, are likewise Hom⁡C(C,C)=C, with that same basis. The composition-trace pairing of two basis morphisms is 1, so these bases are trace dual as well as composition dual.

5.1A1F2givenstep 1.1step 4.1algebra

In the unit-only RT handle decomposition there is one handle color, one simple summand at each cut, and every Hom tensor factor is Hom⁡(C,C)=C with basis 1. Thus every state space specified in the Example is one-dimensional with the asserted tensor identifications. Every unit-colored closed ribbon, crossing, twist, evaluation or coevaluation has value 1; a scalar coupon contributes precisely its scalar. The Kirby color has one summand of coefficient d0=1. Moreover ∑idi2=1, the positive and negative Gauss sums are 1, and the chosen D=1 gives S00=1 and κ=1. In the normalized weighted surgery formula of [F2], every power of D and every outgoing dimension factor equals 1. The full anomaly factor is κn+a(R;λ,α)−σ(B)=1, since κ=1. Here a(R;λ,α)∈Z is the cap-reference correction in the exponent; its value need not be 1 (and it is 0 for the identity with matching reference). Only its multiplicative contribution κa(R;λ,α) is 1. The graph value is exactly the product of the scalar coupons, even for disconnected bordisms. In particular all allowed Lagrangian choices and Maslov corrections give this same scalar.

6.1A1F2givenstep 5.1algebra

Composing two selected bordisms multiplies their scalar coupon products, just as composing their assigned linear maps does; the Maslov contribution is 1 by step 5.1. The identity bordism has empty product 1. Disjoint union concatenates coupon lists, agreeing with tensor product on C under 1⊗1↦1. Evaluation and coevaluation on these state spaces both have scalar 1 and satisfy the snakes, so the functor is compatible with duality. These checks verify directly the selected trivial normalized weighted TQFT, including its normalized tube maps, rather than assuming a general anomaly cancellation result.

6.2A1F2givenstep 2.1step 4.1step 5.1algebra

Every coupon in either connecting sphere or disk two-point graph has scalar 1. Hence its RT vector is 1 by step 5.1. Its chosen block basis is also 1, so the coefficient matrix is (1) with inverse (1). Both induced pairing maps C→C∗ send 1 to the functional taking 1 to 1, and are isomorphisms. Similarly the marked-torus state space is C, and the FRS projector graph consists only of the selected scalar-1 structural coupons and ribbons. It acts as 1; its image basis and its dual cap basis are both {1}. The source's normalization (dpdq)2/(dAdX) is 1, with nonzero denominator dAdX=1 in this example.

7.1A1F2givenstep 3.1step 5.1step 6.1step 6.2algebra∎

A connecting graph with the selected coupons, before or after cutting and capping, has correlator 1 by step 5.1. The gluing map has scalar 1 by step 6.1, regardless of the integer weight chosen to match the composite. In the bulk sum the only labels are p=q=0, the only field indices are α=β=1, and dpdq(cdef−1)αβ=1⋅1⋅1=1. In the boundary sum the only label is i=0 and di(cbdef−1)βα=1⋅1=1. Each sewing identity is therefore the scalar equality 1=1. Replacing the local boundary projector by its split inclusion/restriction changes only an identity map into the composite of two identity maps, so the defect-free boundary reduction also holds directly. This calculation establishes the claimed instance and uses no unresolved general factorization argument.

Depends on

Dependency tree · 2 levels

Sources