Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 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.

Colored framed-link evaluation from a ribbon category

Definition

Assume the Axiom of Countable Choice. Let C be a ribbon category with chosen left duals and tensor unit 1. A finite oriented framed link colored in C is a finite disjoint union L of oriented smoothly embedded circles in S3, a homotopy class of nowhere-zero normal vector field on each component, and an assignment of an object of C to each component. A framed colored isotopy carries orientations, framings, and component colors. If FC is the ribbon-tangle evaluation functor, define RT⁡C(L):=FC(L)∈End⁡C(1). This value depends only on the framed colored isotopy class. It is not automatically a field scalar; if C is k-linear and End⁡C(1)=k, it is a scalar in k. The empty link is assigned 11.

Facts & Assumptions

Given: The ribbon category, its chosen left duals, a finite oriented framed link, and an object color on every component.

[F1]

For arbitrary component colors, the ribbon evaluation assigns a morphism to each colored framed tangle, is invariant under framed graph isotopy, and preserves the empty graph (Multicolored ribbon graphs with arbitrary coupons have a unique evaluation).

[A1]

Countable choice means every sequence of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: The data in the Definition and [A1].

1.1F1A1given

Under [A1], the evaluator in [F1] exists. The colored framed link is a ribbon graph with no boundary endpoints, so it assigns a morphism from the tensor unit to itself. This is an element of End⁡C(1), with no field-valued conclusion unless that endomorphism ring has been identified with a field.

2.1F1A1step 1.1given∎

If two representatives are framed colored isotopic, [F1] gives equal evaluator morphisms; the empty graph has value 11 by the same fact. Therefore the displayed assignment is well-defined on framed colored isotopy classes and has the stated empty-link value.

Depends on

Used by

Dependency tree · two levels

18 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