Alphabeta Math
TheoremStatement: 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.

Framed colored-braid representative independence

Statement

Assume countable choice. Let C be a ribbon category with chosen left duals. If two finite colored braids have color-preserving endpoint permutations and their blackboard-framed closures are isotopic as oriented framed links by an isotopy preserving each component color, then their evaluations agree in End⁡C(1). Thus the framed colored evaluation of a closed braid is independent of its colored-braid representative whenever the represented framed colored links are the same.

Facts & Assumptions

Given: Countable choice, a ribbon category, two finite colored braids, and a framed colored isotopy between their closures.

[F1]

The colored framed-link evaluation is the framed ribbon-tangle functor applied to the closed link and takes values in End⁡C(1) (Colored framed-link evaluation from a ribbon category).

[F2]

The multicolored ribbon-tangle evaluator is invariant under every boundary-relative framed graph isotopy and handles arbitrary object colors with the chosen duality maps (Multicolored ribbon graphs with arbitrary coupons have a unique evaluation).

[A1]

Countable choice is assumed for the cited construction of the multicolored tangle evaluator (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

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

1.1F1F2A1given

Under [A1], each braid closure is a framed colored link with empty boundary. By [F1], its value is the endomorphism of the tensor unit assigned by the multicolored framed-tangle evaluator, and its component labels are exactly the colors carried around the permutation cycles.

2.1F1F2step 1.1given∎

The isotopy hypothesis is a framed graph isotopy that preserves the labels. By [F2], the two closed tangles have equal evaluation morphisms. Applying [F1] identifies those morphisms with the two braid-closure values, proving equality in End⁡C(1). This statement concerns framed isotopy; an ordinary Markov stabilization that changes framing is not an additional move here.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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