Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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.

A real affine-Hecke parameter greater than one has infinite quantum characteristic

Statement

Let q>1 be a real affine-Hecke parameter, viewed as an element of C×, and let ξ≠1 be a root of unity in C. With quantum characteristic as in The quantum characteristic of an invertible Hecke parameter, e(C,q)=∞ and e(C,ξ) is the finite multiplicative order of ξ. In particular q≠ξ. The statement compares scalar parameter regimes; it asserts no isomorphism, Morita equivalence, or classification relation between the corresponding algebras.

Facts & Assumptions

Given: q∈R, q>1, and a root of unity ξ∈C× with ξ≠1.

[F1]

The quantum characteristic is the least integer e≥2 for which 1+u+⋯+ue−1=0, and is ∞ if no such integer exists. If u≠1, finite e exists exactly when u is a root of unity, and then it is its multiplicative order (The quantum characteristic of an invertible Hecke parameter).

Proof

Given: The scalars q and ξ above.

1.1F1givenalgebra

For every integer n≥2, 1+q+⋯+qn−1 is a sum of positive real numbers and is therefore positive. No finite n satisfies the defining vanishing condition in [F1], so e(C,q)=∞.

2.1F1givenstep 1.1algebra∎

Since ξ≠1, the identity (1−ξ)(1+ξ+⋯+ξn−1)=1−ξn shows that the geometric sum vanishes exactly when ξn=1. Its least such positive exponent is the multiplicative order, which is at least 2; hence [F1] gives e(C,ξ)=ord⁡(ξ)<∞. Also ∣ξ∣=1 while ∣q∣=q>1, so q≠ξ.

Depends on

Used by

Dependency tree · two levels

4 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