Alphabeta Math
Pipeline-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.

✓ 3 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Hecke Markov Traces and Polynomial Link Invariants

1 · Prerequisites

2 · Summary

Assuming AC for the cited topological suppliers, this page builds the classical route from the braid group to polynomial link invariants. On the Hecke side it defines the type-A Hecke tower over Λ=Z[v±1,z], proves that the tower is free over the previous level with an explicit new-strand basis, and constructs Ocneanu's Markov trace, the unique trace family compatible with the two stabilizations. The trace is converted into the HOMFLYPT invariant by the normalization ue(β)αn−1 with α=(uz)−1 in the coefficient ring R=Λ[z−1,u±1,s]/(s2−v, vzu2−(z+1−v)), Markov's theorem makes the result an oriented link invariant, and the quadratic Hecke relation gives the HOMFLYPT skein relation. Specializing z=−1/(v+1) and u=s produces the Jones invariant, and the Temperley--Lieb quotient records the algebra generated by the Jones idempotents.

On the algebraic side the page develops the one-variable Alexander module and polynomial through the following constructions: elementary ideals of a finitely presented module, their presentation independence, the Alexander module of a link complement (finitely presented over the Laurent ring), the Alexander polynomial as a gcd of the zeroth elementary ideal of the absolute Alexander module, and its invariance under ambient isotopy. The Fox-calculus deficiency-one rule and the coloured reduced Burau matrix then produce Morton's determinant formula for a closed braid and its axis, and its one-variable specialization recovers the Alexander polynomial from the reduced Burau representation of any braid representative.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The exponent sum of a braid

Definition

Let n≥1 and let Bn=⟨σ1,…,σn−1∣Artin relators⟩ be the braid group of the Artin presentation (The braid group by Artin presentation); recall that B0 and B1 are trivial. The exponent sum is the unique homomorphism

en:Bn⟶Z,en(σi)=1(1≤i≤n−1),

where Z is the additive group of integers. It is well defined because every defining relator of the Artin presentation has exponent sum 0: the braid relator σiσi+1σi=σi+1σiσi+1 has both sides of exponent sum 3, and each far-commutation relator has both sides of exponent sum 2, so the assignment σi↦1 kills all relators, and Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group applies. It is surjective for n≥2 and it is the trivial map on the trivial group B1. For every Artin word β=σi1ε1⋯σikεk one has en(β)=∑r=1kεr independently of the word, and en(β−1)=−en(β). Caveat: en is the composite of the abelianisation Bn→Bnab with a surjection onto the free cyclic group Z (for n≥2): since the target is abelian, every commutator is sent to 0, so en factors through Bn/[Bn,Bn] (The abelianisation Gab:=G/[G,G] and its canonical map). No normal form, Garside structure or faithfulness statement is used anywhere.

Facts & Assumptions

Given: An integer n≥1 and the Artin presentation of Bn; no choice principle is used.

[F1]

Bn=⟨σ1,…,σn−1∣σiσi+1σi=σi+1σiσi+1 (1≤i≤n−2), σiσj=σjσi (∣i−j∣>1)⟩, with B0=B1 trivial and Bn defined by the empty presentation for n≤1 (The braid group by Artin presentation).

[F2]

Von Dyck: if a function from the generators of a presented group to a group H sends every defining relator to the identity of H, then it extends to a unique homomorphism from the presented group to H (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

[F3]

A group homomorphism f:G→G′ satisfies f(xy)=f(x)f(y) for all x,y, hence f(xk)=f(x)k for all k∈Z (Monoid homomorphism and group homomorphism).

Proof

1.1F1F2given

Well-definedness. Write the target additively, so the identity of Z is 0. Define u on generators by u(σi):=1. At the braid relator both sides receive 1+1+1=3; at each far-commutation relator both sides receive 1+1=2. Hence every defining relator of [F1] is sent to 0, and [F2] produces a unique homomorphism en:Bn→Z with en(σi)=1. For n≤1 the group Bn is trivial by [F1] and the unique homomorphism to Z is the trivial one; this is the case n=1 of the statement.

2.1F3step 1.1algebra

Values on words and inverses. Let β=σi1ε1⋯σikεk be an Artin word. By [F3] applied successively, en(β)=∑r=1kεren(σir)=∑r=1kεr; in particular the value does not depend on the word chosen to represent the element β, because it equals the value of the well-defined map en at β. Taking k=1, en(σi−1)=−1=−en(σi), so the same computation gives en(β−1)=−en(β) for every Artin word by [F3] and the multiplicativity of group homomorphisms.

3.1F1step 1.1step 2.1given∎

Surjectivity. For n≥2 the element en(σ1)=1 generates the additive group Z, so en is surjective; for n=1 the domain B1 is trivial, and the exponent sum is the (trivial, hence not surjective) map into Z. This proves all claims of the definition and completes the construction of the unique homomorphism with the prescribed values.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Elementary ideals of a finitely presented module

Definition

Let R be a commutative ring (Commutative ring) and let M be a finitely presented R-module (Finitely presented modules and finitely presented algebras), so that there are m,n∈N and a presentation

Rm→ A Rn→ β M⟶0.

Fix the standard bases e1,…,em of Rm and f1,…,fn of Rn (Finitely presented modules and finitely presented algebras) and let A=(aij) be the n×m matrix of the R-linear map α with respect to them: the j-th column of A is the coordinate vector of α(ej), so α(ej)=∑i=1naijfi. Such a matrix is called a presentation matrix of M (for the chosen presentation). A minor of A of size r×r is the determinant det⁡(aisjt)s,t=1r (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix) of the square submatrix obtained by choosing rows i1<⋯<ir and columns j1<⋯<jr; determinants of 1×1 and 0×0 submatrices are allowed, with the empty determinant equal to 1.

For k≥0 the k-th elementary ideal Ek(M) of the presented module M is the ideal of R generated by the determinants of all (n−k)×(n−k) minors of A (The ideal generated by a subset and principal ideals, Left, right and two-sided ideals): if n−k>n or n−k>m there is no such minor, and the ideal generated by the empty set is 0. In particular no minor is nonzero-by-convention: the conventions are Ek(M)=Rfor k≥n,Ek(M)=0for k<n−m. For 0≤k≤min⁡(n,m) the ideal Ek(M) is the ideal generated by the (n−k)×(n−k) minors; e.g. E1(M) is generated by the (n−1)×(n−1) minors of A, and En(M)=R because the 0×0 minor is 1. This is the k-th Fitting ideal Fit⁡k(M) of the Stacks Project (Tag 07Z6, Lemma 15.8.2 and Definition 15.8.3), which is indexed by the size n−k of the complementary minors; the two conventions 0=E−1⊂E0⊂⋯ agree on the range 0≤k≤min⁡(n,m).

Caveats. (i) The notation Ek(M) suppresses the chosen presentation; the ideal defined here is a priori attached to the presentation and it is the content of Elementary ideals are independent of the presentation that it is in fact an invariant of M. (ii) The conventions in the degenerate ranges are conventions, not theorems; they are the ones compatible with the Stacks numbering and with independence of the presentation.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Elementary ideals are independent of the presentation

Statement

Let R be a commutative ring and let M be a finitely presented R-module. Then for every k≥0 the elementary ideal Ek(M) of Elementary ideals of a finitely presented module is independent of the chosen finite presentation of M; in particular it is an invariant of the isomorphism class of M, and isomorphic modules have the same elementary ideals.

Facts & Assumptions

Given: A commutative ring R, a finitely presented R-module M and an integer k≥0. No choice principle is used.

[F1]

For a presentation Rm→ARn→M→0 with m,n finite, Ek(M) is the ideal generated by all (n−k)×(n−k) minors of A, with Ek(M)=R for k≥n and Ek(M)=0 for k<n−m (Elementary ideals of a finitely presented module).

[F2]

For a finitely generated module N presented as R(J)→φRn→N→0 with n finite and J arbitrary, the ideal In−k(φ) generated by the (n−k)×(n−k) minors depends only on N and the fixed integer k, not on the presentation; it is written Fitt⁡k(N). The conventions are Ir=R for r≤0 and Ir=0 when there are no r×r minors. In particular the minor size changes when the number of presentation generators changes. Fitting ideals are compatible with base change (Fitting ideals do not depend on a presentation).

[F3]

A finitely presented module M is finitely generated and admits a presentation Rm→Rn→M→0 with m,n finite; the cokernel of the presentation map is M (Finitely presented modules and finitely presented algebras, Module homomorphism and isomorphism, kernel, image and cokernel, Generated submodule, cyclic and finitely generated modules, module basis and free module).

[F4]

An isomorphism u:M→M′ of R-modules carries a presentation Rm→Rn→M→0 to the presentation Rm→Rn→u∘βM′→0 with the same presentation matrix; hence isomorphic modules admit presentations with identical matrices. [F3, given]

Proof

1.1F1F2F3

Identification with the Fitting indexing. Given a finite presentation of M with presentation matrix A of size n×m, [F1] defines Ek(M) as the ideal generated by the (n−k)×(n−k) minors of A, with the values R for n−k≤0 and 0 when n−k exceeds the number m of columns. This is exactly the ideal In−k(A) of [F2] for the same presentation (whose index set J is finite of size m), including both conventions; hence Ek(M)=In−k(A)=Fitt⁡k(M) for every finite presentation of M.

2.1F2F4step 1.1∎

Independence and isomorphism invariance. By [F2] the value In−k(A) is independent of the presentation, so by step 1.1 Ek(M) is independent of the chosen finite presentation. If u:M→M′ is an isomorphism, [F4] transports any finite presentation of M to one of M′ with the same matrix, so the two ideals agree. This proves the statement.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The HOMFLYPT coefficient ring

Definition

Let A=Z[v±1] and Λ=A[z]=Z[v±1,z] (The Laurent polynomial ring as the principal localisation of Z[t] at t, The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution), and put z−:=v−1(z+1−v)∈Λ. Let R be the commutative ring presented by  R:=Λ[z−1,u±1,s]/(s2−v, vzu2−(z+1−v)) , i.e. the quotient of the localisation of Λ[s,u] at the multiplicative subset generated by z and u by the two displayed relations (Multiplicative subsets and the localisation S−1R as equivalence classes of fractions, The quotient ring R/I with (r+I)(s+I)=rs+I, Universal property of localisation: maps that invert S factor uniquely through S−1R). Write again v,z,s,u for the images in R.

Elementary properties. R is a commutative ring with unit; v, z and u are units by construction, and s⋅(sv−1)=s2v−1=1, so s is a unit too, with s−1=sv−1. The relations read s2=v and u2=z−/z, equivalently vzu2=z+1−v. The elements l:=us,m:=s−s−1=s−1(v−1) belong to R, and l is a unit. No invertibility of m is imposed. The identity l−1−l=m (uz)−1 holds in R.

Universal property. Let T be a commutative ring with unit. Giving a unital ring homomorphism R→T is exactly the same as giving units v0,z0,u0,s0∈T× satisfying s02=v0,v0z0u02=z0+1−v0; the homomorphism then sends v↦v0, z↦z0, u↦u0, s↦s0. The existence direction is the universal property of polynomial rings, localisations and quotients; uniqueness holds because these images determine the images of their inverses, and these generators together with the prescribed inverses generate R.

Caveats. R is introduced only to hold the normalisation of The HOMFLYPT polynomial from the Hecke Markov trace; no claim is made that R is a domain or a UFD, and the two square roots s of v and u of z−/z are formal. The elements v,z are inverted because v is a unit of Λ and the trace identity α=(uz)−1 inverts z; u is inverted because the exponent e(β) of a braid may be negative and because α=(uz)−1 inverts u. Inverting u is part of the definition: the relation u2=z−/z alone does not force u to be a unit. The element m=s−s−1 need not be a unit: the universal specialization v=z=u=s=1 sends it to 0∈Z. Division by m is therefore only licensed after passing to the localization R[m−1]; the quotient ring R/(m) is defined without inverting m.

Facts & Assumptions

Given: The rings A=Z[v±1], Λ=A[z], the elements z−=v−1(z+1−v), and the multiplicative subsets generated by z and u. No choice principle is used.

[F2]

Localisation inverts a multiplicative subset and has the universal property: a unital ring homomorphism from the localisation is exactly a unital ring homomorphism from the original ring sending the subset to units (Multiplicative subsets and the localisation S−1R as equivalence classes of fractions, Universal property of localisation: maps that invert S factor uniquely through S−1R, Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[F3]

A quotient ring is the universal ring receiving the original ring with the prescribed elements killed (The quotient ring R/I with (r+I)(s+I)=rs+I, A ring homomorphism whose kernel contains a two-sided ideal factors uniquely through the quotient ring); a unital ring homomorphism is a map preserving addition, multiplication and 1 (Ring homomorphism: additive, multiplicative, and required to send 1 to 1).

Proof

1.1F1F2F3algebra

Well-formedness. The localisation Λ[z−1,u±1,s] of the polynomial ring Λ[s,u] at the multiplicative subset generated by z and u is a commutative ring with unit by [F2], and by [F1] the images v,z,u are units (for v because v is already a unit of Λ). Forming the quotient by the ideal generated by the two relations gives a commutative ring R with unit by [F3], and the displayed relations hold in it by construction. Since s2=v and v is a unit, s is a unit with s−1=sv−1, so s−1 exists and m=s−s−1=s−1(s2−1)=s−1(v−1) as displayed.

1.2algebra

The identity. Using s2=v and vzu2=z+1−v, so that u2v=(z+1−v)z−1 and 1−u2v=(v−1)z−1, one computes l−1−l=(us)−1−us=(1−u2s2)(us)−1=(1−u2v)(us)−1=(v−1)z−1u−1s−1=s−1(v−1)(uz)−1=m(uz)−1, which is the displayed identity.

2.1F2F3step 1.1∎

Universal property. By [F2] a unital homomorphism from Λ[z−1,u±1,s] to T is exactly a unital homomorphism Λ[s,u]→T sending z and u to units, i.e. a choice of images v0 (a unit, since v is a unit of Λ and homomorphisms send units to units), z0,u0∈T× and s0∈T; by [F3] it factors through the quotient R exactly when the two relations hold at the images, i.e. s02=v0 and v0z0u02=z0+1−v0; uniqueness holds because the images of v,z,u,s determine those of the inverted elements, and these elements and inverses generate R.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Laurent polynomial ring is Noetherian and a unique factorisation domain

Statement

The Laurent polynomial ring Λ=Z[t±1] of The Laurent polynomial ring as the principal localisation of Z[t] at t is Noetherian, hence every ideal of Λ is finitely generated, and Λ is a unique factorisation domain; its units are ±tk, k∈Z, and t is prime in Z[t] but becomes a unit in Λ.

Facts & Assumptions

Given: The ring Λ=Z[t±1], described in The Laurent polynomial ring as the principal localisation of Z[t] at t as the principal localisation Z[t]S at S={tk:k≥0}. No choice principle is used.

[F1]

Λ is commutative with unit, t is a unit with inverse t−1, and every element has a finite representative ∑kaktk; the localisation map Z[t]→Λ is a unital ring homomorphism (The Laurent polynomial ring as the principal localisation of Z[t] at t, Multiplicative subsets and the localisation S−1R as equivalence classes of fractions, Principal localisation Rf={1,f,f2,…}−1R); the units of Λ are exactly ±tk (Units, powers and the domain property of the Laurent polynomial ring).

[F2]

Z is a Noetherian ring and the polynomial ring in finitely many variables over a Noetherian ring is Noetherian; in particular Z[t] is Noetherian (Left and right Noetherian rings, If R is Noetherian then R[x1,…,xn] is Noetherian for every n∈N, The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution). Quotients and localisations of Noetherian rings are Noetherian (Every quotient and every localisation of a Noetherian ring is Noetherian).

[F3]

Z is a UFD (The fundamental theorem of arithmetic: every integer n≥1 is a product of primes, and the factorisation is unique up to order — if ∏i<rpi=∏j<sqj with every pi and qj prime, then r=s and qi=pπ(i) for some π∈Sym⁡(r), Unique factorisation domain). Gauss' lemma says that products of primitive polynomials are primitive, and that a primitive positive-degree integer polynomial is irreducible over Z exactly when irreducible over Q (Gauss lemma over a UFD). The polynomial ring Q[t] is a UFD (For every field F, F[x] is a unique factorisation domain). The integer-polynomial UFD assertion needed below is derived from these claims, not quoted as a stronger Gauss-lemma statement.

[F4]

For a multiplicative subset the localisation AS has the universal property of Principal localisation Rf={1,f,f2,…}−1R and Multiplicative subsets and the localisation S−1R as equivalence classes of fractions: ring homomorphisms from AS correspond to ring homomorphisms from A sending S to units, and the image of s∈S is a unit of AS.

Proof

1.1F1F2F3

Noetherian. Every nonzero ideal of Z is generated by its least positive element, by integer division, and the zero ideal is generated by 0; thus Z is Noetherian. By [F2] the polynomial ring Z[t] is Noetherian, and Λ=Z[t]S is a localisation of it; localisations of Noetherian rings are Noetherian by [F2]. Hence every ideal of Λ is finitely generated. In Z[t], if t divides fg, evaluation at zero gives f(0)g(0)=0 in the domain Z, so one constant term vanishes and t divides that factor. Since t is nonzero and a nonunit there, it is prime; localization then makes it a unit by [F1].

1.2F3algebra

The integer-polynomial UFD. Write any nonzero integer polynomial as its integer content times a primitive polynomial. Factor the latter over Q[t] by [F3], and clear denominators and contents in each nonconstant factor to obtain primitive integer factors. Their product is primitive by Gauss' lemma. Two primitive integer polynomials related by a nonzero rational scalar differ only by sign: a reduced denominator would divide every coefficient of the first, and the scalar's numerator would divide every coefficient of the second. Hence the primitive polynomial is, up to sign, the product of these primitive factors, which are irreducible over Z by Gauss' lemma. Integer prime factors of the content complete the factorization. Uniqueness follows by comparing integer contents using integer factorization, then comparing the remaining factors in the UFD Q[t]; primitive rational associates are integer associates by the same scalar argument. Thus Z[t] is a UFD, and its irreducibles are prime.

2.1F1F4step 1.2algebra

Surviving irreducibles. An irreducible p∈Z[t] becomes a unit in Λ exactly when it divides a power of t: a relation (p/1)(a/tN)=1 is equivalent, by injectivity of the localisation map, to pa=tN, and the converse gives an inverse. Suppose p remains a nonunit and p=xy in Λ. Write x=a/tN and y=b/tM. Then ptN+M=ab in Z[t]. The UFD property of step 1.2 makes p prime, so, after interchanging x,y, write a=pa′. Cancellation gives a′b=tN+M, hence y(a′/tN)=1. Thus p is irreducible in Λ.

3.1F1step 1.1step 1.2step 2.1algebra∎

Existence and uniqueness. Every nonzero nonunit x∈Λ has the form a/tN with 0≠a∈Z[t]. Factor a using step 1.2 and absorb all factors associated to t into a Laurent unit. Step 2.1 shows that all remaining factors are irreducible in Λ, giving existence. In particular every irreducible of Λ is associate there to one of these surviving integer-polynomial primes: its factorization can contain only one nonunit factor. To compare two Laurent factorizations, replace their factors by these integer-polynomial primes and absorb their Laurent units, which are ±tk by [F1]. Clearing powers of t gives equality in Z[t]. Uniqueness there matches all primes not associated to t on the two sides, hence matches the original Laurent factors up to permutation and Laurent units. Together with step 1.1, this proves the statement.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Markov trace on the type-A Hecke tower

Definition

Let A=Z[v±1] be the Laurent polynomial ring and let Λ:=A[z]=Z[v±1,z] be the polynomial ring over A in one indeterminate (The Laurent polynomial ring as the principal localisation of Z[t] at t, The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution). For n≥1 let H(n):=Λ⊗AHv(n) be the scalar extension of the generic type-A Hecke algebra of The generic type-A Hecke algebra (Algebras over a commutative ring, central structure maps, and algebra homomorphisms), so that H(n) is the unital Λ-algebra with generators T1,…,Tn−1 subject to Ti2=(v−1)Ti+v,TiTi+1Ti=Ti+1TiTi+1,TiTj=TjTi(∣i−j∣>1), and H(1)=Λ. The Λ-algebra H(n) is free with basis {Tw:w∈Sn}, where Tw is the product of the generators along a reduced word (The standard basis of the generic type-A Hecke algebra, The symmetric group Sym⁡(X): the bijections of a set X under composition).

The generators induce a Λ-algebra homomorphism ιn:H(n)→H(n+1), Ti↦Ti; it is injective, so we identify H(n) with its image, a Λ-subalgebra of H(n+1).

A Markov trace on the type-A Hecke tower is a family of Λ-linear maps tr⁡n:H(n)→Λ, n≥1, such that

  • (M1) tr⁡n(1)=1 for one (equivalently, by (M2), every) n;
  • (M2) tr⁡n+1∘ιn=tr⁡n for all n≥1;
  • (M3) tr⁡n(xy)=tr⁡n(yx) for all x,y∈H(n);
  • (M4) tr⁡n+1(x Tn)=z tr⁡n(x) for all n≥1 and x∈H(n).

Here z∈Λ is a formal parameter, distinct from the Hecke parameter v; no value of z is fixed or inverted by this definition, and the trace takes values in Λ, not in a field.

Caveats. This is a family over the whole tower, not a single functional; the conditions (M1)--(M4) are a definition, so no trace is asserted to exist here (existence and uniqueness is The Ocneanu Markov trace exists and is unique). By (M3), (M4) is equivalent to tr⁡n+1(u Tn v)=ztr⁡n(uv) for all u,v∈H(n): applied to uTnv one gets tr⁡n+1(uTnv)=tr⁡n+1(Tnvu)=ztr⁡n(vu)=ztr⁡n(uv), and conversely take v=1.

Facts & Assumptions

Given: The Laurent ring A=Z[v±1], the polynomial ring Λ=A[z], the generic Hecke algebras Hv(n) over A, and the scalar extensions H(n)=Λ⊗AHv(n) for n≥1. No choice principle is used.

[F1]

Hv(n) is the unital A-algebra presented by T1,…,Tn−1 with Ti2=(v−1)Ti+v, the braid relations and the distant commutations; Hv(n)=A for n≤1 (The generic type-A Hecke algebra).

[F2]

{Tw:w∈Sn} is a Λ-basis of H(n) for n≥2, and H(1)=Λ; the reduced word Tw is well defined (The standard basis of the generic type-A Hecke algebra, The generic type-A Hecke algebra).

[F4]

A Λ-algebra homomorphism is a ring homomorphism that is Λ-linear (Ring homomorphism: additive, multiplicative, and required to send 1 to 1, Algebras over a commutative ring, central structure maps, and algebra homomorphisms); the universal property of a presented algebra yields a homomorphism from the presented algebra whenever the prescribed images satisfy the defining relations.

Proof

Step 1.1 establishes the well-formedness of the ambient tower and step 2.1 the injectivity and the stated equivalence of (M1); the four conditions are a definition and require no existence proof.

1.1F1F2F3F4given

The tower is well formed. On the tensor product in [F3], define (λ⊗h)(μ⊗k)=λμ⊗hk: balancing over the central ring A makes this bilinear product well defined, and associativity and the unit 1⊗1 follow from those of Hv(n). It has the asserted presentation over Λ. Indeed the generators 1⊗Ti satisfy the relators, giving a map from that presented algebra to the tensor product. Conversely the presented Λ-algebra receives an A-algebra map from Hv(n) by [F1], and the balanced map (λ,h)↦λh extends to the tensor product by [F3]. The two maps are inverse on elementary tensors and generators. By [F2] each H(n) is a free Λ-module with the stated basis, so H(n) is a unital Λ-algebra and H(1)=Λ. Since the defining relators of H(n) are literally among the relators of H(n+1) under Ti↦Ti, [F4] applies to the assignment on generators and gives a Λ-algebra homomorphism ιn:H(n)→H(n+1) with ιn(Ti)=Ti.

2.1F2step 1.1algebra∎

Injectivity and the equivalence in (M1). Under ιn the basis element Tw, w∈Sn, is carried to the element of H(n+1) given by the same reduced word, which is the standard basis element Tw for w regarded in Sn+1 (fixing n+1); these elements are pairwise distinct members of the Λ-basis of H(n+1) by [F2], hence are linearly independent and ιn is injective. For the parenthetical in (M1): if tr⁡m(1)=1 for some m, then for k≥1 condition (M2) gives tr⁡k(1)=tr⁡k+1(ιk(1))=tr⁡k+1(1), so tr⁡n(1)=tr⁡m(1)=1 for every n; (M2) applies in both directions because ιk(1)=1. The equivalence of the two forms of (M4) follows from (M3) as displayed in the caveats.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Hecke tower is free over the previous level

Statement

Let H(1)⊂H(2)⊂⋯ be the Hecke tower of The Markov trace on the type-A Hecke tower, with H(n) free of rank n! over Λ with basis {Tw:w∈Sn} (The standard basis of the generic type-A Hecke algebra), and for 1≤i≤n put w(i):=snsn−1⋯sn−i+1, w(0):=1. Then for every n≥1:

  1. H(n+1) is a free left H(n)-module with basis Tw(0),Tw(1),…,Tw(n): every element of H(n+1) has a unique expression ∑i=0nxiTw(i) with xi∈H(n);
  2. H(n+1) is also a free right H(n)-module with basis T(w(0))−1,T(w(1))−1,…,T(w(n))−1;
  3. the H(n)-sub-bimodule H(n)TnH(n) equals the direct sum ⨁i=1nH(n)Tw(i), and the multiplication map H(n)⊗H(n−1)H(n)⟶H(n+1),x⊗y⟼xTny, is an isomorphism of H(n)-bimodules onto H(n)TnH(n); consequently H(n+1)=H(n)⊕H(n)TnH(n) holds as a direct sum of H(n)-bimodules in the form H(n+1)=H(n)⊕(H(n)⊗H(n−1)H(n)). All three parts are proved here. Each chosen nonidentity minimal left-coset representative w(i) has a displayed reduced expression containing sn exactly once; this does not characterize all basis elements whose reduced expressions contain sn once. In the tensor notation of part (3), set H(0):=Λ, the scalar extension Λ⊗AHv(0), so the n=1 case is defined.

Facts & Assumptions

Given: The Hecke tower H(1)⊂H(2)⊂⋯ over Λ=Z[v±1,z] and an integer n≥1. No choice principle is used.

[F1]

H(n) is the Λ-algebra with generators T1,…,Tn−1 and the quadratic, braid and far-commutation relations, and {Tw:w∈Sn} is a Λ-basis (The Markov trace on the type-A Hecke tower, The standard basis of the generic type-A Hecke algebra).

[F2]

For w∈Sn and 1≤i≤n−1, TwTi=Twsi if ℓ(wsi)=ℓ(w)+1, and TwTi=(v−1)Tw+v Twsi if ℓ(wsi)=ℓ(w)−1; Tw is the product along a reduced word (The standard basis of the generic type-A Hecke algebra).

[F3]

For permutations, word length equals inversion length, ℓ(wsi)=ℓ(w)±1 with the minus sign exactly when w(i)>w(i+1), and a product of two reduced words is reduced exactly when lengths add (Finite Weyl strong exchange and deletion, Permutation Weyl group and inversion length, The symmetric group has the Coxeter presentation, The symmetric group Sym⁡(X): the bijections of a set X under composition).

[F4]

The free left H(n)-module on the finite set {Tw(0),…,Tw(n)} consists of the unique finite sums ∑ixiTw(i) with xi∈H(n) (The free module on a set and its standard basis); a basis is a linearly independent generating set.

[F5]

The tensor product imposes additivity in both variables and the balancing relation xh⊗y=x⊗hy for h∈H(n−1) (The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums, Universal property of the tensor product for balanced maps into abelian groups). Here the commuting outer left and right H(n)-actions descend to the tensor product. The generators of H(n−1) are T1,…,Tn−2, all commuting with Tn by [F1].

Proof

1.1F3given

Coset representatives. For 0≤i≤n the permutation w(i)=snsn−1⋯sn−i+1 has length i and satisfies w(i)(n+1)=n for i≥1, while w(0)=id fixes n+1; equivalently w(i)−1(n+1)=n−i+1. Since two elements of Sn+1 lie in the same left coset of Sn exactly when their inverses send n+1 to the same point, the w(i) form a complete set of left coset representatives: Sn+1=⨆i=0nSnw(i).

2.1F2F3step 1.1

Length additivity. Every v∈Sn satisfies ℓ(vw(i))=ℓ(v)+i. Indeed w(i)=w(i−1)sn−i+1 and w(i−1)(n−i+1)=n−i+1<n+1=w(i−1)(n−i+2). For v∈Sn, v fixes n+1 and maps {1,…,n} to itself, so (vw(i−1))(n−i+1)=v(n−i+1)≤n<n+1=v(n+1)=(vw(i−1))(n−i+2). The ascent criterion in [F3] therefore gives ℓ(vw(i))=ℓ(vw(i−1))+1. Induction on i yields ℓ(vw(i))=ℓ(v)+i, and in particular ℓ(w(i))=i. Length-additive products of reduced words are reduced, so [F2] gives TvTw(i)=Tvw(i). Taking inverses also gives ℓ((w(i))−1v)=i+ℓ(v) and T(w(i))−1Tv=T(w(i))−1v for every v∈Sn.

3.1F1F4step 1.1step 2.1

The module bases. By step 1.1 and step 2.1, the elements vw(i), v∈Sn, 0≤i≤n, are exactly the elements of Sn+1, each occurring once. Hence {Tvw(i)} is the standard Λ-basis of H(n+1) by [F1], and Tvw(i)=TvTw(i). Regrouping by i proves part (1). For the right module, invert the left-coset decomposition Sn+1=⨆iSnw(i) to obtain Sn+1=⨆i(w(i))−1Sn. The length-additive formulas of step 2.1 show that the resulting standard-basis elements are T(w(i))−1Tv for v∈Sn, each exactly once; regrouping by i proves the stated right-module basis.

4.1F1step 1.1step 2.1step 3.1

The sub-bimodule and the tensor decomposition. For i≥1, the reduced word w(i)=snsn−1⋯sn−i+1 begins with sn, so Tw(i)∈TnH(n) and H(n)Tw(i)⊆H(n)TnH(n). This proves ⨁i=1nH(n)Tw(i)⊆H(n)TnH(n). Conversely, for every v∈Sn, ℓ(snv)=ℓ(v)+1: indeed ℓ(snv)=ℓ(v−1sn) by invariance of length under inversion, and v−1∈Sn fixes n+1, so right multiplication by sn is an ascent. Thus TnTv=Tsnv by concatenating reduced words. The permutation snv does not fix n+1, since (snv)(n+1)=n; hence in the left-coset decomposition of step 1.1 it belongs to a coset Snw(i) with i≥1. By step 2.1, Tsnv=TaTw(i) for some a∈Sn. Since the Tv form a Λ-basis of H(n) by [F1], this shows TnH(n)⊆⨁i=1nH(n)Tw(i), and left multiplication by H(n) gives the reverse inclusion for the generated sub-bimodule. Therefore H(n)TnH(n)=⨁i=1nH(n)Tw(i). Thus step 3.1 gives H(n+1)=H(n)⊕H(n)TnH(n) as H(n)-bimodules.

5.1F1F5step 3.1step 4.1algebra∎

The tensor isomorphism over Λ. For 0≤j≤n−1 put bj=Tn−1Tn−2⋯Tn−j, with b0=1. Applying part (1), already proved in step 3.1, at level n−1 gives H(n)=⨁jH(n−1)bj as a left module; for n=1 this is simply H(1)=H(0)=Λ. Consequently every tensor has a unique form ∑jaj⊗bj, aj∈H(n). Explicitly, if y=∑jhjbj, balancing sends x⊗y to the coefficient tuple (xhj)j; this is additive and balanced, and is inverse to (aj)j↦∑jaj⊗bj. By [F5], μ(x⊗y)=xTny is well defined and an H(n)-bimodule map. It sends aj⊗bj to ajTw(j+1). These form the unique left-module coordinates of H(n)TnH(n) from step 4.1, so μ is bijective. This proves part (3).

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Ocneanu Markov trace exists and is unique

Statement

Let H(1)⊂H(2)⊂⋯ be the type-A Hecke tower over Λ=Z[v±1,z] of The Markov trace on the type-A Hecke tower. Then there exists a unique Markov trace (tr⁡n)n≥1 on this tower in the sense of The Markov trace on the type-A Hecke tower. Moreover it satisfies, for all n≥1, all x,y∈H(n) and all 1≤i≤n−1:

  • (a) tr⁡n(Ti)=z;
  • (b) tr⁡n+1(xTny)=z tr⁡n(xy);
  • (c) tr⁡n is determined by (M1)--(M4) alone; it takes values in Λ and is computed by iterating (b) along the free basis of The Hecke tower is free over the previous level.

Facts & Assumptions

Given: The Hecke tower H(1)⊂H(2)⊂⋯ over Λ=Z[v±1,z]. No choice principle is used.

[F1]

Conditions (M1)--(M4) of a Markov trace and the equivalence of the two forms of (M4) (The Markov trace on the type-A Hecke tower).

[F2]

For every n≥1, H(n+1)=⨁i=0nH(n)Tw(i), where w(i)=snsn−1⋯sn−i+1 and Tw(i)=TnTn−1⋯Tn−i+1 for i≥1; each element has a unique expression ∑ixiTw(i) with xi∈H(n). Moreover H(n+1)=H(n)⊕(H(n)⊗H(n−1)H(n)) as H(n)-bimodules, so every element of H(n+1) determines a unique pair (a,ξ) with a∈H(n) and ξ∈H(n)⊗H(n−1)H(n); a finite sum representing ξ is taken modulo the tensor relations, including xTnhy=xhTny for h∈H(n−1) (The Hecke tower is free over the previous level).

[F3]

H(n) has Λ-basis {Tw:w∈Sn}, and for w∈Sn, TwTi=Twsi or (v−1)Tw+vTwsi according as ℓ(wsi)=ℓ(w)+1 or ℓ(wsi)=ℓ(w)−1; the quadratic relation is Ti2=(v−1)Ti+v (The standard basis of the generic type-A Hecke algebra, The generic type-A Hecke algebra).

Proof

1.1F1F2algebra

Uniqueness. Suppose (tr⁡n) is a Markov trace. The base is H(1)=Λ, where tr⁡1(λ)=λ by (M1) and Λ-linearity. For n≥2, [F2] at level n−1 gives each y∈H(n) the unique expansion y=∑i=0n−1xiTw(i) with xi∈H(n−1) and Tw(i)=Tn−1⋯Tn−i. By (M2), tr⁡n(x0)=tr⁡n−1(x0); by (M3) and the two-sided form of (M4), tr⁡n(xiTw(i))=tr⁡n(Tw(i)xi)=ztr⁡n−1(Tn−2⋯Tn−ixi) for i≥1, an element of H(n−1) on which tr⁡n−1 is already defined. Hence tr⁡n is determined by tr⁡n−1; induction gives uniqueness and (c).

1.2F1F2construct

Recursive construction. Define tr⁡1:Λ→Λ by tr⁡1(a)=a. Suppose tr⁡n is defined. The bimodule isomorphism in [F2] is induced by μn(x⊗y)=xTny and gives H(n+1)=H(n)⊕im⁡(μn). The Λ-linear map τn:H(n)⊗H(n−1)H(n)→Λ, x⊗y↦tr⁡n(xy), is balanced: (xh)⊗y=x⊗(hy) for h∈H(n−1), and both tensors map to tr⁡n(xhy). Define tr⁡n+1(a+μn(ξ)):=tr⁡n(a)+zτn(ξ),a∈H(n), ξ∈H(n)⊗H(n−1)H(n). The direct-sum decomposition and the isomorphism μn make this definition well defined and Λ-linear. Restriction to H(n) gives (M2), and tr⁡n+1(1)=tr⁡n(1) gives (M1). For each i<n, repeated restriction gives tr⁡n(Ti)=tr⁡i+1(Ti)=z by the recursion at level i, proving (a). By construction, tr⁡n+1(xTny)=ztr⁡n(xy)(x,y∈H(n)); this is the two-sided recursion, and y=1 gives (M4). Iterating it along the left basis of [F2] gives the recursive formula in (c).

2.1F1F2step 1.2

Cyclicity: reduction. We prove cyclicity by induction. The base H(1)=Λ is commutative, and H(2) is generated over Λ by the single element T1, so its trace is cyclic. For n≥2, assume tr⁡n is cyclic and consider H(n+1)=H(n)⊕In, where In is the H(n)-sub-bimodule spanned by xTny, as in [F2]. If a,b∈H(n), cyclicity is the induction hypothesis. If a∈H(n) and b=xTny∈In, then the construction in step 1.2 gives tr⁡n+1(ab)=ztr⁡n(axy) and tr⁡n+1(ba)=ztr⁡n(xya), equal by induction; linearity handles sums in In. Thus it remains the case a=xTny, b=uTnv with x,y,u,v∈H(n). Applying the already proved one-in-H(n) case to the outer factors reduces tr⁡n+1(ab)=tr⁡n+1(TnXTnY) and tr⁡n+1(ba)=tr⁡n+1(TnYTnX), where X=yu and Y=vx. By that same case, this is equivalent to tr⁡n+1(TnXTnY)=tr⁡n+1(XTnYTn)(X,Y∈H(n)). It remains to prove this identity.

3.1F1F2F3step 1.2step 2.1algebra∎

The final cases. Use [F2] at level n−1 to write H(n)=H(n−1)⊕H(n−1)Tn−1H(n−1); the balance here is over H(n−2), since Tn−1 commutes with H(n−2). If X,Y∈H(n−1), then Tn commutes with both and the desired identity follows from the quadratic relation for Tn. For X=x′Tn−1x′′ with x′,x′′∈H(n−1) and Y∈H(n−1), commuting Tn past x′,x′′,Y and applying the braid relation gives tr⁡n+1(TnXTnY)=ztr⁡n(x′Tn−12x′′Y). On the other side, commute Tn past x′′ and Y, expand Tn2, and use the two-sided recursion from step 1.2 to obtain tr⁡n+1(XTnYTn)=(v−1)ztr⁡n(x′Tn−1x′′Y)+vtr⁡n(x′Tn−1x′′Y). The level-n recursion gives tr⁡n(x′Tn−1x′′Y)=ztr⁡n−1(x′x′′Y), while restriction gives tr⁡n(x′x′′Y)=tr⁡n−1(x′x′′Y). Expanding Tn−12 in the first display therefore yields the same expression as the right side. If X∈H(n−1) and Y∈H(n−1)Tn−1H(n−1), write Y=y′Tn−1y′′ and put a:=Xy′∈H(n−1). Since Tn commutes with X,y′,y′′, the quadratic relation and two-sided recursion give tr⁡n+1(TnXTnY)=(v−1)ztr⁡n(aTn−1y′′)+vtr⁡n(aTn−1y′′),tr⁡n+1(XTnYTn)=z(v−1)tr⁡n(aTn−1y′′)+zvtr⁡n(ay′′). By (M2) and the two-sided recursion at level n, tr⁡n(ay′′)=tr⁡n−1(ay′′) and tr⁡n(aTn−1y′′)=ztr⁡n−1(ay′′); hence these expressions agree. Finally let X=x′Tn−1x′′ and Y=y′Tn−1y′′ with all four coefficients in H(n−1). Braid, commutation, and the two-sided recursion give tr⁡n+1(TnXTnY)=ztr⁡n(x′Tn−12x′′y′Tn−1y′′),tr⁡n+1(XTnYTn)=ztr⁡n(x′Tn−1x′′y′Tn−12y′′). After expanding the squared generators, the terms with coefficient z(v−1) agree. The remaining terms agree because the level-n recursion and the induction hypotheses that tr⁡n and tr⁡n−1 are cyclic give tr⁡n(x′x′′y′Tn−1y′′)=ztr⁡n−1(x′x′′y′y′′),tr⁡n(x′Tn−1x′′y′y′′)=ztr⁡n−1(x′x′′y′y′′). Thus the central identity holds in every case, (M3) follows, and the induction is complete.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Markov trace of an inverse Hecke generator

Statement

In the Hecke tower H(1)⊂H(2)⊂⋯ over Λ=Z[v±1,z]: (a) each generator is invertible with Ti−1=v−1Ti+(v−1−1) and Ti−vTi−1=v−1; (b) for the Ocneanu trace of The Ocneanu Markov trace exists and is unique put z−:=v−1(z+1−v)∈Λ; then for every n≥1, every x∈H(n) tr⁡n+1(xTn−1)=z−tr⁡n(x); (c) z−z−=(1−v−1)(z+1)≠0 as an element of the domain Λ, so the two formal generic stabilisation factors differ. Under specialization they can agree; for example z=−1 gives z−=z.

Facts & Assumptions

Given: The Hecke tower over Λ=Z[v±1,z], an integer n≥1, an element x∈H(n) and the Ocneanu trace. No choice principle is used.

[F1]

H(n) is the Λ-algebra with generators T1,…,Tn−1, quadratic relations Ti2=(v−1)Ti+v, braid relations and distant commutations (The generic type-A Hecke algebra).

[F2]

The Ocneanu trace satisfies (M1)--(M4), and the two-sided form tr⁡n+1(uTnv)=ztr⁡n(uv) for u,v∈H(n) (The Ocneanu Markov trace exists and is unique).

Proof

1.1F1F3algebra

Inverses. From Ti2=(v−1)Ti+v of [F1] multiply by v−1: v−1Ti2=(1−v−1)Ti+1, so Ti(v−1Ti+(v−1−1))=1; the same computation with the order reversed gives (v−1Ti+(v−1−1))Ti=1, so Ti is a unit with Ti−1=v−1Ti+(v−1−1); then Ti−vTi−1=Ti−Ti−(1−v)=v−1.

2.1F2step 1.1algebra

Traces of inverses. By (M2) and step 1.1, Tn−1=v−1Tn+(v−1−1) in H(n+1), so tr⁡n+1(xTn−1)=v−1tr⁡n+1(xTn)+(v−1−1)tr⁡n+1(x)=v−1ztr⁡n(x)+(v−1−1)tr⁡n(x)=z−tr⁡n(x), where the middle equality uses (M4) in its form x∈H(n) and the two-sided form [F2]; this proves the displayed negative-stabilization identity.

3.1F3algebra∎

Distinctness of the generic factors. Direct expansion in the domain Λ gives z−z−=z−v−1(z+1−v)=z(1−v−1)−(v−1−1)=(1−v−1)(z+1); since 1−v−1≠0 and z+1≠0 in the domain Λ of [F3], the product is nonzero. Hence the positive and negative stabilisations multiply the trace by distinct formal generic factors z and z−. They may coincide after specialization, as at z=−1.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedOpen item page →

The Alexander polynomial from the zeroth elementary ideal

Definition

Assume the Axiom of Choice, so that the Alexander module AL of an oriented nonempty link L is defined and finitely presented over Λ=Z[t±1] (The one-variable Alexander module of an oriented link, The Alexander module of a link complement is finitely presented). Let r be the number of components of L. Define the one-variable Alexander polynomial ΔL(t)∈Λ to be a greatest common divisor of the zeroth elementary ideal E0(AL) (Elementary ideals of a finitely presented module), i.e. a generator of the smallest principal ideal of Λ containing E0(AL) (The Laurent polynomial ring is Noetherian and a unique factorisation domain, Unique factorisation domain); it is well defined up to multiplication by a unit ±tk of Λ (Units, powers and the domain property of the Laurent polynomial ring). The Alexander invariant is the normalisation DL(t):={ΔL(t),r>1,ΔL(t)1−t,r=1, understood for a knot as an element of the fraction field of Λ when (1−t)∤ΔL(t); for the integer-valued link formulas of this page the distinction matters and is stated with each use.

Caveats. The ideal E0(AL) is a well-defined invariant of L because AL is finitely presented and elementary ideals are independent of the presentation (Elementary ideals are independent of the presentation); a greatest common divisor in a unique factorisation domain is well defined up to units, and the units of Λ are ±tk. For every link the absolute one-variable Alexander module admits a square presentation, so E0(AL) is principal, generated by its determinant (the standard link fact recorded in [F3]). For a knot (r=1), every gcd representative satisfies ΔL(1)=±1. These standard presentation and normalisation facts are recorded here; the gcd definition itself uses only finite presentability and unique factorisation.

Facts & Assumptions

Given: AC and an oriented link L with r components, its Alexander module AL over Λ=Z[t±1] and its zeroth elementary ideal E0(AL). No other choice principle is used.

[F1]

AL is a finitely generated Λ-module, hence finitely presented, and E0(AL) is therefore defined and independent of the presentation (The Alexander module of a link complement is finitely presented, Elementary ideals of a finitely presented module, Elementary ideals are independent of the presentation).

[F2]

Λ is a unique factorisation domain with units exactly ±tk, k∈Z; in a unique factorisation domain a greatest common divisor of a nonempty set of elements exists and is well defined up to multiplication by a unit (The Laurent polynomial ring is Noetherian and a unique factorisation domain, Unique factorisation domain, Units, powers and the domain property of the Laurent polynomial ring).

[F3]

Literature input. For every oriented link, the absolute one-variable Alexander module has a square presentation (Burde–Zieschang, section 9.18, pp. 135–136); the connected-Seifert-surface presentation is VT−tV (Exercise 9.5, p. 140). Thus its zeroth elementary ideal is the principal determinant ideal, including the zero ideal when the determinant vanishes. For a knot with a Seifert matrix V, the square matrix VT−tV presents the absolute Alexander module (Burde–Zieschang, Theorem 8.8, p. 110). Its determinant at t=1 is 1 in their canonical surface basis (Proposition 8.11, p. 112); hence E0(AL) is principal and every gcd representative has ΔL(1)=±1. The E0 indexing is essential because AL is absolute homology: for AL=Λ/(p) one has E0=(p) and E1=Λ. This is the standard normalisation of the Alexander polynomial (Burde–Zieschang, Theorem 8.8 and Proposition 8.11; locators in the references); it is recorded here and not used in the proofs of this page.

Proof

1.1F1F2

Well-definedness of ΔL. By [F1] the ideal E0(AL)⊆Λ is an invariant of L and Λ is a UFD; write E0(AL)=(g1,…,gm) for a finite nonempty generating family (possible since Λ is Noetherian; use the single generator 0 for the zero ideal) and choose a greatest common divisor g of g1,…,gm, whose existence in a UFD is [F2]. Then (g) is the smallest principal ideal containing E0(AL): it contains every gi, hence E0, and any principal ideal (h)⊇E0 contains all gi, so h∣g by the defining property of the gcd, hence (g)⊆(h). Replacing g by a unit multiple ±tkg gives the same ideal, and by [F2] these are exactly the other choices. The normalisation DL is then defined by the displayed formula, with the fraction understood in the fraction field of the domain Λ when r=1 and (1−t)∤ΔL(t).

2.1F2F3step 1.1∎

The knot normalisation. For r=1 the quoted standard fact [F3] identifies the normalisation of the Alexander polynomial used in the Burau comparison: DL=ΔL/(1−t) with ΔL(1)=±1 for every unit choice; for r>1 no division is performed and DL=ΔL. Both statements are part of the definition of the invariant used on this page.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Hecke generators satisfy the Artin relations and are units

Statement

Let H(n) be the Hecke tower over Λ=Z[v±1,z] of The Markov trace on the type-A Hecke tower. Then: (1) the elements T1,…,Tn−1 are units of H(n) with Ti−1=v−1Ti+(v−1−1); (2) the assignment σi↦Ti descends to a group homomorphism πn:Bn⟶H(n)×,πn(σi)=Ti, where H(n)× is the group of units of H(n); (3) for every Artin word β=σi1ε1⋯σikεk one has πn(β)=Ti1ε1⋯Tikεk, and πn+1(ιnBr(β))=ιn(πn(β)) for all β∈Bn under the standard inclusion of braid groups Bn→Bn+1.

Facts & Assumptions

Given: The Hecke tower over Λ=Z[v±1,z] and an integer n≥1. No choice principle is used.

[F1]

H(n) is the Λ-algebra with generators T1,…,Tn−1 and the relations TiTi+1Ti=Ti+1TiTi+1 for 1≤i≤n−2 and TiTj=TjTi for ∣i−j∣>1 (The generic type-A Hecke algebra, The Markov trace on the type-A Hecke tower).

[F2]

Each generator Ti is a unit of H(n) with Ti−1=v−1Ti+(v−1−1) (The Markov trace of an inverse Hecke generator).

[F3]

Bn=⟨σ1,…,σn−1∣Artin relators⟩ with the braid and far-commutation relations, B0,B1 trivial (The braid group by Artin presentation).

[F4]

Von Dyck: a function from the generators of a presented group to a group G that sends every defining relator to the identity extends to a unique group homomorphism (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group); a group homomorphism satisfies φ(x1⋯xk)=φ(x1)⋯φ(xk) and φ(x−1)=φ(x)−1 (Monoid homomorphism and group homomorphism).

Proof

1.1F2F3F4

The assignment kills the relators. Define u(σi):=Ti∈H(n)×, using [F2] to regard each Ti as an element of the unit group. At the braid relator σiσi+1σi=σi+1σiσi+1 both sides are sent to the equal elements TiTi+1Ti=Ti+1TiTi+1 of [F1]; at a far-commutation relator both sides are sent to TiTj=TjTi by [F1]. Hence every defining relator of [F3] is sent to the identity and [F4] applies, giving a unique group homomorphism πn:Bn→H(n)× with πn(σi)=Ti. For n=1 the domain B1 is trivial and its unique homomorphism into H(1)× sends the identity to the unit of H(1).

2.1F3F4step 1.1∎

Words and compatibility. For an Artin word β=σi1ε1⋯σikεk, [F4] gives πn(β)=πn(σi1)ε1⋯πn(σik)εk=Ti1ε1⋯Tikεk, since negative exponents are the inverses from step 1.1; this also shows that the value does not depend on the chosen word, being the value of the homomorphism πn at the element β. The standard inclusion Bn→Bn+1 sends each Artin generator σi with i≤n−1 to the generator with the same name (The braid group by Artin presentation), and ιn:H(n)→H(n+1) sends Ti to Ti (The Markov trace on the type-A Hecke tower); hence πn+1(ιnBr(β)) and ιn(πn(β)) are both the product of the Tiεi computed in H(n+1), and they agree.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The deficiency-one Fox calculus rule for the Alexander invariant

Statement

Assume the Axiom of Choice (The Axiom of Choice) for the library's Alexander module. Let L be an oriented link, let G=GL be its complement group, and take a deficiency-one presentation G=⟨g1,…,gn+1∣r1,…,rn⟩ (Group presentation by generators and relations, Free group on a set of generators). Let φ:G→H be a homomorphism to a finitely generated free abelian group, with induced ring map Z[G]→Z[H] (The group ring R[G] of finitely supported formal R-linear combinations of group elements). Form the evaluated Fox matrix Jφ=(φ(∂ri/∂gj)). If c is a presentation generator with φ(c)≠1, delete its column and define Qφ(L)≐det⁡Jφ′1−φ(c)in Frac⁡(Z[H]). The Fox rule identifies this quotient, up to a group-ring unit, with the corresponding specialization of the link's Alexander invariant; admissible deleted columns and presentations give the same invariant up to units. For the natural meridian abelianization H≅Zr, it is the multivariable Alexander polynomial when r>1, and for a knot it is ΔL(t)/(1−t), where ΔL is the one-variable Alexander polynomial of The Alexander polynomial from the zeroth elementary ideal. Specializations are asserted only when the displayed denominator remains nonzero. A generator with φ(c)=1 is not an admissible deleted column; the denominator then vanishes. For several components the equal-variable specialization of the multivariable invariant is distinguished from the library's absolute-homology one-variable polynomial.

Facts & Assumptions

Given: AC, an oriented link L, a deficiency-one presentation of its group, a homomorphism φ to a finitely generated free abelian group H, and an admissible deleted generator c. AC is inherited from the Alexander module.

[F1]

Literature input. Morton's standard method, printed pp. 4–5, applies to a presentation of a LINK group: evaluate its Fox derivatives, delete a generator column with φ(c)≠1, and divide the determinant by 1−φ(c). It computes the specialized Alexander invariant; under natural abelianization this is the multivariable polynomial for more than one component and ΔL/(1−t) for a knot. Relations written r=s may use derivatives of r−s. This is a literature input, not a local derivation of the Fox theorem (Morton, section 2 and proof of Theorem 1).

[F2]

The one-variable absolute homology Alexander module and its polynomial ΔL=gcd⁡E0(AL) are the conventions of The one-variable Alexander module of an oriented link and The Alexander polynomial from the zeroth elementary ideal. For a knot the invariant is the fraction ΔL/(1−t); the library's one-variable normalization for several components does not identify its polynomial with every specialization of the multivariable polynomial.

[F3]

The multiplication of a group ring is [g][h]=[gh] (The group ring R[G] is a unital R-algebra with basis G, and each g∈G is a unit of R[G]). For a basis of the finite-rank free abelian group H, identify its elements with integer exponent vectors: the basis elements of Z[H] are then precisely Laurent monomials, with exponent-addition multiplication. This is a commutative domain: in two nonzero finite sums, the product of the lexicographically largest exponent terms is the unique largest term, with nonzero integer coefficient. Thus evaluated determinants and quotients by nonzero elements lie in its fraction field (The group ring R[G] of finitely supported formal R-linear combinations of group elements, Group presentation by generators and relations, Free group on a set of generators).

Proof

1.1F1F3given

Application of the source rule. All source hypotheses in [F1] hold for the specified link group and admissible deleted column. Thus the evaluated deleted determinant divided by 1−φ(c) computes the source invariant. The evaluation takes place in the commutative target of [F3], even though the initial Fox coefficients need not commute.

1.2F1F2F3algebra

The codomain and specializations. The denominator is nonzero by hypothesis, so the quotient exists in the fraction field. Under natural meridian abelianization [F1] gives the multivariable polynomial for several components and the rational knot invariant of [F2]. Other homomorphisms substitute meridian images into this rule, provided their denominator stays nonzero; no polynomial divisibility is claimed for the knot fraction. When φ(c)=1, one cannot use that column because 1−φ(c)=0.

2.1F1F2step 1.1step 1.2∎

Unit ambiguity. The source's invariance clause gives independence of admissible presentations and columns for the quotient, up to group-ring units, not a claim that the deleted determinants themselves differ by a unit when their denominators differ. In one variable these are the units ±tk of the polynomial convention. This proves exactly the asserted Fox computation and its normalization.

Remarks

The axis computation in The Burau determinant formula for a closed braid and its axis uses the axis meridian with its independent variable x≠1, hence is an admissible application. The absolute one-variable polynomial is fixed separately by the E0 convention; the multivariable specialization and its extra factor are stated explicitly in that consumer.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The coloured reduced Burau matrix

Definition

Let n≥2 and let σ1,…,σn−1 be the standard generators of Bn (The braid group by Artin presentation). Let β=∏r=1lσirεr∈Bn be a braid word. Labelling of the strings. Put the label tj on the string of β which starts at the point j at the bottom of the braid diagram, so that the labels are t1,…,tn read from the bottom left. Reading the letters of the word from left to right as the crossings from the top of the diagram, let ar be the label of the undercrossing string at crossing r, where for the positive generator σi the undercrossing string is the one entering the crossing at position i and for the negative generator σi−1 the one entering at position i+1; this is the convention of Morton §2.1, checked against his example β=σ1σ2−1σ1σ2−1σ1σ2−1σ3∈B4, where a1,…,a7=t1,t4,t2,t1,t4,t2,t4.

The matrices. For 1≤i≤n−1 and a label a let C‾i(a) be the (n−1)×(n−1) matrix over the Laurent ring Z[a±1] which agrees with the identity matrix (Invertible square matrices and similarity over a commutative ring) except that its i-th row has the three entries (C‾i(a))i,i−1=a,(C‾i(a))i,i=−a,(C‾i(a))i,i+1=1, where an entry is omitted when its column index lies outside {1,…,n−1}: for i=1 the entry a in column 0 is omitted and for i=n−1 the entry 1 in column n is omitted, so that for n>2 each boundary row has exactly two non-zero entries, while for n=2 the sole row is the single entry −a. Each C‾i(a) is upper triangular except for the single entry a in position (i,i−1), so det⁡C‾i(a)=−a is a unit of Z[a±1] and the matrix is invertible (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix); its inverse is the matrix whose i-th row has entries (C‾i(a)−1)i,i−1=1, (C‾i(a)−1)i,i=−a−1 and (C‾i(a)−1)i,i+1=a−1, again truncated at the boundary columns. This is Morton's matrix C‾i(a) (§2.1); the three places are the entries on row i produced by the Fox derivatives of the elementary braid, and the truncation rule is his.

The coloured reduced Burau matrix. The coloured reduced Burau matrix of the braid word is B‾β(t1,…,tn):=∏r=1l(C‾ir(ar))εr, the product taken in the order of the word, an element of GL⁡n−1(Z[t1±1,…,tn±1]). It is a direct matrix product, so no well-definedness issue beyond matrix multiplication arises; the chosen word enters only through the labels ar.

Equal labels and conventions. Specialising t1=⋯=tn=t gives Morton's equal-label matrix B‾β(t,…,t) over Λ1=Z[t±1]. For comparison with the topological representation, assume AC, as in The reduced Burau representation and The Axiom of Choice. Put D=diag⁡(t,t2,…,tn−1). The fixed adjacent weighted basis of that representation is bi=ti(hi−hi+1) with hn=0. Its generator matrix has row i entries 1,−t,t, truncated at the boundary, by The topological and matrix Burau representations agree. Diagonal conjugation of the displayed row t,−t,1 gives these entries, so ρˉn(σi)=D−1C‾i(t)D,ρˉn(β)=D−1B‾β(t,…,t)D. Consequently det⁡(I−B‾β(t,…,t))=det⁡(I−ρˉn(β)). These identities concern equal labels; the labelled matrix remains defined algebraically for the chosen word without a Choice assumption.

Remarks

  • The determinant of each C‾i(a) is −a, so det⁡B‾β=(−1)l∏rarεr for a word of length l, a monomial in the labels; in particular the coloured matrix is invertible over Z[t1±1,…,tn±1].
  • Morton's matrices act on column vectors with the product ordered as the word, exactly as displayed; no inverse order is taken. At equal labels the generator matrix C‾i(t) has the same characteristic polynomial (λ−1)n−2(λ+t) as the reduced Burau generator. The determinant comparison for arbitrary braid words follows from simultaneous conjugacy by the fixed matrix D, rather than from the characteristic polynomials of individual generators alone.
DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The HOMFLYPT polynomial from the Hecke Markov trace

Definition

Assume AC for the arbitrary-braid closure convention. Let R be the coefficient ring of The HOMFLYPT coefficient ring with its elements v,z,s,u,l,m and the relations s2=v, u2=z−/z, l=us, m=s−s−1, and let β∈Bn with closure β^ (The closure of a geometric braid). Write e(β) for the exponent sum of The exponent sum of a braid, πn:Bn→H(n)× for the homomorphism of The Hecke generators satisfy the Artin relations and are units, and tr⁡n for the Ocneanu trace of The Ocneanu Markov trace exists and is unique. The HOMFLYPT polynomial from the Hecke Markov trace is P(β^):=ue(β) α n−1 tr⁡n(πn(β))∈R,α:=(uz)−1, for n≥1. For the empty link, the closure of the unique braid in B0, set P(∅):=α−1=uz separately; no tr⁡0 is used. In the localization R[m−1], the identity l−1−l=mα from The HOMFLYPT coefficient ring gives α=l−1−lm,u=l s−1. Thus the image of P(β^) in R[m−1] is ue(β)(l−1−lm)n−1tr⁡n(πn(β)).

Well-formedness. e(β) and πn(β) depend only on the braid element, not on the chosen Artin word, and tr⁡n(πn(β)) lies in Λ and is mapped to R by the coefficient-ring structure map; u and α are elements of R, with u a unit, so the displayed product is a well-defined element of R.

Caveats. The construction as displayed is a function on braids on a fixed number of strands; it depends on the braid representative a priori, and the statement that it is independent of the representative of an oriented link is the content of The Hecke trace construction is an oriented link invariant ↗, not of this definition. The coefficient ring R is the formal localised ring of The HOMFLYPT coefficient ring; the normalisation α=(uz)−1 is the one that makes the two Markov stabilisations scale by the same factor, as proved in clauses (2)-(3) of that invariance theorem.

Facts & Assumptions

Given: AC (The Axiom of Choice), the coefficient ring R of The HOMFLYPT coefficient ring, an integer n≥1, a braid β∈Bn and its closure β^. AC implies countable choice (AC implies DC implies countable choice), the hypothesis used by the arbitrary-braid closure convention in The closure of a geometric braid; the trace formula itself is algebraic.

[F1]

R is a commutative Λ=Z[v±1,z]-algebra; v,z,u,s,l are units, s2=v, u2=z−/z with z−=v−1(z+1−v), m=s−s−1, and l−1−l=m(uz)−1 (The HOMFLYPT coefficient ring). In R[m−1] one may divide this identity by m.

[F2]

The exponent sum e:Bn→Z is the unique homomorphism with e(σi)=1, and for every Artin word β=σi1ε1⋯σikεk one has e(β)=∑rεr independently of the word (The exponent sum of a braid).

[F3]

The assignment σi↦Ti induces a group homomorphism πn:Bn→H(n)× with πn(σi1ε1⋯σikεk)=Ti1ε1⋯Tikεk for every Artin word (The Hecke generators satisfy the Artin relations and are units).

[F4]

The Ocneanu trace is a family of Λ-linear maps tr⁡n:H(n)→Λ satisfying (M1)--(M4), and it satisfies tr⁡n+1(xTny)=ztr⁡n(xy) for all x,y∈H(n) (The Ocneanu Markov trace exists and is unique); in particular tr⁡n(πn(β))∈Λ, with its image used in R.

[F5]

The closure β^ of a braid β∈Bn is an oriented link in S3 (The closure of a geometric braid).

Proof

1.1F1F2F3F4

Well-formedness of the factors. By [F2] the integer e(β) depends only on the element β; by [F3] the element πn(β)∈H(n)× depends only on β and not on the Artin word; by [F4] the trace of that element lies in Λ and has a specified image in R. The elements u and α=(uz)−1 of R exist because u and z are units of R by [F1]. Hence the product ue(β)αn−1tr⁡n(πn(β)) is a well-defined element of R, and it is computed from β alone, not from a word.

1.2F1algebra

The identities in the (l,m) variables. By [F1] one has l−1−l=m(uz)−1=mα. In the localization R[m−1] this gives α=(l−1−l)/m. Also l=us and s is a unit, so u=ls−1. Substituting these into the definition gives the displayed formula for the image of P in that localization.

2.1F1F2F3F5step 1.1∎

Dependence on the representative. The closure β^ is defined for every braid β∈Bn by [F5]; the definition produces an element P(β^)∈R for each braid, and no claim that two braids with isotopic closures give the same value is made here: that is exactly the statement proved in The Hecke trace construction is an oriented link invariant ↗. At n=0, the separate value α−1 exists because u,z are units; no stabilization starts at B0.

Remarks

  • The coefficient form in R[m−1] is used by The HOMFLYPT skein relation; the skein identity itself holds already in R.

  • The normalisation α=(uz)−1 is forced by the two Markov moves: the positive stabilisation multiplies the trace by z and the negative one by z−, and the two relations uαz=1 and u2=z−/z of The HOMFLYPT coefficient ring are precisely what make the two normalising factors uαz and u−1αz− equal to 1; see The Hecke trace construction is an oriented link invariant ↗.

  • The unknot is the closure of 1∈B1 and has P=1 because tr⁡1(1)=1 by (M1); the empty product n−1=0 contributes α0=1.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The Burau determinant formula for a closed braid and its axis

Statement

Assume the Axiom of Choice (The Axiom of Choice) for the Alexander-module convention. Let n≥2, let β∈Bn with closure β^⊂S3 and braid axis A⊂S3, so that β^∪A is an oriented link (The closure of a geometric braid); let B‾β(t1,…,tn) be the coloured reduced Burau matrix of The coloured reduced Burau matrix and put Bβ(t):=B‾β(t,…,t) for its equal-label specialisation. Then:

(1) [Morton] the multivariable Alexander invariant of β^∪A satisfies Δβ^∪A(t1,…,tn,x)≐det⁡(I−x B‾β(t1,…,tn)) with the identifications tπ(j)=tj forced by the permutation π of β, where x is the axis variable and ≐ means equality up to multiplication by a unit of the Laurent ring Z[t1±1,…,tn±1,x±1];

(2) [deletion of the axis] with the same identifications tπ(j)=tj, the Torres--Fox deletion of the axis gives the multivariable invariant of the closed braid, Dβ^mv(t1,…,tn)≐det⁡(I−B‾β(t1,…,tn))1−t1t2⋯tn, and in the one-variable specialisation t1=⋯=tn=t the one-variable Alexander polynomial of The Alexander polynomial from the zeroth elementary ideal satisfies Δβ^(t)≐(1−t)det⁡(I−Bβ(t))1−tn; Here Dmv is Morton's multivariable invariant, a fraction for a knot. Its equal-label specialization satisfies Dβ^mv(t,…,t)≐Δβ^(t)/(1−t) for any number of components; when there is more than one component it differs from the library's Dβ^=Δβ^ by the factor 1−t. For a knot (π an n-cycle) the polynomial equals det⁡(I−Bβ(t))/(1+t+⋯+tn−1) up to units, and for a link with k components the identifications leave one variable per cycle and the same formulas hold, with the library's Alexander invariant Dβ^=Δβ^/(1−t) for a knot and Dβ^=Δβ^ for k>1. All formulas are stated up to multiplication by a unit ±tm (and ±tim in the multivariable case) of the corresponding Laurent ring.

Facts & Assumptions

Given: AC and an integer n≥2, a braid β∈Bn with closure β^ and braid axis A, the coloured reduced Burau matrix B‾β(t1,…,tn), and the equal-label specialisation Bβ(t). AC is inherited from the Alexander module; the finite Fox-determinant manipulations use no further choice.

[F1]

Literature input: diagram presentation. Use the bottom meridians u1,…,un of Morton's Figure 2 and their reverse partial products g0=1, gi=ui⋯u1. For a crossing, let Γi send ui to ui+1 and ui+1 to ui+1uiui+1−1, fixing the other meridians. For the word β=σi1ε1⋯σilεl read from the top, successive substitutions express the top meridians in the bottom generators by Tβ=Γilεl∘⋯∘Γi1ε1. Gluing the two disk slices gives the complement presentation with generators g1,…,gn,c and relations Tβ(gi)=c−1gic, where c is the axis meridian; φ(uj)=tj and φ(c)=x. This diagram presentation is the quoted topological input of Morton's proof of Theorem 1, printed pp. 4–6 (van Kampen, Seifert–van Kampen identifies the fundamental group with a group pushout). The substitutions here use moving disk slices; they are not the ordinary-composition automorphism of Artin automorphisms of the free group. No equality between those two word actions is assumed.

[F2]

Fox calculus. For a free basis g1,…,gn, ∂gk/∂gj=δkj, ∂(vw)/∂gj=∂v/∂gj+v ∂w/∂gj, and ∂(v−1)/∂gj=−v−1∂v/∂gj. Writing J(U)ij=∂U(gi)/∂gj, ordinary function composition satisfies J(U∘V)=U(J(V))J(U), with U applied entrywise to group-ring coefficients. These are the free-derivative rules used in Morton's proof, printed pp. 5–6. They give a product in word order for the successive-substitution action of [F1], not for the library's ordinary Artin word action.

[F3]

The deficiency-one Fox rule of The deficiency-one Fox calculus rule for the Alexander invariant: deleting the column of a generator c with φ(c)≠1 and dividing the determinant of the remaining square matrix by 1−φ(c) gives the evaluation of the Alexander invariant, up to a unit of Z[H].

[F4]

The coloured reduced Burau matrix of The coloured reduced Burau matrix is the matrix product of the C‾i(ar)±1 along an Artin word, with ar the label of the undercrossing string at crossing r; each factor is invertible with determinant −a if the label is a. At equal labels t1=⋯=tn=t the specialisation is the standard reduced Burau matrix of The reduced Burau representation up to the fixed basis change of the coloured matrix; in particular the characteristic polynomials agree (Morton, Remark (1)).

[F5]

The one-variable Alexander polynomial ΔL and the Alexander invariant DL=ΔL for a link with more than one component, DL=ΔL/(1−t) for a knot, of The Alexander polynomial from the zeroth elementary ideal, defined from the Alexander module of The one-variable Alexander module of an oriented link; the one-variable module is the cover classified by the total linking homomorphism.

[F6]

Literature input (quoted). Torres--Fox deletion (Morton, Remark (2), printed p. 3): for a link L∪C with meridian of C replaced by 1, DL(t)=ΔL∪C(t,1)/(1−φ(c)), where φ(c) is the element represented by C in the complement of L; for the axis C=A one has φ(A)=t1t2⋯tn (Conway, Theorem 3.15 and its proof, where the same deletion is computed through the twisted chain complex).

[F7]

Literature input (quoted). Birman--Brendle, section 4.2 equation (15): for the closure b(X) of a braid X∈Bn the Alexander polynomial satisfies Δb(X)(t)=det⁡(ρˉ(X)−In−1)/(1+t+⋯+tn−1) up to the usual unit, where ρˉ is the reduced Burau representation; by Morton's Remark (1) the equal-label coloured matrix Bβ(t) is a matrix of that representation, so the same display reads Δβ^(t)≐(1−t)det⁡(I−Bβ(t))/(1−tn) up to sign. This one-variable normalization is the classical formula for knots and links and is quoted here; the identity between Bβ(t) and the matrix of the reduced Burau representation is verified in the next proposition on this page.

Proof

1.1F1givenalgebra

The diagram basis and elementary substitutions. The reverse partial products of [F1] are a free basis, since ui=gigi−1−1. Direct substitution gives Γi(gi)=gi+1gi−1gi−1 and Γi−1(gi)=gi−1gi−1gi+1; every other gj, including gn, is fixed. Thus [F1] supplies a deficiency-one presentation of the closed braid and axis, with n+1 generators and n relations. Deleting the column of c is admissible because φ(c)=x≠1.

2.1F1F2F4step 1.1algebra

The Jacobian product with transported labels. Put Γr=Γirεr and Sr=Γl∘⋯∘Γr, with Sl+1=id. Since Sr=Sr+1∘Γr, [F2] gives φ(J(Sr))=φ(Sr+1(J(Γr)))φ(J(Sr+1)). For a positive crossing, step 1.1 and the product rule give the exceptional row (gi+1gi−1,−gi+1gi−1,1), truncated at i=1; for a negative crossing the row is (1,−gi−1gi−1,gi−1gi−1). The suffix Sr+1 expresses the meridians immediately below crossing r in the bottom generators. Hence the positive coefficient is φ(Sr+1(ui+1))=ar, while the negative coefficient is φ(Sr+1(ui))−1=ar−1: these are precisely the undercrossing labels of [F4]. Their reduced blocks are C‾ir(ar)εr. Iterating the displayed recurrence therefore gives φ(J(Tβ))=B~β=(B‾βv01), with the leading factors in the defined word order. This calculation concerns Tβ of [F1].

3.1F1F2step 2.1algebra

The relation matrix. Differentiate Tβ(gi)−c−1gic with respect to the gj. The second term evaluates to x−1δij, so deleting the column of c leaves B~β−x−1In. Its block form in step 2.1 gives det⁡(B~β−x−1In)=(1−x−1)det⁡(B‾β−x−1In−1).

4.1F3step 1.1step 2.1step 3.1algebra

The Fox rule and the characteristic polynomial. Apply [F3] with the deleted generator c and the divisor 1−φ(c)=1−x, which cancels the explicit factor 1−x−1 up to the unit −x−1 of step 3.1: Δβ^∪A≐−x−1det⁡(B‾β−x−1In−1)≐det⁡(I−x B‾β), since det⁡(xB‾β−In−1)=(−1)n−1det⁡(I−xB‾β) and x is a unit. The variable identifications tπ(j)=tj are those of the closed braid: strings joined at the top and bottom carry the same meridian. This proves (1).

5.1F4F6F7step 4.1algebra

Deletion of the axis. Put x=1 and apply the Torres--Fox deletion of [F6] to the pair (β^,A) with φ(A)=t1t2⋯tn and the identifications tπ(j)=tj; part (1) at x=1 gives the multivariable identity Dβ^mv(t1,…,tn)≐det⁡(I−B‾β(t1,…,tn))/(1−t1t2⋯tn), the first display of (2). In the one-variable specialisation t1=⋯=tn=t the denominator becomes 1−tn and the coloured matrix becomes Bβ(t); the one-variable normalization Δβ^(t)≐(1−t)det⁡(I−Bβ(t))/(1−tn) is the quoted classical formula [F7], so the equal-label multivariable invariant is Δβ^(t)/(1−t), rather than the library's multi-component normalization D=Δ.

6.1F5F7step 5.1algebra∎

Knot and multi-component normalisations. Suppose first that π is an n-cycle, so that the closure is a knot. By [F5] the knot normalisation is D=Δ/(1−t), and using 1−tn=(1−t)(1+t+⋯+tn−1) gives Δβ^(t)≐det⁡(I−Bβ(t))/(1+t+⋯+tn−1), equivalently Dβ^(t)≐det⁡(I−Bβ(t))/(1−tn) up to units. If instead π has k disjoint cycles, the identifications tπ(j)=tj leave one variable per cycle, and the multivariable identity of step 5.1 is a k-variable statement; the one-variable formula of step 5.1 is the classical formula [F7] and requires no knot hypothesis, so it computes Δβ^ for a link as well, with Dβ^=Δβ^ for k>1 by [F5]. Thus for k>1 the latter is (1−t) times the equal-label specialization of Dmv, as explicitly stated; the same determinant formula for the polynomial retains its factor 1−t. This proves the displayed normalisations of (2).

Remarks

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The HOMFLYPT skein relation

Statement

Assume the Axiom of Choice. Let P be the oriented link invariant of The Hecke trace construction is an oriented link invariant, with coefficient ring R and variables l=us, m=s−s−1, v=s2 as in The HOMFLYPT coefficient ring. Let x,y be Artin words in the generators of Bn and 1≤i≤n−1, and let L+,L−,L0 be the oriented links represented by the closures of xσiy, xσi−1y and xy; these three braid words differ only at one crossing between the strands i,i+1, so the three link diagrams form a skein triple. Then l−1P(L+)−l P(L−)=m P(L0), and P(unknot)=1. Equivalently, in the normalisation of the trace tower, u−1P+−vu P−=(v−1)P0.

Facts & Assumptions

Given: AC (The Axiom of Choice), the invariant P of The Hecke trace construction is an oriented link invariant, a braid word xσiy in Bn and the corresponding skein triple (L+,L−,L0). The link-invariance assertion for P uses AC as recorded in its supplier; the skein computation itself is algebraic.

[F1]

P(L+)=ue(x)+e(y)+1αn−1tr⁡n(πn(xσiy)), P(L−)=ue(x)+e(y)−1αn−1tr⁡n(πn(xσi−1y)) and P(L0)=ue(x)+e(y)αn−1tr⁡n(πn(xy)), since all three words lie in Bn and α=(uz)−1 (The HOMFLYPT polynomial from the Hecke Markov trace, The exponent sum of a braid).

[F2]

Ti=vTi−1+(v−1) for every generator, and πn is multiplicative on words, so in H(n) πn(xσiy)=v πn(xσi−1y)+(v−1)πn(xy) (The Markov trace of an inverse Hecke generator, The Hecke generators satisfy the Artin relations and are units).

[F3]

tr⁡n is Λ-linear, so applying it to the identity of [F2] gives the corresponding relation between the three trace values (The Ocneanu Markov trace exists and is unique).

[F4]

l=us, m=s−s−1, s2=v, and (v−1)s−1=s−s−1=m in R (The HOMFLYPT coefficient ring).

[F5]

P(unknot)=1 (The Hecke trace construction is an oriented link invariant), and the closures of the three words represent the oriented links L+,L−,L0 of the statement (The closure of a geometric braid).

Proof

1.1F1F2F3

The trace identity. By [F2] and the Λ-linearity of the trace [F3], A:=vB+(v−1)C where A=tr⁡n(πn(xσiy)), B=tr⁡n(πn(xσi−1y)) and C=tr⁡n(πn(xy)) are the three trace values of [F1].

2.1F1step 1.1algebra

Normalisation. Multiply the identity of step 1.1 by ue(x)+e(y)αn−1 and use [F1]: u−1P(L+)=vu P(L−)+(v−1)P(L0), i.e. u−1P+−vuP−=(v−1)P0, the second displayed relation.

3.1F4F5step 2.1algebra∎

The (l,m) form. Divide the identity of step 2.1 by s and use [F4]: u−1s−1P+−vus−1P−=(v−1)s−1P0; here u−1s−1=(us)−1=l−1, vus−1=s2us−1=us=l because s2s−1=s, and (v−1)s−1=s−s−1=m. Hence l−1P+−lP−=mP0, which is the first displayed relation; the normalization P(unknot)=1 is [F5].

Remarks

  • The proof uses only the quadratic Hecke relation Ti=vTi−1+(v−1) and the linearity of the trace; no reduced or unreduced Burau matrix enters the skein relation, which is why the invariant is defined for all braids.
  • The variable dictionary is l=us, m=s−s−1, u2=z−/z; substituting z=z0=−1/(v+1), u=s turns the relation into the Jones skein relation of The Temperley-Lieb quotient and the Jones specialization.
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The Burau determinant recovers the Alexander polynomial of a closed braid

Statement

Assume AC. Let n≥2, let β∈Bn with closure β^, and let ρˉn:Bn⟶GL⁡n−1(Λ1),Λ1=Z[t±1], be the reduced Burau representation of The reduced Burau representation. Then the one-variable Alexander polynomial of β^ of The Alexander polynomial from the zeroth elementary ideal is given, up to multiplication by a unit ±tm of Λ1, by Δβ^(t)≐(1−t) det⁡(In−1−ρˉn(β))1−tn, and if β^ is a knot this equals det⁡(In−1−ρˉn(β))/(1+t+⋯+tn−1) up to units. In particular for n=2 and β=σ1m one has ρˉ2(σ1m)=(−t)m and Δσ1m^(t)≐(1−t)(1−(−t)m)1−t2, so for m=3 this is t2−t+1, the trefoil value. The formula computes the oriented link invariant Δβ^ from any braid representative of the link, with the stated unit ambiguity.

Facts & Assumptions

Given: an integer n≥2, a braid β∈Bn, its closure β^, the reduced Burau representation ρˉn and the coloured reduced Burau matrix B‾β(t1,…,tn) with equal-label specialisation Bβ(t). AC is inherited from the reduced Burau representation and Alexander-module suppliers.

[F1]

The reduced Burau module Mred is free with the auxiliary basis hj=εj−εn (hn=0), and ρˉn(β) is the action matrix in the fixed basis bj=tj(hj−hj+1), not in the h basis (The reduced Burau module is free of rank n minus one, The reduced Burau representation).

[F2]

The unreduced Burau matrices of The unreduced Burau matrices are the matrices Bi that are the identity outside rows and columns i,i+1, with block (1−tt10), acting on column vectors in the relative lifted-edge basis e1,…,en, and the topological action of Bn on U=H1(X~,p−1d;Z) in that basis is this matrix representation (The topological and matrix Burau representations agree).

[F3]

Mred is the kernel of the connecting map ∂∗:U→Λ1, and in the relative basis ∂∗(ei)=ti−1(t−1), so that the invariant covector is σ(ei)=ti−1 and Mred=ker⁡σ; the exact sequence 0→Mred→U→Λ1→Z→0 is Bn-equivariant, so the action on Mred is the restriction of the action on U. The level-0 class εi of the i-th lifted edge satisfies εi=t−(i−1)ei (The unreduced module fits an exact sequence with the reduced module, The unreduced Burau matrices, The reduced Burau module is free of rank n minus one).

[F4]

The coloured reduced Burau matrix at equal labels Bβ(t)=B‾β(t,…,t) is the product of the matrices C‾i(t)±1 of The coloured reduced Burau matrix along an Artin word for β, where C‾i(t) has i-th row entries t at (i,i−1), −t at (i,i) and 1 at (i,i+1), truncated at the boundary columns.

[F5]

The Burau determinant formula of The Burau determinant formula for a closed braid and its axis(2): in the one-variable specialisation the one-variable Alexander polynomial satisfies Δβ^(t)≐(1−t)det⁡(I−Bβ(t))/(1−tn), equivalently Dβ^(t)≐det⁡(I−Bβ(t))/(1−tn) for a knot; the identifications of the strand variables are those of the closed braid.

[F6]

Δβ^ is an invariant of the oriented link type of β^, well defined up to multiplication by a unit ±tm (The Alexander polynomial is an oriented link invariant, The Alexander polynomial from the zeroth elementary ideal).

Proof

1.1F1F2F3algebra

The generators in the reduced basis. Put hj:=εj−εn=t−(j−1)ej−t−(n−1)en for 1≤j≤n−1, the basis of [F1, F3]. For 1≤i≤n−2 the matrix of σi in this basis is the identity except for the block (1−t1t0) in rows and columns i,i+1; for i=n−1 it is the identity except for the last row (−1,−1,…,−1,−t). Both assertions are the finite computation Bihj=∑k(Ri)kjhk using Bihj∈ker⁡σ and the expression of the result in the basis h, carried out on the two or three vectors moved by Bi.

2.1F1F2F3F4step 1.1algebra

Conjugation with the equal-label matrices. Put P=In−1−S, where S is the subdiagonal shift, and D=diag⁡(t,t2,…,tn−1). The columns of Q=PD are the coordinates of the fixed basis bj=tj(hj−hj+1) in the auxiliary h basis, so ρˉn(σi)=Q−1RiQ. The matrices of step 1.1 satisfy RiP=PC‾i(t): for i<n−1 this is multiplication of the displayed two-row block; for i=n−1 the last row of RiP is zero before column n−2, then t−1,−t, as in PC‾i(t). At n=2 the identity is the scalar −t=−t. Hence ρˉn(σi)=D−1C‾i(t)D. Multiplying these identities, including inverses, along the word gives ρˉn(β)=D−1B‾β(t)D, and therefore det⁡(In−1−B‾β(t))=det⁡(In−1−ρˉn(β)). This also agrees with the frozen generator formulas of The topological and matrix Burau representations agree.

3.1F5F6step 2.1algebra

The Alexander formula. Substituting the determinant identity of step 2.1 into the formula of [F5] gives Δβ^(t)≐(1−t)det⁡(In−1−ρˉn(β))/(1−tn), which is the displayed formula. For a knot, dividing by 1−t and using 1−tn=(1−t)(1+t+⋯+tn−1) gives Dβ^(t)≐det⁡(In−1−ρˉn(β))/(1−tn), equivalently Δβ^(t)≐det⁡(In−1−ρˉn(β))/(1+t+⋯+tn−1), up to units. The right-hand side is computed from any braid representative of the link, while the left-hand side is the oriented link invariant of [F6]; this also shows that the right-hand side does not depend on the representative, up to the stated unit.

4.1F5step 1.1step 3.1algebra∎

The two-strand case. For n=2 the module Mred=ker⁡σ is one-dimensional with basis h1=e1−t−1e2 and, by step 1.1, ρˉ2(σ1)=−t; hence ρˉ2(σ1m)=(−t)m and the formula becomes Δσ1m^≐(1−t)(1−(−t)m)1−t2. For m=1 this is ≐1 (the unknot); for m=3 it is (1−t)(1+t3)1−t2=1+t31+t=t2−t+1, the trefoil value; and for m=2 the closure σ12^ has two components and the same display gives Δ≐(1−t)(1−t2)/(1−t2)=1−t, the one-variable Alexander polynomial of the Hopf link in the convention of [F5]. These computations prove the displayed specialisations of the statement.

Remarks

DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Temperley-Lieb quotient and the Jones specialization

Definition

Assume the Axiom of Choice for the link-invariance assertion below, via The Hecke trace construction is an oriented link invariant and its Markov-equivalence supplier. Let H(1)⊂H(2)⊂⋯ be the Hecke tower over Λ=Z[v±1,z] of The Markov trace on the type-A Hecke tower, with H(n) generated by T1,…,Tn−1 (The generic type-A Hecke algebra). For 1≤i≤n−2 let En(i):=∑w∈⟨si,si+1⟩Tw be the sum of the six standard-basis elements over the parabolic subgroup ⟨si,si+1⟩≅S3 inside H(n), and let J(n)⊂H(n) be the two-sided ideal generated by the elements En(i) for 1≤i≤n−2 (Left, right and two-sided ideals). The Temperley--Lieb quotient of the Hecke tower is the quotient algebra TL(n):=H(n)/J(n) (The quotient ring R/I with (r+I)(s+I)=rs+I). Put D:=Λ[(v+1)−1] and form HD(n):=D⊗ΛH(n) and TLD(n):=D⊗ΛTL(n). The normalized generators below are defined in these scalar extensions, where v+1 is a unit.

The Temperley--Lieb relations. In HD(n) put ei:=Ti+1v+1(1≤i≤n−1),λ:=v(v+1)2. Then ei2=ei and eiej=ejei for ∣i−j∣>1, while in the quotient TLD(n) one has eiei+1ei=λei,ei+1eiei+1=λei+1(1≤i≤n−2). These are Jones' Temperley--Lieb relations ei2=ei, eiei±1ei=λei, eiej=ejei for ∣i−j∣>1 with loop parameter λ. After adjoining s with s2=v to D, the elements fi:=(v+1)s−1ei=λ−1/2ei satisfy fi2=δfi,fifi+1fi=fi,fi+1fifi+1=fi+1,fifj=fjfi (∣i−j∣>1), with δ:=λ−1/2=v+1v1/2=s+s−1 when s2=v.

The Jones specialization. Let z0:=−1v+1 and let T:=Z[v±1,(v+1)−1,s]/(s2−v) be the ring in which v+1 is inverted and a square root s of v is adjoined. By the universal property of the coefficient ring R of The HOMFLYPT coefficient ring there is a unique unital ring homomorphism φ:R→T with v↦v,z↦z0,s↦s,u↦s; it sends α=(uz)−1↦−s2+1s. The Jones specialization of the invariant P of The HOMFLYPT polynomial from the Hecke Markov trace is V(β^):=φ(P(β^))=se(β)(−s2+1s)n−1tr⁡n(πn(β))∣z=z0∈T for β∈Bn with n≥1 and closure β^ (The closure of a geometric braid). Then V is an invariant of nonempty oriented links with V(unknot)=1 and s−2V(L+)−s2V(L−)=(s−s−1)V(L0) on every skein triple; in the variable t:=s2 this is the Jones skein relation t−1V+−tV−=(t1/2−t−1/2)V0, and V is the Jones polynomial in the convention of Birman--Brendle §4.3 property 6: positive σ13 has value t+t3−t4. Mirroring a link replaces t by t−1; the convention is fixed, rather than chosen separately for each computation. The separate empty-link extension of P specializes to V(∅)=−s/(s2+1) in T; that formal extension is outside the classical Jones-polynomial identification for nonempty links.

Caveats. The quotient TL(n) is defined over Λ, but the normalized generators and their displayed relations are in the base change TLD(n), since v+1 need not be a unit in Λ. No claim is made here that the Ocneanu trace on H(n) factors through the quotient map H(n)→TL(n); the quotient is recorded for the Temperley--Lieb relations (1), and the Jones invariant is defined as the specialization of the link invariant P, not as a trace on the quotient. What is proved below is the Markov normalization after scalar extension, namely tr⁡n+1+(xen)=z+1v+1tr⁡n+(x) for x∈HD(n), whose value at z0 is λ; this is Jones' Markov trace normalization for the Temperley--Lieb parameter τ=λ. The identification of V with the Jones polynomial uses the explicit Hecke-trace specialization in Birman--Brendle §4.3 property 6, quoted in [F6]. That source also supplies the relation on arbitrary oriented skein triples; the local skein supplier proves the braided triples.

Facts & Assumptions

Given: AC (The Axiom of Choice), the Hecke tower over Λ=Z[v±1,z], its scalar extension to D=Λ[(v+1)−1], the elements ei, the ideals J(n), the quotients TL(n) and TLD(n), the coefficient ring R and its specialization φ:R→T.

[F1]

H(n) is the Λ-algebra with generators T1,…,Tn−1 and relations Ti2=(v−1)Ti+v, TiTi+1Ti=Ti+1TiTi+1 and TiTj=TjTi for ∣i−j∣>1, with standard basis {Tw:w∈Sn} (The generic type-A Hecke algebra, The Markov trace on the type-A Hecke tower).

[F2]

A quotient ring is the universal ring in which the ideal is killed, and a two-sided ideal is closed under left and right multiplication (The quotient ring R/I with (r+I)(s+I)=rs+I, Left, right and two-sided ideals).

[F3]

The Λ-linear Ocneanu trace extends by scalar extension to tr⁡n+:HD(n)→D; for x∈HD(n) it satisfies tr⁡n+1+(xTn)=ztr⁡n+(x) and tr⁡n+1+(x)=tr⁡n+(x) (The Ocneanu Markov trace exists and is unique). Hence tr⁡n+1+(xen)=z+1v+1tr⁡n+(x); at z0=−1/(v+1) the factor is λ=v/(v+1)2.

[F4]

R has the universal property that unital ring homomorphisms R→T correspond to units v0,z0,u0,s0∈T× with s02=v0 and v0z0u02=z0+1−v0, and α=(uz)−1 in R (The HOMFLYPT coefficient ring).

[F5]

P is the well-defined link invariant of The Hecke trace construction is an oriented link invariant, with P(unknot)=1, and it satisfies l−1P+−lP−=mP0 for l=us, m=s−s−1 (The HOMFLYPT skein relation, The HOMFLYPT polynomial from the Hecke Markov trace).

[F6]

Literature input (quoted). The algebra TL(n,τ) with generators e1,…,en−1 and relations ei2=ei, eiei±1ei=τei, eiej=ejei for ∣i−j∣≥2 carries a Markov trace normalized by tr⁡(1)=1 and tr⁡(xen+1)=τtr⁡(x) for x∈TL(n+1,τ) (Jones, The Jones Polynomial, printed pp. 7-9). Birman--Brendle §4.3 defines the normalized Hecke-trace invariant P(l,m) (their equations preceding (18)) and asserts in property 6 that P(t,t1/2−t−1/2) is the Jones polynomial. Their equation (18) holds for arbitrary oriented skein triples. These are quoted source results for that specific trace construction, rather than an extension of the local braided-triple theorem or reliance on the inconsistent skein formula printed in Jones’ survey, p. 2.

Proof

1.1F1algebra

Idempotents. In HD(n), v+1 is a unit. From Ti2=(v−1)Ti+v of [F1], (Ti+1)2=(v+1)(Ti+1); dividing by (v+1)2 gives ei2=ei. The far-commutation eiej=ejei for ∣i−j∣>1 is inherited from TiTj=TjTi of [F1], since ei is a polynomial in Ti with coefficients in D.

1.2F1F2algebra

The three-strand relation. In HD(n), expanding (Ti+1)(Ti+1+1)(Ti+1) with [F1] gives En(i)+v(Ti+1)=En(i)+v(v+1)ei: the six standard-basis elements of the parabolic subgroup are 1,Ti,Ti+1,TiTi+1,Ti+1Ti,TiTi+1Ti, and substituting Ti2=(v−1)Ti+v leaves exactly v(Ti+1) in addition. Since (Ti+1)(Ti+1+1)(Ti+1)=(v+1)3eiei+1ei, this reads (v+1)3eiei+1ei=En(i)+v(v+1)ei; in TLD(n), where the class of En(i) is zero by [F2], it becomes eiei+1ei=v(v+1)2ei=λei. The mirrored computation gives ei+1eiei+1=λei+1.

1.3F4algebra

The specialization homomorphism. Take T as in the definition and put v0:=v, z0:=−1/(v+1), u0:=s, s0:=s in T. These are units by construction, s02=v=s2=v0, and v0z0u02=v⋅(−1/(v+1))⋅v=−v2/(v+1) while z0+1−v0=(−1+(v+1)(1−v))/(v+1)=−v2/(v+1); by the universal property of [F4] there is a unique unital ring homomorphism φ:R→T with these values, and it sends α=(uz)−1 to (s⋅(−1/(v+1)))−1=−(v+1)/s=−(s2+1)/s.

2.1F1step 1.1step 1.2algebra

Normalized generators. In the scalar extension of TLD(n) adjoining s with s2=v, put fi=(v+1)s−1ei=λ−1/2ei. Then fi2=λ−1ei=λ−1/2fi=δfi with δ=λ−1/2=(v+1)s−1=s+s−1, and fifi+1fi=λ−3/2eiei+1ei=λ−3/2λei=λ−1/2ei=fi, with the symmetric relation for fi+1fifi+1; far-commutation is inherited from step 1.1.

2.2F4F5step 1.3algebra

The Jones invariant. For β∈Bn with n≥1 put V(β^):=φ(P(β^)); this is exactly the displayed specialization because φ(u)=s and φ(v)=v=s2, and α to −(s2+1)/s. Since φ is a ring homomorphism and P is an invariant of oriented links by [F5], V is an invariant of oriented links with V(unknot)=φ(1)=1. Applying φ to the skein relation of [F5] and using φ(l)=s2, φ(m)=s−s−1 gives s−2V+−s2V−=(s−s−1)V0 on the braided triples supplied there, in the variable t=s2.

2.3F3F6step 1.2algebra

The Markov normalization on the tower. Extend the trace by scalar extension as in [F3]. For x∈HD(n), en=(Tn+1)/(v+1), so tr⁡n+1+(xen)=1v+1(tr⁡n+1+(xTn)+tr⁡n+1+(x))=z+1v+1tr⁡n+(x), and at z=z0 the factor is v(v+1)2=λ. This matches the Markov normalization with parameter τ=λ in [F6]; it does not assert descent of the Ocneanu trace to TLD(n).

3.1F4F5F6step 1.3step 2.2algebra∎

Identification and arbitrary skein triples. The ring T is Z[s±1,(s2+1)−1] by eliminating v=s2, hence injects into Q(s). In the source normalization of [F6], set its Hecke parameter to v=s2 and its rescaling parameter to κ=s2; then its generator rescaling is κ=s and its trace parameter is −(1−v)/(1−κv)=−1/(v+1)=z0. Its strand factor is −κ−1/2(1−κv)/(1−v)=−(v+1)/s, exactly step 1.3. Thus our V is the image of the same source trace construction with l=κv=s2 and m=s−s−1. Property 6 identifies this with the Jones polynomial, and source equation (18) gives the stated relation for every oriented skein triple. The identities hold in T since both sides lie in T and its embedding into Q(s) is injective. The mirror substitution is the source chirality rule P(l−1,−m), which here is s↦s−1.

Remarks

  • The rescaling in the definition is the correct one: with fi=λ−1ei the three-strand relation would give fifi+1fi=λ−1fi, not fi; the square root λ−1/2 (equivalently v1/2) is necessary, and it exists in the Jones specialization ring T.
  • The classical normalization of the Temperley--Lieb loop value is δ=s+s−1 with s2=v, in agreement with λ−1/2=(v+1)/v1/2.
  • The two-strand example The Jones specialization of a two-strand closure ↗ and the three-crossing skein example The Hecke trace skein calculation for a three-crossing braid ↗ compute V explicitly from this definition.

5 · Examples, counterexamples and false statements

None yet.

Sources