Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Distinct rank-one q-affine substitutions are linearly independent

Statement

Let G be the group of substitutions of K[z,z−1] generated by s0,s1,π from The rank-one root datum and parameter conventions for DAHA. If g1,…,gN∈G are distinct and f1,…,fN∈K(z) satisfy

∑j=1Nfj(z) gj(h)(z)=0for every h∈K[z,z−1],

then every fj is zero. This holds over K=Q(q,t) because q is indeterminate; it is not asserted when distinct translations collapse at a root of unity.

Facts & Assumptions

Given: The field K=Q(q,t), the Laurent variable z, and the substitutions s0(z)=q−2z−1, s1(z)=z−1, and π(z)=q−1z−1.

[F1]

The rank-one root datum and parameter conventions for DAHA: the extended affine substitutions act by z↦qrz or z↦qrz−1 for integers r, and q is an indeterminate.

Proof

1.1F1givenalgebra

Write γj=gj(z)∈K(z). Distinct elements of G give distinct γj: if the signs differ, one is a nonzero scalar multiple of z and the other of z−1; if the signs agree, equality would give qr=qs, hence r=s because q is indeterminate. Thus all differences γj−γi for i≠j are nonzero in K(z).

2.1step 1.1algebra∎

Apply the assumed operator relation to h=1,z,…,zN−1. The resulting linear system for (fj) has matrix (γjk)0≤k<N,1≤j≤N, whose determinant is the Vandermonde product ∏i<j(γj−γi)≠0 by step 1.1. The matrix is invertible over K(z), so every fj=0.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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