7. Hypergeometric motives
This chapter lists the LMFDB definitions in the category hgm. Each definition links back to its LMFDB knowl. mot.hodgevector and mot.width also belong here, although their ids put them in another LMFDB category.
Bézout determinant. (LMFDB)
The Bézout determinant of a hypergeometric motive H is the determinant of its Bézout matrix.
Depends on: Definition 7.2
Lean code for Definition7.1●2 declarations
Associated Lean declarations
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
def Hypergeometric.Parameters.bezoutDeterminant {d : ℕ} (P : Hypergeometric.Parameters d) : ℤ
def Hypergeometric.Parameters.bezoutDeterminant {d : ℕ} (P : Hypergeometric.Parameters d) : ℤ
The **Bézout determinant** of a hypergeometric family (LMFDB `hgm.bezout_determinant`): the determinant of its Bézout matrix.
-
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
theorem Hypergeometric.Parameters.bezoutDeterminant_eq {d : ℕ} (P : Hypergeometric.Parameters d) : P.bezoutDeterminant = (-1) ^ d.choose 2 * P.A.cyclotomicProd.resultant P.B.cyclotomicProd d d
theorem Hypergeometric.Parameters.bezoutDeterminant_eq {d : ℕ} (P : Hypergeometric.Parameters d) : P.bezoutDeterminant = (-1) ^ d.choose 2 * P.A.cyclotomicProd.resultant P.B.cyclotomicProd d d
**The Bézout determinant is the resultant up to sign**: it is `(-1)^(d(d-1)/2)` times the resultant of `Φ_A` and `Φ_B`.
-
Hypergeometric.Parameters.bezoutMatrix[complete] -
Hypergeometric.CuspIndex.cyclotomicProd[complete] -
Hypergeometric.CuspIndex.natDegree_cyclotomicProd[complete] -
Polynomial.bezoutMatrix[complete]
Bézout matrix of a hypergeometric motive. (LMFDB)
For a list of integers C=[c_1,\ldots, c_n] we associate the polynomial
\Phi_C(x) = \prod_{j=1}^n \Phi_{c_j}(x)
where \Phi_n(x) is the nth cyclotomic polynomial.
Given a hypergeometric motive with defining parameters A and B, its Bézout matrix is the Bézout matrix of \Phi_A(x) and \Phi_B(x) of degree \max(\deg \Phi_A(x), \deg \Phi_B(x)).
Depends on: Definition 1.1.1 Definition 7.8
Lean code for Definition7.2●4 declarations
Associated Lean declarations
-
Hypergeometric.Parameters.bezoutMatrix[complete]
-
Hypergeometric.CuspIndex.cyclotomicProd[complete]
-
Hypergeometric.CuspIndex.natDegree_cyclotomicProd[complete]
-
Polynomial.bezoutMatrix[complete]
-
Hypergeometric.Parameters.bezoutMatrix[complete] -
Hypergeometric.CuspIndex.cyclotomicProd[complete] -
Hypergeometric.CuspIndex.natDegree_cyclotomicProd[complete] -
Polynomial.bezoutMatrix[complete]
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
def Hypergeometric.Parameters.bezoutMatrix {d : ℕ} (P : Hypergeometric.Parameters d) : Matrix (Fin d) (Fin d) ℤ
def Hypergeometric.Parameters.bezoutMatrix {d : ℕ} (P : Hypergeometric.Parameters d) : Matrix (Fin d) (Fin d) ℤ
The **Bézout matrix** of a hypergeometric family with defining parameters `(A, B)` (LMFDB `hgm.bezout_matrix`): the Bézout matrix (LMFDB `alg.bezout_matrix`) of `Φ_A` and `Φ_B` of degree `max(deg Φ_A, deg Φ_B)`, which is the degree `d` (`Hypergeometric.CuspIndex.natDegree_cyclotomicProd`).
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
def Hypergeometric.CuspIndex.cyclotomicProd {d : ℕ} (c : Hypergeometric.CuspIndex d) : Polynomial ℤ
def Hypergeometric.CuspIndex.cyclotomicProd {d : ℕ} (c : Hypergeometric.CuspIndex d) : Polynomial ℤ
The polynomial `Φ_C = ∏_{c ∈ C} Φ_c` of a cusp-index `C`, the product of the cyclotomic polynomials of its entries (LMFDB `hgm.bezout_matrix`). -
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
theorem Hypergeometric.CuspIndex.natDegree_cyclotomicProd {d : ℕ} (c : Hypergeometric.CuspIndex d) : c.cyclotomicProd.natDegree = d
theorem Hypergeometric.CuspIndex.natDegree_cyclotomicProd {d : ℕ} (c : Hypergeometric.CuspIndex d) : c.cyclotomicProd.natDegree = d
**The polynomial `Φ_C` of a cusp-index of degree `d` has degree `d`.**
-
defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/BezoutMatrix.leancomplete
def Polynomial.bezoutMatrix.{u_1} {R : Type u_1} [CommRing R] (f g : Polynomial R) (n : ℕ) : Matrix (Fin n) (Fin n) R
def Polynomial.bezoutMatrix.{u_1} {R : Type u_1} [CommRing R] (f g : Polynomial R) (n : ℕ) : Matrix (Fin n) (Fin n) R
The **degree `n` Bézout matrix** of two polynomials `f` and `g` of degree at most `n` (LMFDB `alg.bezout_matrix`): the `n × n` matrix `(c_ij)` with `(f(x)g(y) − f(y)g(x))/(x − y) = ∑_{0 ≤ i, j < n} c_ij xⁱ yʲ` (`Polynomial.sub_mul_sum_bezoutMatrix`). The LMFDB knowl indexes the entries by `1 ≤ i, j ≤ n` and writes `c_ij xⁱ yʲ`, an off-by-one slip for the exponents `i - 1` and `j - 1`: the quotient has degree less than `n` in each variable. Its determinant is the resultant up to the sign `(-1)^(n(n-1)/2)` (`Polynomial.det_bezoutMatrix`).
-
Hypergeometric.Parameters.BezoutModule[complete] -
Hypergeometric.Parameters.bezoutMatrix[complete] -
Hypergeometric.Parameters.degree[complete] -
Hypergeometric.Parameters.degree_eq[complete] -
Hypergeometric.Parameters.bezoutDeterminant_ne_zero[complete] -
Hypergeometric.Parameters.card_bezoutModule[complete] -
Hypergeometric.CuspIndex.cyclotomicProd[complete] -
Polynomial.bezoutMatrix[complete]
Bézout module of a hypergeometric motive. (LMFDB)
The Bezout module of a hypergeometric motive M is the finite \mathbb{Z}-module whose relations matrix is the Bézout matrix B of M. In other words, it is the quotient \mathbb{Z}^d/B \mathbb{Z}^d, where d is the degree of M.
Depends on: Definition 7.2 Definition 7.9
Lean code for Definition7.3●8 declarations
Associated Lean declarations
-
Hypergeometric.Parameters.BezoutModule[complete]
-
Hypergeometric.Parameters.bezoutMatrix[complete]
-
Hypergeometric.Parameters.degree[complete]
-
Hypergeometric.Parameters.degree_eq[complete]
-
Hypergeometric.Parameters.bezoutDeterminant_ne_zero[complete]
-
Hypergeometric.Parameters.card_bezoutModule[complete]
-
Hypergeometric.CuspIndex.cyclotomicProd[complete]
-
Polynomial.bezoutMatrix[complete]
-
Hypergeometric.Parameters.BezoutModule[complete] -
Hypergeometric.Parameters.bezoutMatrix[complete] -
Hypergeometric.Parameters.degree[complete] -
Hypergeometric.Parameters.degree_eq[complete] -
Hypergeometric.Parameters.bezoutDeterminant_ne_zero[complete] -
Hypergeometric.Parameters.card_bezoutModule[complete] -
Hypergeometric.CuspIndex.cyclotomicProd[complete] -
Polynomial.bezoutMatrix[complete]
-
abbrevdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
abbrev Hypergeometric.Parameters.BezoutModule {d : ℕ} (P : Hypergeometric.Parameters d) : Type
abbrev Hypergeometric.Parameters.BezoutModule {d : ℕ} (P : Hypergeometric.Parameters d) : Type
The **Bézout module** of a hypergeometric family (LMFDB `hgm.bezout_module`): the `ℤ`-module `ℤ^d / B ℤ^d` with relations matrix the Bézout matrix `B`, where `d` is the degree. The knowl calls it finite: the Bézout determinant is nonzero, as `Φ_A` and `Φ_B` are coprime (`Hypergeometric.Parameters.bezoutDeterminant_ne_zero`), and the module has order `|det B|` (`Hypergeometric.Parameters.card_bezoutModule`), both in `LeanBridge.ForMathlib.NumberTheory.Hypergeometric.BezoutModuleFinite`.
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
def Hypergeometric.Parameters.bezoutMatrix {d : ℕ} (P : Hypergeometric.Parameters d) : Matrix (Fin d) (Fin d) ℤ
def Hypergeometric.Parameters.bezoutMatrix {d : ℕ} (P : Hypergeometric.Parameters d) : Matrix (Fin d) (Fin d) ℤ
The **Bézout matrix** of a hypergeometric family with defining parameters `(A, B)` (LMFDB `hgm.bezout_matrix`): the Bézout matrix (LMFDB `alg.bezout_matrix`) of `Φ_A` and `Φ_B` of degree `max(deg Φ_A, deg Φ_B)`, which is the degree `d` (`Hypergeometric.CuspIndex.natDegree_cyclotomicProd`).
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
def Hypergeometric.Parameters.degree {d : ℕ} (P : Hypergeometric.Parameters d) : ℕ
def Hypergeometric.Parameters.degree {d : ℕ} (P : Hypergeometric.Parameters d) : ℕ
The **degree** of a hypergeometric family with defining parameters `(A, B)` (LMFDB `hgm.degree`): `∑_{a ∈ A} φ(a)`, which equals `∑_{b ∈ B} φ(b)` (`Hypergeometric.Parameters.degree_eq_sum_totient_B`) and the index `d` of `P : Parameters d`. Its meaning as the dimension of the realisations of the motive is not available, as hypergeometric motives are not formalised. -
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
theorem Hypergeometric.Parameters.degree_eq {d : ℕ} (P : Hypergeometric.Parameters d) : P.degree = d
theorem Hypergeometric.Parameters.degree_eq {d : ℕ} (P : Hypergeometric.Parameters d) : P.degree = d
-
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModuleFinite.leancomplete
theorem Hypergeometric.Parameters.bezoutDeterminant_ne_zero {d : ℕ} (P : Hypergeometric.Parameters d) : P.bezoutDeterminant ≠ 0
theorem Hypergeometric.Parameters.bezoutDeterminant_ne_zero {d : ℕ} (P : Hypergeometric.Parameters d) : P.bezoutDeterminant ≠ 0
**The Bézout determinant of a hypergeometric family is nonzero**: up to sign it is the resultant of `Φ_A` and `Φ_B`, which are coprime over `ℚ` as `A` and `B` have no common entries.
-
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModuleFinite.leancomplete
theorem Hypergeometric.Parameters.card_bezoutModule {d : ℕ} (P : Hypergeometric.Parameters d) : Nat.card P.BezoutModule = P.bezoutDeterminant.natAbs
theorem Hypergeometric.Parameters.card_bezoutModule {d : ℕ} (P : Hypergeometric.Parameters d) : Nat.card P.BezoutModule = P.bezoutDeterminant.natAbs
**The Bézout module has order `|det B|`**, the absolute value of the Bézout determinant.
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/BezoutModule.leancomplete
def Hypergeometric.CuspIndex.cyclotomicProd {d : ℕ} (c : Hypergeometric.CuspIndex d) : Polynomial ℤ
def Hypergeometric.CuspIndex.cyclotomicProd {d : ℕ} (c : Hypergeometric.CuspIndex d) : Polynomial ℤ
The polynomial `Φ_C = ∏_{c ∈ C} Φ_c` of a cusp-index `C`, the product of the cyclotomic polynomials of its entries (LMFDB `hgm.bezout_matrix`). -
defdefined in LeanBridge/ForMathlib/LinearAlgebra/Matrix/BezoutMatrix.leancomplete
def Polynomial.bezoutMatrix.{u_1} {R : Type u_1} [CommRing R] (f g : Polynomial R) (n : ℕ) : Matrix (Fin n) (Fin n) R
def Polynomial.bezoutMatrix.{u_1} {R : Type u_1} [CommRing R] (f g : Polynomial R) (n : ℕ) : Matrix (Fin n) (Fin n) R
The **degree `n` Bézout matrix** of two polynomials `f` and `g` of degree at most `n` (LMFDB `alg.bezout_matrix`): the `n × n` matrix `(c_ij)` with `(f(x)g(y) − f(y)g(x))/(x − y) = ∑_{0 ≤ i, j < n} c_ij xⁱ yʲ` (`Polynomial.sub_mul_sum_bezoutMatrix`). The LMFDB knowl indexes the entries by `1 ≤ i, j ≤ n` and writes `c_ij xⁱ yʲ`, an off-by-one slip for the exponents `i - 1` and `j - 1`: the quotient has degree less than `n` in each variable. Its determinant is the resultant up to the sign `(-1)^(n(n-1)/2)` (`Polynomial.det_bezoutMatrix`).
Conductor of a hypergeometric motive. (LMFDB)
The exponents c_p in the conductor N = \prod_p p^{c_p} of a hypergeometric motive H(A,B,t) can be positive only if p is tame or wild for H(A,B,t).
Depends on: Definition 7.19 Definition 7.22 Definition 7.25
-
Hypergeometric.CuspIndex[complete] -
Hypergeometric.Parameters[complete] -
Nat.totient[complete]
Cusp index. (LMFDB)
A cusp-index of degree d is a weakly increasing
list of positive integers [u_1,\dots,u_k] with \sum_{i=1}^k \phi(u_i) = d.
Hypergeometric families H(A,B) are indexed by pairs
(A,B) of cusp-indices of a common degree having no common entries.
Tau Ceti Review: Nat.totient.
Lean code for Definition7.5●3 definitions
Associated Lean declarations
-
Hypergeometric.CuspIndex[complete]
-
Hypergeometric.Parameters[complete]
-
Nat.totient[complete]
-
Hypergeometric.CuspIndex[complete] -
Hypergeometric.Parameters[complete] -
Nat.totient[complete]
-
structuredefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/CuspIndex.leancomplete
structure Hypergeometric.CuspIndex (d : ℕ) : Type
structure Hypergeometric.CuspIndex (d : ℕ) : Type
A **cusp-index** of degree `d` (LMFDB `hgm.cusp_index`): a weakly increasing list `[u₁, …, u_k]` of positive integers with `φ(u₁) + ⋯ + φ(u_k) = d`, where `φ` is Euler's totient function. Being weakly increasing, the list is the sorted presentation of a multiset of positive integers, which is how the LMFDB knowl `hgm.familes` describes it.
Fields
toList : List ℕ
The entries `u₁ ≤ ⋯ ≤ u_k`.
sortedLE : self.toList.SortedLE
The entries are weakly increasing.
pos : ∀ u ∈ self.toList, 0 < u
The entries are positive.
sum_totient : (List.map Nat.totient self.toList).sum = d
The totients of the entries add up to the degree.
-
structuredefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/CuspIndex.leancomplete
structure Hypergeometric.Parameters (d : ℕ) : Type
structure Hypergeometric.Parameters (d : ℕ) : Type
The **defining parameters** `(A, B)` of a hypergeometric family `H(A, B)` of degree `d` (LMFDB `hgm.cusp_index`): two cusp-indices of degree `d` with no common entries. They are only the combinatorial index of the family; the family itself, a motive over `ℚ(t)`, is not formalised.
Fields
A : Hypergeometric.CuspIndex d
The cusp-index `A`.
B : Hypergeometric.CuspIndex d
The cusp-index `B`.
disjoint : self.A.toList.Disjoint self.B.toList
The cusp-indices `A` and `B` have no common entries.
-
defdefined in Mathlib/Data/Nat/Totient.leancomplete
def Nat.totient (n : ℕ) : ℕ
def Nat.totient (n : ℕ) : ℕ
Euler's totient function. This counts the number of naturals strictly less than `n` which are coprime with `n`.
p-part of defining parameters of a hypergeometric motive. (LMFDB)
For a hypergeometric motive with defining parameters [A, B] and a prime number p, we define the p-part [A_p, B_p] as follows.
For each u=a_i or b_j in A=(a_1,\ldots, a_m) and B=(b_1,\ldots, b_n) we write u=p^s v where p \nmid v. We replace u with \phi(v) copies of p^s, to get [A', B'], and then remove equal numbers of any overlapping elements between the multisets A' and B' to get A_p and B_p. We denote the list of these removed overlapping elements by C_p.
Depends on: Definition 7.8
Lean code for Definition7.6●5 declarations
Associated Lean declarations
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/DefiningParameterPPart.leancomplete
def Hypergeometric.Parameters.pPart {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : Hypergeometric.Parameters (P.pPartDegree p)
def Hypergeometric.Parameters.pPart {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : Hypergeometric.Parameters (P.pPartDegree p)
The **`p`-part** `[A_p, B_p]` (LMFDB `hgm.defining_parameter_ppart`) of the defining parameters `(A, B)` of a hypergeometric family, for a prime `p`: every entry `u = p^s v` of `A` and of `B`, with `p ∤ v`, is replaced by `φ(v)` copies of `p^s`, giving multisets `A'` and `B'`, and equal numbers of the elements common to `A'` and `B'` are removed, giving `A_p = A' - B'` and `B_p = B' - A'`. These are again defining parameters, of degree the totient sum of `A_p`, which is the degree of the family minus the totient sum of the removed elements `C_p` (`Hypergeometric.Parameters.pPartDegree_add_sum_totient_pPartCommon`).
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/DefiningParameterPPart.leancomplete
def Hypergeometric.Parameters.pPartCommon {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : Multiset ℕ
def Hypergeometric.Parameters.pPartCommon {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : Multiset ℕ
The **multiset `C_p`** (LMFDB `hgm.defining_parameter_ppart`) of the elements removed from the multisets `A'` and `B'` to form the `p`-part `[A_p, B_p]` of defining parameters `(A, B)`: the elements common to `A'` and `B'`, with the smaller of their two multiplicities.
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/DefiningParameterPPart.leancomplete
def Hypergeometric.CuspIndex.pPartMultiset {d : ℕ} (c : Hypergeometric.CuspIndex d) (p : ℕ) : Multiset ℕ
def Hypergeometric.CuspIndex.pPartMultiset {d : ℕ} (c : Hypergeometric.CuspIndex d) (p : ℕ) : Multiset ℕ
The multiset `A'` of the `p`-part (LMFDB `hgm.defining_parameter_ppart`) of a cusp-index `A`: every entry `u = p^s v` of `A`, with `p ∤ v`, replaced by `φ(v)` copies of `p^s`. For `p` not a prime, Mathlib's `u.factorization p` is `0`, and every `u` is replaced by `φ(u)` copies of `1`.
-
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/DefiningParameterPPart.leancomplete
theorem Hypergeometric.Parameters.pPart_A_add_pPartCommon {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : ↑(P.pPart p).A.toList + P.pPartCommon p = P.A.pPartMultiset p
theorem Hypergeometric.Parameters.pPart_A_add_pPartCommon {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : ↑(P.pPart p).A.toList + P.pPartCommon p = P.A.pPartMultiset p
**`A' = A_p + C_p`**: the multiset `A'` is the `p`-part `A_p` together with the removed common elements `C_p`.
-
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/DefiningParameterPPart.leancomplete
theorem Hypergeometric.Parameters.pPartDegree_add_sum_totient_pPartCommon {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : P.pPartDegree p + (Multiset.map Nat.totient (P.pPartCommon p)).sum = d
theorem Hypergeometric.Parameters.pPartDegree_add_sum_totient_pPartCommon {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : P.pPartDegree p + (Multiset.map Nat.totient (P.pPartCommon p)).sum = d
**The degree of the `p`-part** plus the totient sum of the removed common elements `C_p` is the degree of the family.
-
Hypergeometric.Parameters.primeToPPart[complete] -
Hypergeometric.CuspIndex.primeToPPartMultiset[complete] -
Hypergeometric.Parameters.coe_primeToPPart_A[complete] -
Hypergeometric.Parameters.ofMultisets[complete]
prime to p-part of defining parameters of a hypergeometric motive. (LMFDB)
For a hypergeometric motive with defining parameters [A, B] and a prime number p, we define the prime-to-p-part [A^p, B^p] as follows.
For each u=a_i or b_j in A=(a_1,\ldots, a_m) and B=(b_1,\ldots, b_n) we write u=p^s v where p \nmid v. We replace u with \phi(p^s) copies of v, to get [A', B'], and then remove equal numbers of any overlapping elements between the multisets A' and B' to get A^p and B^p.
Depends on: Definition 7.8
Lean code for Definition7.7●4 declarations
Associated Lean declarations
-
Hypergeometric.Parameters.primeToPPart[complete]
-
Hypergeometric.CuspIndex.primeToPPartMultiset[complete]
-
Hypergeometric.Parameters.coe_primeToPPart_A[complete]
-
Hypergeometric.Parameters.ofMultisets[complete]
-
Hypergeometric.Parameters.primeToPPart[complete] -
Hypergeometric.CuspIndex.primeToPPartMultiset[complete] -
Hypergeometric.Parameters.coe_primeToPPart_A[complete] -
Hypergeometric.Parameters.ofMultisets[complete]
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/DefiningParameterPPart.leancomplete
def Hypergeometric.Parameters.primeToPPart {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : Hypergeometric.Parameters (P.primeToPPartDegree p)
def Hypergeometric.Parameters.primeToPPart {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : Hypergeometric.Parameters (P.primeToPPartDegree p)
The **prime-to-`p` part** `[A^p, B^p]` (LMFDB `hgm.defining_parameter_primetoppart`) of the defining parameters `(A, B)` of a hypergeometric family, for a prime `p`: every entry `u = p^s v` of `A` and of `B`, with `p ∤ v`, is replaced by `φ(p^s)` copies of `v`, giving multisets `A'` and `B'`, and equal numbers of the elements common to `A'` and `B'` are removed, giving `A^p = A' - B'` and `B^p = B' - A'`. These are again defining parameters, of degree the totient sum of `A^p`.
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/DefiningParameterPPart.leancomplete
def Hypergeometric.CuspIndex.primeToPPartMultiset {d : ℕ} (c : Hypergeometric.CuspIndex d) (p : ℕ) : Multiset ℕ
def Hypergeometric.CuspIndex.primeToPPartMultiset {d : ℕ} (c : Hypergeometric.CuspIndex d) (p : ℕ) : Multiset ℕ
The multiset `A'` of the prime-to-`p` part (LMFDB `hgm.defining_parameter_primetoppart`) of a cusp-index `A`: every entry `u = p^s v` of `A`, with `p ∤ v`, replaced by `φ(p^s)` copies of `v`.
-
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/DefiningParameterPPart.leancomplete
theorem Hypergeometric.Parameters.coe_primeToPPart_A {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : ↑(P.primeToPPart p).A.toList = P.A.primeToPPartMultiset p - P.B.primeToPPartMultiset p
theorem Hypergeometric.Parameters.coe_primeToPPart_A {d : ℕ} (P : Hypergeometric.Parameters d) (p : ℕ) : ↑(P.primeToPPart p).A.toList = P.A.primeToPPartMultiset p - P.B.primeToPPartMultiset p
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/DefiningParameterPPart.leancomplete
def Hypergeometric.Parameters.ofMultisets (A' B' : Multiset ℕ) (hA : ∀ u ∈ A', 0 < u) (hB : ∀ u ∈ B', 0 < u) (h : (Multiset.map Nat.totient A').sum = (Multiset.map Nat.totient B').sum) : Hypergeometric.Parameters (Multiset.map Nat.totient (A' - B')).sum
def Hypergeometric.Parameters.ofMultisets (A' B' : Multiset ℕ) (hA : ∀ u ∈ A', 0 < u) (hB : ∀ u ∈ B', 0 < u) (h : (Multiset.map Nat.totient A').sum = (Multiset.map Nat.totient B').sum) : Hypergeometric.Parameters (Multiset.map Nat.totient (A' - B')).sum
The defining parameters obtained from two multisets `A'` and `B'` of positive integers with the same totient sum by removing equal numbers of their common elements: the cusp-indices with the entries of `A' - B'` and of `B' - A'`, which have no common entries, of degree the totient sum of `A' - B'`.
-
Hypergeometric.Parameters[complete] -
Hypergeometric.CuspIndex.fractions[complete] -
Hypergeometric.Parameters.gammaVector[complete] -
Hypergeometric.gammaRatFunc[complete] -
Hypergeometric.CuspIndex.length_fractions[complete] -
Hypergeometric.CuspIndex.map_cyclotomicProd_eq_prod_exp[complete] -
Hypergeometric.Parameters.gammaRatFunc_gammaVector[complete] -
Hypergeometric.Parameters.eq_gammaVector[complete] -
Hypergeometric.Parameters.algebraMap_div_eq_prod_gammaExponent[complete]
Defining parameters of a hypergeometric motive. (LMFDB)
A hypergeometric motive H(A,B,t) in M(\Q,\Q) is described by a hypergeometric family H(A,B) in M(\Q(t),t) along with a specialization point t \in \Q^\times. Here, A and B are disjoint multisets of positive integers and are the defining parameters of the hypergeometric family; they are subject to a constraint that
\sum_{a \in A} \phi(a) = \sum_{b \in B} \phi(b);
this common value is the degree of the family. The value t along with A and B are the defining parameters of the hypergeometric motive H(A,B,t).
The list \alpha is obtained from A by replacing each a \in A with the list of all elements of \Q \cap (0,1] with denominator a, then sorting into ascending order; the list \beta is obtained from B by the same procedure. Both \alpha and \beta have length equal to the degree.
The list \gamma of nonzero integers in ascending order is characterized by the property
\frac{\prod_{g \in \gamma, g>0} (x^g-1)}{\prod_{g \in \gamma,g<0} (x^{-g}-1)} = \frac{\prod_{a \in \alpha} (x - e^{2 \pi i a})}{\prod_{b \in \beta} (x - e^{2\pi i b})} = \frac{\prod_{a \in A} \Phi_a(x)}{\prod_{b \in B} \Phi_b(x)}
where \Phi_n(x) denotes the n-th cyclotomic polynomial.
Depends on: Definition 7.10
Lean code for Definition7.8●9 declarations
Associated Lean declarations
-
Hypergeometric.Parameters[complete]
-
Hypergeometric.CuspIndex.fractions[complete]
-
Hypergeometric.Parameters.gammaVector[complete]
-
Hypergeometric.gammaRatFunc[complete]
-
Hypergeometric.CuspIndex.length_fractions[complete]
-
Hypergeometric.CuspIndex.map_cyclotomicProd_eq_prod_exp[complete]
-
Hypergeometric.Parameters.gammaRatFunc_gammaVector[complete]
-
Hypergeometric.Parameters.eq_gammaVector[complete]
-
Hypergeometric.Parameters.algebraMap_div_eq_prod_gammaExponent[complete]
-
Hypergeometric.Parameters[complete] -
Hypergeometric.CuspIndex.fractions[complete] -
Hypergeometric.Parameters.gammaVector[complete] -
Hypergeometric.gammaRatFunc[complete] -
Hypergeometric.CuspIndex.length_fractions[complete] -
Hypergeometric.CuspIndex.map_cyclotomicProd_eq_prod_exp[complete] -
Hypergeometric.Parameters.gammaRatFunc_gammaVector[complete] -
Hypergeometric.Parameters.eq_gammaVector[complete] -
Hypergeometric.Parameters.algebraMap_div_eq_prod_gammaExponent[complete]
-
structuredefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/CuspIndex.leancomplete
structure Hypergeometric.Parameters (d : ℕ) : Type
structure Hypergeometric.Parameters (d : ℕ) : Type
The **defining parameters** `(A, B)` of a hypergeometric family `H(A, B)` of degree `d` (LMFDB `hgm.cusp_index`): two cusp-indices of degree `d` with no common entries. They are only the combinatorial index of the family; the family itself, a motive over `ℚ(t)`, is not formalised.
Fields
A : Hypergeometric.CuspIndex d
The cusp-index `A`.
B : Hypergeometric.CuspIndex d
The cusp-index `B`.
disjoint : self.A.toList.Disjoint self.B.toList
The cusp-indices `A` and `B` have no common entries.
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/Weight.leancomplete
def Hypergeometric.CuspIndex.fractions {d : ℕ} (c : Hypergeometric.CuspIndex d) : List ℚ
def Hypergeometric.CuspIndex.fractions {d : ℕ} (c : Hypergeometric.CuspIndex d) : List ℚ
The list `α` of a cusp-index `A` (LMFDB `hgm.defining_parameters`): every entry `a` of `A` is replaced by the elements of `ℚ ∩ (0, 1]` with denominator `a`, and the result is sorted in ascending order. For the defining parameters `(A, B)` of a hypergeometric family these are the lists `α` and `β`.
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/GammaVector.leancomplete
def Hypergeometric.Parameters.gammaVector {d : ℕ} (P : Hypergeometric.Parameters d) : List ℤ
def Hypergeometric.Parameters.gammaVector {d : ℕ} (P : Hypergeometric.Parameters d) : List ℤ
The **gamma vector** `γ` of defining parameters `(A, B)` (LMFDB `hgm.defining_parameters`): the list of nonzero integers in ascending order in which `n > 0` occurs `e(n)` times when `e(n) > 0` and `-n` occurs `-e(n)` times when `e(n) < 0`, where `e(n)` is the exponent of `x^n - 1` in `Φ_A / Φ_B`; it is characterised by `∏_{g ∈ γ, g > 0} (x^g - 1) / ∏_{g ∈ γ, g < 0} (x^{-g} - 1) = Φ_A / Φ_B` (`Hypergeometric.Parameters.algebraMap_div_eq_prod_gammaExponent`). -
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/GammaVectorUnique.leancomplete
def Hypergeometric.gammaRatFunc (γ : List ℤ) : RatFunc ℤ
def Hypergeometric.gammaRatFunc (γ : List ℤ) : RatFunc ℤ
The rational function `∏_{g ∈ γ, g > 0} (x^g - 1) / ∏_{g ∈ γ, g < 0} (x^{-g} - 1)` of a list `γ` of integers (LMFDB `hgm.defining_parameters`), in the field `ℚ(x)` of rational functions over `ℤ`. The gamma vector of defining parameters `(A, B)` is the only reduced list in ascending order whose rational function is `Φ_A / Φ_B` (`Hypergeometric.Parameters.eq_gammaVector`). -
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/Weight.leancomplete
theorem Hypergeometric.CuspIndex.length_fractions {d : ℕ} (c : Hypergeometric.CuspIndex d) : c.fractions.length = d
theorem Hypergeometric.CuspIndex.length_fractions {d : ℕ} (c : Hypergeometric.CuspIndex d) : c.fractions.length = d
**The list `α` of a cusp-index of degree `d` has length `d`.**
-
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/LeveltMatrices.leancomplete
theorem Hypergeometric.CuspIndex.map_cyclotomicProd_eq_prod_exp {d : ℕ} (c : Hypergeometric.CuspIndex d) : Polynomial.map (Int.castRingHom ℂ) c.cyclotomicProd = (List.map (fun α => Polynomial.X - Polynomial.C (Complex.exp (2 * ↑Real.pi * Complex.I * ↑α))) c.fractions).prod
theorem Hypergeometric.CuspIndex.map_cyclotomicProd_eq_prod_exp {d : ℕ} (c : Hypergeometric.CuspIndex d) : Polynomial.map (Int.castRingHom ℂ) c.cyclotomicProd = (List.map (fun α => Polynomial.X - Polynomial.C (Complex.exp (2 * ↑Real.pi * Complex.I * ↑α))) c.fractions).prod
**`Φ_C` is the polynomial `∏_j (T - e^{2πiα_j})` of the LMFDB**: over `ℂ`, the product `Φ_C` of the cyclotomic polynomials of the entries of a cusp-index `C` is `∏_j (T - e^{2πiα_j})`, where `α` is the list of fractions of `C` (`Hypergeometric.CuspIndex.fractions`). -
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/GammaVectorUnique.leancomplete
theorem Hypergeometric.Parameters.gammaRatFunc_gammaVector {d : ℕ} (P : Hypergeometric.Parameters d) : Hypergeometric.gammaRatFunc P.gammaVector = (algebraMap (Polynomial ℤ) (RatFunc ℤ)) P.A.cyclotomicProd / (algebraMap (Polynomial ℤ) (RatFunc ℤ)) P.B.cyclotomicProd
theorem Hypergeometric.Parameters.gammaRatFunc_gammaVector {d : ℕ} (P : Hypergeometric.Parameters d) : Hypergeometric.gammaRatFunc P.gammaVector = (algebraMap (Polynomial ℤ) (RatFunc ℤ)) P.A.cyclotomicProd / (algebraMap (Polynomial ℤ) (RatFunc ℤ)) P.B.cyclotomicProd
**The gamma vector satisfies the LMFDB's identity** (LMFDB `hgm.defining_parameters`): in the field `ℚ(x)` of rational functions over `ℤ`, `∏_{g ∈ γ, g > 0} (x^g - 1) / ∏_{g ∈ γ, g < 0} (x^{-g} - 1) = Φ_A / Φ_B` for the gamma vector `γ` of defining parameters `(A, B)`, where `Φ_C = ∏_{c ∈ C} Φ_c` is `Hypergeometric.CuspIndex.cyclotomicProd`, which is `∏_{a ∈ α} (x - e^{2πia})` over `ℂ` (`Hypergeometric.CuspIndex.map_cyclotomicProd_eq_prod_exp`). -
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/GammaVectorUnique.leancomplete
theorem Hypergeometric.Parameters.eq_gammaVector {γ : List ℤ} {d : ℕ} (P : Hypergeometric.Parameters d) (hs : γ.SortedLE) (hγ : ∀ g ∈ γ, -g ∉ γ) (h : Hypergeometric.gammaRatFunc γ = (algebraMap (Polynomial ℤ) (RatFunc ℤ)) P.A.cyclotomicProd / (algebraMap (Polynomial ℤ) (RatFunc ℤ)) P.B.cyclotomicProd) : γ = P.gammaVector
theorem Hypergeometric.Parameters.eq_gammaVector {γ : List ℤ} {d : ℕ} (P : Hypergeometric.Parameters d) (hs : γ.SortedLE) (hγ : ∀ g ∈ γ, -g ∉ γ) (h : Hypergeometric.gammaRatFunc γ = (algebraMap (Polynomial ℤ) (RatFunc ℤ)) P.A.cyclotomicProd / (algebraMap (Polynomial ℤ) (RatFunc ℤ)) P.B.cyclotomicProd) : γ = P.gammaVector
**The gamma vector is unique** (LMFDB `hgm.defining_parameters`): a list `γ` of integers in ascending order that never contains both `g` and `-g` (in particular `0`) and satisfies `∏_{g ∈ γ, g > 0} (x^g - 1) / ∏_{g ∈ γ, g < 0} (x^{-g} - 1) = Φ_A / Φ_B` is the gamma vector of `(A, B)`. Without the second condition `γ` is not unique. -
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/GammaVector.leancomplete
theorem Hypergeometric.Parameters.algebraMap_div_eq_prod_gammaExponent {d : ℕ} (P : Hypergeometric.Parameters d) : (algebraMap (Polynomial ℤ) (RatFunc ℤ)) (Multiset.map (fun a => Polynomial.cyclotomic a ℤ) ↑P.A.toList).prod / (algebraMap (Polynomial ℤ) (RatFunc ℤ)) (Multiset.map (fun b => Polynomial.cyclotomic b ℤ) ↑P.B.toList).prod = ∏ n ∈ P.gammaSupport, (algebraMap (Polynomial ℤ) (RatFunc ℤ)) (Polynomial.X ^ n - 1) ^ P.gammaExponent n
theorem Hypergeometric.Parameters.algebraMap_div_eq_prod_gammaExponent {d : ℕ} (P : Hypergeometric.Parameters d) : (algebraMap (Polynomial ℤ) (RatFunc ℤ)) (Multiset.map (fun a => Polynomial.cyclotomic a ℤ) ↑P.A.toList).prod / (algebraMap (Polynomial ℤ) (RatFunc ℤ)) (Multiset.map (fun b => Polynomial.cyclotomic b ℤ) ↑P.B.toList).prod = ∏ n ∈ P.gammaSupport, (algebraMap (Polynomial ℤ) (RatFunc ℤ)) (Polynomial.X ^ n - 1) ^ P.gammaExponent n
**The gamma vector's defining identity**: in the field of rational functions over `ℤ`, `Φ_A / Φ_B = ∏_n (x^n - 1)^{e(n)}`, the product over the divisors of the entries of `A` and `B`; `Hypergeometric.Parameters.count_gammaVector_pos` and `Hypergeometric.Parameters.count_gammaVector_neg` turn it into the knowl's identity `∏_{g ∈ γ, g > 0} (x^g - 1) / ∏_{g ∈ γ, g < 0} (x^{-g} - 1) = Φ_A / Φ_B`.
Degree of a hypergeometric motive. (LMFDB)
Associated to a motive are vector spaces coming from cohomology of an algebraic variety. The dimension of these vector spaces is the degree of the motive.
For a hypergeometric motive with defining parameters A=[a_1,\ldots,a_m], B=[b_1,\ldots,b_n], the degree is the common value
\sum_{j=1}^m \phi(a_j) = \sum_{j=1}^n \phi(b_j)
where \phi is the Euler totient function.
Depends on: Definition 7.8
Hypergeometric family over \Q. (LMFDB)
A hypergeometric family over \Q is a motive over the field \Q(t) with coefficients in \Q. The families are indexed by non-overlapping ordered pairs of multisets of positive integers (A,B) (called cusp-indices) with \sum_{a \in A} \phi(a) = \sum_{b \in B} \phi(b) = d \in \Z_{\geq 1}, where d is the degree and \phi is Euler's totient function.
This motive has periods which satisfy the hypergeometric differential equation
\left(t \prod_{i=1}^d \left(t \frac{\mathrm d}{\mathrm dt} - \alpha_i\right) - \prod_{j=1}^d \left(t \frac{\mathrm d}{\mathrm dt} + \beta_j - 1\right) \right)(y) = 0
where \alpha_1,\dots,\alpha_d and \beta_1,\dots,\beta_d are lists obtained from A,B by replacing each integer n with the set of all elements of \Q \cap (0,1] with denominator n. For k=1,\dots,d, one solution of this equation is the hypergeometric series
z^{1-\beta_k} \sum_{n=0}^\infty \frac{\prod_{i=1}^d (\alpha_i - \beta_k + 1)_n}{\prod_{j=1}^d (\beta_j - \beta_k + 1)_n} z^n
where (x)_n = x(x+1)\cdots(x+n-1) is the Pochhammer symbol.
Depends on: Definition 7.5
Hypergeometric family over \Q. (LMFDB)
A hypergeometric family over \Q is a motive over the field \Q(t) with coefficients in \Q. The families are indexed by non-overlapping ordered pairs of multisets of positive integers (A,B) (called cusp-indices) with \sum_{a \in A} \phi(a) = \sum_{b \in B} \phi(b) = d \in \Z_{\geq 1}, where d is the degree and \phi is Euler's totient function.
This motive has periods which satisfy the hypergeometric differential equation
\left(t \prod_{i=1}^d \left(t \frac{\mathrm d}{\mathrm dt} - \alpha_i\right) - \prod_{j=1}^d \left(t \frac{\mathrm d}{\mathrm dt} + \beta_j - 1\right) \right)(y) = 0
where \alpha_1,\dots,\alpha_d and \beta_1,\dots,\beta_d are lists obtained from A,B by replacing each integer n with the set of all elements of \Q \cap (0,1] with denominator n. For k=1,\dots,d, one solution of this equation is the hypergeometric series
z^{1-\beta_k} \sum_{n=0}^\infty \frac{\prod_{i=1}^d (\alpha_i - \beta_k + 1)_n}{\prod_{j=1}^d (\beta_j - \beta_k + 1)_n} z^n
where (x)_n = x(x+1)\cdots(x+n-1) is the Pochhammer symbol.
Depends on: Definition 7.5 Definition 7.9
Label of a hypergeometric motive. (LMFDB)
Hypergeometric motives H(A,B,t) \in M(\Q,\Q) are labeled following the pattern of H([3,3],[2,2,4],-1/3) having label A3.3_B2.2.4_t-1.3 and the corresponding family having label A3.3_B2.2.4 .
Depends on: Definition 7.10 Definition 7.19
Primes of good and bad reduction of a hypergeometric motive. (LMFDB)
A prime of bad reduction or bad prime of a hypergeometric motive M is a prime dividing the conductor of M. A bad prime is either tame or wild.
A prime of good reduction or good prime is a prime that is not a bad prime, i.e., a prime that does not divide the conductor.
Depends on: Definition 7.4 Definition 7.19 Definition 7.22 Definition 7.25
Hodge vector of a hypergeometric motive. (LMFDB)
Let H(A,B) be a hypergeometric family of degree d and weight w with defining parameters A=[a_1,\ldots,a_m] and B=[b_1,\ldots,b_n]. The Hodge vector (h^{0,w},\dots,h^{w,0}) of H(A,B) records the dimensions h^{p,q} (with p+q=w) of the Hodge subspaces associated to the family.
The Hodge vector depends on how the indices a_j and b_k intertwine on the circle \R/\Z, and we have d = \sum_{p=0}^{w} h^{p,w-p}. At the extreme of complete intertwining, the Hodge vector is (h^{0,0}) = (d). At the extreme of complete separation, d = w+1 and
the Hodge vector is (h^{0,w},\dots,h^{w,0}) = (1,\dots,1).
For t \in \Q with t \neq 0,1, the motive H(A,B,t) has the same Hodge vector as the family. For t=1, the motive H(A,B,t) has degree d-1 or d-2, according to whether w is even or odd: if w is even, then the middle Hodge number h^{w/2,w/2} drops by 1, whereas if w is odd, then the two middle Hodge numbers drop by 1.
Depends on: Definition 7.8 Definition 7.9 Definition 7.10 Definition 7.19 Definition 7.24
-
Hypergeometric.Parameters.rotationNumber[complete] -
Hypergeometric.Parameters.rotationGroup[complete]
Imprimitivity index of a hypergeometric motive. (LMFDB)
If a hypergeometric family has defining parameters A=(a_1,\ldots,a_n) and B=(b_1,\ldots,b_m), then we can view the parameters as giving two multisets of roots of unity, namely for A, the primitive a_i-th roots of unity repeated according to their multiplicities in A, and similarly for B. These sets has a rotational symmetry group R, which may be trivial. The rotation number is the order of R.
Depends on: Definition 7.8
Lean code for Definition7.15●2 definitions
Associated Lean declarations
-
Hypergeometric.Parameters.rotationNumber[complete]
-
Hypergeometric.Parameters.rotationGroup[complete]
-
Hypergeometric.Parameters.rotationNumber[complete] -
Hypergeometric.Parameters.rotationGroup[complete]
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/RotationNumber.leancomplete
def Hypergeometric.Parameters.rotationNumber {d : ℕ} (P : Hypergeometric.Parameters d) : ℕ
def Hypergeometric.Parameters.rotationNumber {d : ℕ} (P : Hypergeometric.Parameters d) : ℕ
The **rotation number** of a hypergeometric family (LMFDB `hgm.rotation_number`, also stated as `hgm.imprimitivity_index`): the order of its rotational symmetry group `R` (`Hypergeometric.Parameters.rotationGroup`). For positive degree the group is finite (`Hypergeometric.Parameters.finite_rotationGroup`), so this is a positive integer; for degree `0`, where `A` and `B` are empty, the group is all of `ℂ^×` and `Nat.card` gives the junk value `0`.
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/RotationNumber.leancomplete
def Hypergeometric.Parameters.rotationGroup {d : ℕ} (P : Hypergeometric.Parameters d) : Subgroup ℂˣ
def Hypergeometric.Parameters.rotationGroup {d : ℕ} (P : Hypergeometric.Parameters d) : Subgroup ℂˣ
The **rotational symmetry group** `R` of a hypergeometric family with defining parameters `(A, B)` (LMFDB `hgm.rotation_number`): the subgroup of the `ζ ∈ ℂ^×` with `ζ S_A = S_A` and `ζ S_B = S_B`, as multisets. For positive degree its elements are roots of unity, as they map a root of unity to a root of unity.
Levelt matrices of a hypergeometric family. (LMFDB)
The monodromy representation associated to a hypergeometric family is generated by two matrices h_{\infty} and h_0 describing the local monodromy around \infty and 0, respectively. The characteristic polynomial of h_{\infty} is \prod_j (T - e^{2\pi i \alpha_j}) and of h_0 is \prod_j (T - e^{2\pi i \beta_j}), where (\alpha_j) and (\beta_j) are from the defining parameters of the family. The choice of matrices satisfying this condition is determined up to simultaneous conjugacy.
The presentation used here is due to Levelt .
Depends on: Definition 7.8 Definition 7.10 Definition 7.18
The local discriminant of a hypergeometric motive. (LMFDB)
Given a hypergeometric motive M and a prime p, the local discriminant of M at p is the discriminant of the number field defined by the characteristic polynomial of Frobenius of M at p.
Depends on: Definition 7.19 Definition 6.3.13 Definition 5.1.17
Monodromy group of a hypergeometric family. (LMFDB)
The monodromy representation associated to a hypergeometric family is generated by two matrices A and B describing the local monodromy around \infty and 0, respectively. The presentation used here is due to Levelt .
The monodromy groups of hypergeometric families of weight 0 were computed by Beukers and Heckman .
Hypergeometric motive. (LMFDB)
Hypergeometric motives H(A,B,t) in a family H(A,B) are
indexed by rational numbers t \not \in \{0,1\}, with the case t=1 allowed if special attention is given.
For example H([3],[1,1],t) is the
motive H^1(E_{1728t},{\Bbb Q}) where
E_{j} is an elliptic curve with j-invariant 1728j.
Also special hypergeometric motives H(A,B,1) are defined, having degree
1 or 2 less than the other H(A,B,t).
Depends on: Definition 7.10
-
Hypergeometric.Parameters.rotationNumber[complete] -
Hypergeometric.Parameters.rotationGroup[complete] -
Hypergeometric.Parameters.finite_rotationGroup[complete]
Imprimitivity index of a hypergeometric motive. (LMFDB)
If a hypergeometric family has defining parameters A=(a_1,\ldots,a_n) and B=(b_1,\ldots,b_m), then we can view the parameters as giving two multisets of roots of unity, namely for A, the primitive a_i-th roots of unity repeated according to their multiplicities in A, and similarly for B. These sets has a rotational symmetry group R, which may be trivial. The rotation number is the order of R.
Depends on: Definition 7.8
Lean code for Definition7.20●3 declarations
Associated Lean declarations
-
Hypergeometric.Parameters.rotationNumber[complete]
-
Hypergeometric.Parameters.rotationGroup[complete]
-
Hypergeometric.Parameters.finite_rotationGroup[complete]
-
Hypergeometric.Parameters.rotationNumber[complete] -
Hypergeometric.Parameters.rotationGroup[complete] -
Hypergeometric.Parameters.finite_rotationGroup[complete]
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/RotationNumber.leancomplete
def Hypergeometric.Parameters.rotationNumber {d : ℕ} (P : Hypergeometric.Parameters d) : ℕ
def Hypergeometric.Parameters.rotationNumber {d : ℕ} (P : Hypergeometric.Parameters d) : ℕ
The **rotation number** of a hypergeometric family (LMFDB `hgm.rotation_number`, also stated as `hgm.imprimitivity_index`): the order of its rotational symmetry group `R` (`Hypergeometric.Parameters.rotationGroup`). For positive degree the group is finite (`Hypergeometric.Parameters.finite_rotationGroup`), so this is a positive integer; for degree `0`, where `A` and `B` are empty, the group is all of `ℂ^×` and `Nat.card` gives the junk value `0`.
-
defdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/RotationNumber.leancomplete
def Hypergeometric.Parameters.rotationGroup {d : ℕ} (P : Hypergeometric.Parameters d) : Subgroup ℂˣ
def Hypergeometric.Parameters.rotationGroup {d : ℕ} (P : Hypergeometric.Parameters d) : Subgroup ℂˣ
The **rotational symmetry group** `R` of a hypergeometric family with defining parameters `(A, B)` (LMFDB `hgm.rotation_number`): the subgroup of the `ζ ∈ ℂ^×` with `ζ S_A = S_A` and `ζ S_B = S_B`, as multisets. For positive degree its elements are roots of unity, as they map a root of unity to a root of unity.
-
theoremdefined in LeanBridge/ForMathlib/NumberTheory/Hypergeometric/RotationNumber.leancomplete
theorem Hypergeometric.Parameters.finite_rotationGroup {d : ℕ} (P : Hypergeometric.Parameters d) (hd : d ≠ 0) : Finite ↥P.rotationGroup
theorem Hypergeometric.Parameters.finite_rotationGroup {d : ℕ} (P : Hypergeometric.Parameters d) (hd : d ≠ 0) : Finite ↥P.rotationGroup
**The rotational symmetry group of a family of positive degree is finite**: it maps a root of unity `s ∈ S_A` into the finite multiset `S_A`.
Complex conjugation acts on the vector space corresponding to the middle entry in the Hodge vector. The signature of a hypergeometric motive is the difference between the number of +1 eigenvalues and the number of -1 eigenvalues for this operator.
When there is no middle entry (because the Hodge width is odd), the signature is 0.
The archimedean root number can be recovered from the signature s and the Hodge vector (h_n).
Depends on: Definition 7.14
Tame primes for hypergeometric families. (LMFDB)
A prime p is called tame for a hypergeometric motive H(A,B,t) if p is not wild and either v_p(t) \ne 0 or v_p(t-1) \ne 0. The conductor of H(A,B,t) is supported at a subset of the tame and wild primes.
Depends on: Definition 7.19 Definition 7.25
The type of a hypergeometric motive. (LMFDB)
A hypergeometric motive M of weight w is of orthogonal or symplectic type according as w is even or odd. This corresponds to the fact that the motivic Galois group of M is either a subgroup of the conformal orthogonal group or conformal symplectic group depending on the parity of w.
Depends on: Definition 7.19 Definition 7.24
weight. (LMFDB)
Associated to a motive are vector spaces coming from cohomology H^*(X) of an algebraic variety X. If these vector spaces arise in H^w(X), then w is the (motivic) weight of the motive. The weight is the number of commas in the Hodge vector, i.e., the Hodge vector is of the form (h^{0,w},\dots,h^{w,0}).
Wild primes for hypergeometric families. (LMFDB)
A prime p is called wild for a hypergeometric family H(A,B) if it divides an element of the defining parameters A and B. The name is appropriate since if p is such a prime, then for most t \in \Q^\times the motive H(A,B,t) is wildly ramified at p.
Depends on: Definition 7.8 Definition 7.10
Zigzag plot. (LMFDB)
The zigzag plot, or zigzag procedure, is a graphical representation of the defining parameters of a hypergeometric family \alpha and \beta. For improved readability, we color the \alpha parameters with red, and the \beta parameters with blue. It is constructed by ordering the parameters \alpha_i and \beta_j. One draws a point at (0,0) corresponding to the lowest parameter. One then proceeds in uniform steps from left to right, drawing a point for each parameter and then moving diagonally upwards after red points and diagonally downwards after blue points.
The hodge vector of the corresponding hypergeometric family can be read from the Zigzag plot by counting the number of points of the same color lying on each horizontal line.
Depends on: Definition 7.8 Definition 7.14
Hodge vector of a hypergeometric motive. (LMFDB)
Let H(A,B) be a hypergeometric family of degree d and weight w with defining parameters A=[a_1,\ldots,a_m] and B=[b_1,\ldots,b_n]. The Hodge vector (h^{0,w},\dots,h^{w,0}) of H(A,B) records the dimensions h^{p,q} (with p+q=w) of the Hodge subspaces associated to the family.
The Hodge vector depends on how the indices a_j and b_k intertwine on the circle \R/\Z, and we have d = \sum_{p=0}^{w} h^{p,w-p}. At the extreme of complete intertwining, the Hodge vector is (h^{0,0}) = (d). At the extreme of complete separation, d = w+1 and
the Hodge vector is (h^{0,w},\dots,h^{w,0}) = (1,\dots,1).
For t \in \Q with t \neq 0,1, the motive H(A,B,t) has the same Hodge vector as the family. For t=1, the motive H(A,B,t) has degree d-1 or d-2, according to whether w is even or odd: if w is even, then the middle Hodge number h^{w/2,w/2} drops by 1, whereas if w is odd, then the two middle Hodge numbers drop by 1.
Depends on: Definition 7.8 Definition 7.9 Definition 7.10 Definition 7.19 Definition 7.24
- No associated Lean code or declarations.
Width of a motive. (LMFDB)
The width of a weight w motive M in M(F,\Q) is the number of steps from the first nonzero entry in the Hodge vector to the last nonzero entry. Thus if M has weight 7 and Hodge vector (0,2,3,1,3,2,0), then its width is 4.