Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Rank-one Hecke multiplication in both normalizations

Example

Let S={s} with m(s,s)=1, so that W={1,s}≅Z/2 with ℓ(1)=0 and ℓ(s)=1 (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). The odd-edge graph has one vertex and one component, so R=Z[v±1] with v:=vs is the coefficient ring of Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy, and H is the quotient of the free associative R-algebra R⟨Ts⟩ by the single relation (Ts−v)(Ts+v−1)=0.

  1. Normalized table. {1,Ts} is an R-basis of H (The standard basis of the generic Hecke algebra and base change), and 1⋅1=1,1⋅Ts=Ts=Ts⋅1,Ts2=(v−v−1)Ts+1, equivalently (Ts−v)(Ts+v−1)=0. Moreover Ts−1=Ts−(v−v−1), so Ts−1Ts=TsTs−1=1 (The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization).

  2. Multiplicative table. Put Q:=v2 and Ss:=vTs. Then {1,Ss} is again an R-basis, Ss is a unit, and 1⋅1=1,1⋅Ss=Ss=Ss⋅1,Ss2=(Q−1)Ss+Q, equivalently (Ss−Q)(Ss+1)=0; indeed Ss−1=Q−1(Ss+1−Q).

  3. Conversion. The two tables are interconverted by Ss=vTs, Ts=v−1Ss: substituting in Ts2=(v−v−1)Ts+1 gives v−2Ss2=(1−v−2)Ss+1, i.e. Ss2=(Q−1)Ss+Q; conversely Ts2=v−2Ss2=v−2((Q−1)Ss+Q)=(v−v−1)Ts+1. In particular R is a domain, both bases persist after every base change by The standard basis of the generic Hecke algebra and base change, part 4, and no choice or finiteness hypothesis beyond ∣S∣=1 is used.

Facts & Assumptions

Given: The one-element generator set S={s}, the group W={1,s}, the Laurent ring R=Z[v±1] and the algebra H=R⟨Ts⟩/((Ts−v)(Ts+v−1)).

[F1]

R=ΛZ,1 is a commutative ring in which v is a unit, H is presented by the generator Ts and the single quadratic relation (Ts−v)(Ts+v−1)=0, and each vs is a unit; there are no braid relations because ∣S∣=1. (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy)

[F2]

For S={s} the presentation of W has the single generator s and the relation s2=1. Its universal property extends any assignment of s to an involution in a group, and ℓ is the least word length. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups)

[F3]

{Tw:w∈W} is an R-basis of H, and after base change along any ring homomorphism the specialized family is an R′-basis; in particular T1=1 and {1,Ts} is a basis. (The standard basis of the generic Hecke algebra and base change)

[F4]

Ts is a unit with Ts−1=Ts−(v−v−1); with Qs=vs2 and Ss=vsTs, the element Ss is a unit, Ts=vs−1Ss, and (Ss−Qs)(Ss+1)=0. (The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization)

[F5]

The integers are a commutative ring (The integers form a commutative ring) with no zero divisors (The integers have no zero divisors; multiplicative cancellation), and 0≠1 because the natural-number embedding is injective (The naturals embed in the integers). Thus Z is an integral domain, and the Laurent construction over a domain makes ΛZ,1=Z[v±1] an integral domain (Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields, part 2).

Verification

technique · direct
1.1F1F2F3F4

By [F2] every word in the single generator reduces using s2=1 to 1 or s. The assignment s↦−1 extends by the universal property to a homomorphism W→{±1}, so s≠1; thus W={1,s} and the reduced expressions are the empty word and the one-letter word s, with lengths 0 and 1; by [F3] the family {T1,Ts} is an R-basis of H and T1=1 is the empty product. The unit axioms give 1⋅Ts=Ts=Ts⋅1, and expanding (Ts−v)(Ts+v−1)=0 from [F1] gives Ts2=(v−v−1)Ts+1; the inverse formula Ts−1=Ts−(v−v−1) and Ts−1Ts=TsTs−1=1 are [F4]. This is the normalized table of part 1.

1.2F1F3F4algebra

Put Q:=v2 and Ss:=vTs. Since v is a unit of R ([F1]) and multiplication by it is an invertible R-linear map, {1,Ss} is again an R-basis of H ([F3]); Ss is a unit with Ss−1=v−1Ts−1 as a product of units ([F4]). Multiplying Ts2=(v−v−1)Ts+1 by v2 gives Ss2=v(v−v−1)Ss+v2=(Q−1)Ss+Q, because v(v−v−1)=v2−1=Q−1; equivalently (Ss−Q)(Ss+1)=Ss2+(1−Q)Ss−Q=0. Finally Ss(Ss+1−Q)=Ss2+Ss−QSs=((Q−1)Ss+Q)+Ss−QSs=Q, so Ss−1=Q−1(Ss+1−Q). This is the multiplicative table of part 2.

2.1F3F4F5step 1.1step 1.2∎

The two tables are interconverted by Ss=vTs and Ts=v−1Ss ([F4]). Substituting Ts=v−1Ss into Ts2=(v−v−1)Ts+1 gives v−2Ss2=(v−v−1)v−1Ss+1, and multiplying by the unit v2 gives Ss2=v(v−v−1)Ss+v2=(Q−1)Ss+Q; conversely, substituting Ss=vTs into Ss2=(Q−1)Ss+Q and multiplying by v−2 returns Ts2=(v−v−1)Ts+1. The ring R=Z[v±1] is a domain by [F5], both bases persist under every base change by [F3], and no choice is used: all identities are explicit polynomial identities in v involving no selection. This completes the conversion of part 3 and with 1.1 and 1.2 all three parts of the example.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

63 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