TBZ-qMZV of the empty index to Coefficients of the SZ generating series
TheoremTBZ-qMZV of the empty index#✓fully proved
The Takeyama–Bradley–Zhao qMZV of the empty index is \(1\): \(\zeta_q^{\mathrm{TBZ}}(\varnothing) = 1\).
public theorem tbzQMZV_nil : tbzQMZV [] = 1
public noncomputable def tbzQMZV (k : List (Option ℕ)) : ℚ⟦X⟧ :=
qMZV (k.map tbzLetter)
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:679
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition of the Takeyama–Bradley–Zhao model.
Uses 1
TheoremThe TBZ model extends the BZ model#✓fully proved
For every index \((k_1, \dots, k_r)\) of natural numbers, read as a TBZ index without the symbol \(\bar 1\), the TBZ-qMZV equals the Bradley–Zhao qMZV: \(\zeta_q^{\mathrm{TBZ}}(k_1, \dots, k_r) = \zeta_q^{\mathrm{BZ}}(k_1, \dots, k_r)\).
public theorem tbzQMZV_map_some (k : List ℕ) : tbzQMZV (k.map some) = bzQMZV k
public noncomputable def tbzQMZV (k : List (Option ℕ)) : ℚ⟦X⟧ :=
qMZV (k.map tbzLetter)
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:679
public noncomputable def bzQMZV (k : List ℕ) : ℚ⟦X⟧ :=
qMZV (k.map fun k => (k, Polynomial.X ^ (k - 1)))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:303
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition of the Takeyama–Bradley–Zhao model.
Uses 4
TheoremThe Takeyama–Bradley–Zhao model spans \(\mathcal{Z}_q\)#●ready to prove
Let \(\overline{\mathbb{N}}\) consist of the positive integers and one further symbol \(\bar 1\). The space \(\mathcal{Z}_q = \mathcal{Z}_{q,0}\) equals the \(\mathbb{Q}\)-linear span of the TBZ-qMZVs \(\zeta_q^{\mathrm{TBZ}}(k_1, \dots, k_r)\) over all \(r \ge 0\) and all \(k_1, \dots, k_r \in \overline{\mathbb{N}}\) with \(k_1 \ne 1\) when \(r \ge 1\).
public theorem_wanted qMZVSpace_zero_eq_span_tbzQMZV :
qMZVSpace 0 = Submodule.span ℚ {f | ∃ k : List (Option ℕ),
(∀ j ∈ k, ∀ kⱼ ∈ j, 1 ≤ kⱼ) ∧ k.head? ≠ some (some 1) ∧ f = tbzQMZV k}
public noncomputable def qMZVSpace (d : ℕ) : Submodule ℚ ℚ⟦X⟧ :=
Submodule.span ℚ {f | ∃ kQ : List (ℕ × Polynomial ℚ),
(∀ p ∈ kQ, p.2.natDegree + d ≤ p.1) ∧ (∀ p ∈ kQ.head?, p.2.coeff 0 = 0) ∧ f = qMZV kQ}
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:286
public noncomputable def tbzQMZV (k : List (Option ℕ)) : ℚ⟦X⟧ :=
qMZV (k.map tbzLetter)
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:679
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Proposition 6.
Uses 2
DefinitionThe spaces \(\mathcal{Z}^\circ_{q,d}\)#✓fully proved
For a natural number \(d\), the space \(\mathcal{Z}^\circ_{q,d}\) is the \(\mathbb{Q}\)-linear span, in the formal power series ring \(\mathbb{Q}[[q]]\), of the general qMZVs \(\zeta_q(k_1, \dots, k_r; Q_1, \dots, Q_r)\) over all \(r \ge 0\), natural numbers \(k_1, \dots, k_r\) and polynomials \(Q_1, \dots, Q_r \in \mathbb{Q}[X]\) such that for every \(j\) we have \(k_j \ge 1\), \(\deg Q_j + d \le k_j\) and \(Q_j(0) = 0\). Here the zero polynomial has degree \(0\).
public noncomputable def qMZVSpaceCirc (d : ℕ) : Submodule ℚ ℚ⟦X⟧ :=
Submodule.span ℚ {f | ∃ kQ : List (ℕ × Polynomial ℚ),
(∀ p ∈ kQ, 1 ≤ p.1 ∧ p.2.natDegree + d ≤ p.1 ∧ p.2.coeff 0 = 0) ∧ f = qMZV kQ}
public noncomputable def qMZV : List (ℕ × Polynomial ℚ) → ℚ⟦X⟧
| [] => 1
| (k, Q) :: kQ => PowerSeries.mk fun N => coeff N (∑ m ∈ Finset.Ioo 0 (N + 1),
Polynomial.aeval (X ^ m : ℚ⟦X⟧) Q * ((1 - X ^ m)⁻¹) ^ k * qMZVPartial kQ m)
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:258
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition of
𝒵_{q,d}and𝒵°_{q,d}(after Bachmann–Kühn).
Uses 1 · Used by 4
TheoremThe constant \(1\) lies in \(\mathcal{Z}^\circ_{q,d}\)#✓fully proved
For every natural number \(d\), the constant power series \(1\) (the qMZV of the empty index) lies in the space \(\mathcal{Z}^\circ_{q,d}\).
public theorem one_mem_qMZVSpaceCirc (d : ℕ) : (1 : ℚ⟦X⟧) ∈ qMZVSpaceCirc d
public noncomputable def qMZVSpaceCirc (d : ℕ) : Submodule ℚ ℚ⟦X⟧ :=
Submodule.span ℚ {f | ∃ kQ : List (ℕ × Polynomial ℚ),
(∀ p ∈ kQ, 1 ≤ p.1 ∧ p.2.natDegree + d ≤ p.1 ∧ p.2.coeff 0 = 0) ∧ f = qMZV kQ}
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:710
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition of
𝒵°_{q,d}.
Uses 2
Theorem\(\mathcal{Z}^\circ_{q,d}\) is contained in \(\mathcal{Z}_{q,d}\)#✓fully proved
For every natural number \(d\), the space \(\mathcal{Z}^\circ_{q,d}\) is a subspace of \(\mathcal{Z}_{q,d}\).
public theorem qMZVSpaceCirc_le_qMZVSpace (d : ℕ) : qMZVSpaceCirc d ≤ qMZVSpace d
public noncomputable def qMZVSpaceCirc (d : ℕ) : Submodule ℚ ℚ⟦X⟧ :=
Submodule.span ℚ {f | ∃ kQ : List (ℕ × Polynomial ℚ),
(∀ p ∈ kQ, 1 ≤ p.1 ∧ p.2.natDegree + d ≤ p.1 ∧ p.2.coeff 0 = 0) ∧ f = qMZV kQ}
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:710
public noncomputable def qMZVSpace (d : ℕ) : Submodule ℚ ℚ⟦X⟧ :=
Submodule.span ℚ {f | ∃ kQ : List (ℕ × Polynomial ℚ),
(∀ p ∈ kQ, p.2.natDegree + d ≤ p.1) ∧ (∀ p ∈ kQ.head?, p.2.coeff 0 = 0) ∧ f = qMZV kQ}
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:286
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition of
𝒵°_{q,d}(a subspace of𝒵_{q,d}).
Uses 3
DefinitionOkounkov polynomials#✓fully proved
For \(k \in \mathbb{N}\), the Okounkov polynomial \(p_k \in \mathbb{Q}[X]\) is \(p_k(X) = X^{k/2}\) if \(k\) is even and \(p_k(X) = X^{(k-1)/2}(1 + X)\) if \(k\) is odd.
public noncomputable def okounkovPoly (k : ℕ) : Polynomial ℚ :=
if k % 2 = 0 then Polynomial.X ^ (k / 2) else Polynomial.X ^ ((k - 1) / 2) * (1 + Polynomial.X)
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition of Okounkov qMZVs.
Used by 2
TheoremThe Okounkov polynomials \(p_2\) and \(p_3\)#✓fully proved
The Okounkov polynomials of index \(2\) and \(3\) are \(p_2(X) = X\) and \(p_3(X) = X(1 + X)\).
public theorem okounkovPoly_two_three :
okounkovPoly 2 = Polynomial.X ∧ okounkovPoly 3 = Polynomial.X * (1 + Polynomial.X)
public noncomputable def okounkovPoly (k : ℕ) : Polynomial ℚ :=
if k % 2 = 0 then Polynomial.X ^ (k / 2) else Polynomial.X ^ ((k - 1) / 2) * (1 + Polynomial.X)
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:736
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition of Okounkov qMZVs.
Uses 1
DefinitionOkounkov \(q\)-multiple zeta values#✓fully proved
For a natural number \(k\) let \(p_k\) be Okounkov's polynomial: \(p_k(X) = X^{k/2}\) if \(k\) is even and \(p_k(X) = X^{(k-1)/2}(1 + X)\) if \(k\) is odd. For an index \((k_1, \dots, k_r)\) of natural numbers, the Okounkov qMZV is the general qMZV \(\zeta_q^{\mathrm{Oko}}(k_1, \dots, k_r) = \zeta_q(k_1, \dots, k_r; p_{k_1}, \dots, p_{k_r})\), a formal power series in \(q\) over \(\mathbb{Q}\).
The paper uses it only for indices with every \(k_i \ge 2\); for other indices the value is a placeholder.
public noncomputable def okounkovQMZV (k : List ℕ) : ℚ⟦X⟧ :=
qMZV (k.map fun k => (k, okounkovPoly k))
public noncomputable def qMZV : List (ℕ × Polynomial ℚ) → ℚ⟦X⟧
| [] => 1
| (k, Q) :: kQ => PowerSeries.mk fun N => coeff N (∑ m ∈ Finset.Ioo 0 (N + 1),
Polynomial.aeval (X ^ m : ℚ⟦X⟧) Q * ((1 - X ^ m)⁻¹) ^ k * qMZVPartial kQ m)
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:258
public noncomputable def okounkovPoly (k : ℕ) : Polynomial ℚ :=
if k % 2 = 0 then Polynomial.X ^ (k / 2) else Polynomial.X ^ ((k - 1) / 2) * (1 + Polynomial.X)
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:736
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition of Okounkov qMZVs.
TheoremOkounkov qMZV of the empty index#✓fully proved
The Okounkov \(q\)-multiple zeta value of the empty index is \(1\): \(\zeta_q^{\mathrm{Oko}}(\varnothing) = 1\).
public theorem okounkovQMZV_nil : okounkovQMZV [] = 1
public noncomputable def okounkovQMZV (k : List ℕ) : ℚ⟦X⟧ :=
qMZV (k.map fun k => (k, okounkovPoly k))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:752
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition of Okounkov qMZVs.
Uses 1
TheoremOkounkov qMZVs span \(\mathcal{Z}^\circ_{q,1}\)#●ready to prove
The space \(\mathcal{Z}^\circ_{q,1}\) equals the \(\mathbb{Q}\)-linear span of the Okounkov qMZVs \(\zeta_q^{\mathrm{Oko}}(k_1, \dots, k_r)\) over all indices of length \(r \ge 0\) with every \(k_i \ge 2\).
public theorem_wanted qMZVSpaceCirc_one_eq_span_okounkovQMZV :
qMZVSpaceCirc 1 = Submodule.span ℚ {f | ∃ k : List ℕ,
(∀ kᵢ ∈ k, 2 ≤ kᵢ) ∧ f = okounkovQMZV k}
public noncomputable def qMZVSpaceCirc (d : ℕ) : Submodule ℚ ℚ⟦X⟧ :=
Submodule.span ℚ {f | ∃ kQ : List (ℕ × Polynomial ℚ),
(∀ p ∈ kQ, 1 ≤ p.1 ∧ p.2.natDegree + d ≤ p.1 ∧ p.2.coeff 0 = 0) ∧ f = qMZV kQ}
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:710
public noncomputable def okounkovQMZV (k : List ℕ) : ℚ⟦X⟧ :=
qMZV (k.map fun k => (k, okounkovPoly k))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:752
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Proposition 13 (after Bachmann–Kühn).
Uses 2
DefinitionEulerian q-series#✓fully proved
For natural numbers \(k\) and \(m \ge 1\), the Eulerian \(q\)-series is
the inner sum of a bi-bracket; here \(k - 1\) is read as \(0\) when \(k = 0\). For \(m = 0\) the series is defined to be \(0\).
For \(k, m \ge 1\) it equals \(P_k(q^m)/(1 - q^m)^k\), where \(P_k\) is the \(k\)-th Eulerian polynomial.
public noncomputable def eulerianQSeries (k m : ℕ) : ℚ⟦X⟧ :=
PowerSeries.mk fun e =>
if 0 < e ∧ m ∣ e then ((e / m : ℕ) : ℚ) ^ (k - 1) / (k - 1).factorial else 0
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition-Proposition of bi-brackets (Eulerian polynomials).
Used by 2
TheoremCoefficients of the Eulerian q-series#✓fully proved
For natural numbers \(k\), \(m\) and \(n\) with \(m > 0\) and \(n > 0\), the coefficient of \(q^{mn}\) in the Eulerian \(q\)-series \(\sum_{\ell \ge 1} \frac{\ell^{k-1}}{(k-1)!} q^{m\ell}\) is \(\frac{n^{k-1}}{(k-1)!}\), where \(k - 1\) is read as \(0\) when \(k = 0\).
public theorem coeff_mul_eulerianQSeries (k m n : ℕ) (hm : 0 < m) (hn : 0 < n) :
coeff (m * n) (eulerianQSeries k m) = (n : ℚ) ^ (k - 1) / (k - 1).factorial
public noncomputable def eulerianQSeries (k m : ℕ) : ℚ⟦X⟧ :=
PowerSeries.mk fun e =>
if 0 < e ∧ m ∣ e then ((e / m : ℕ) : ℚ) ^ (k - 1) / (k - 1).factorial else 0
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:775
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition-Proposition of bi-brackets.
Uses 1
DefinitionPartial sums of bi-brackets#✓fully proved
For pairs \((k_1, d_1), \dots, (k_r, d_r)\) of natural numbers and a bound \(M \in \mathbb{N}\), the partial bi-bracket is the \(q\)-series
where \(E_k(m) = \sum_{n \ge 1} \frac{n^{k-1}}{(k-1)!} q^{mn}\) is the Eulerian \(q\)-series (with \(k - 1\) read as \(0\) when \(k = 0\)). For \(r = 0\) it is \(1\).
public noncomputable def biBracketPartial : List (ℕ × ℕ) → ℕ → ℚ⟦X⟧
| [], _ => 1
| (k, d) :: kd, M => ∑ m ∈ Finset.Ioo 0 M,
((m : ℚ) ^ d / d.factorial) • (eulerianQSeries k m * biBracketPartial kd m)
public noncomputable def eulerianQSeries (k m : ℕ) : ℚ⟦X⟧ :=
PowerSeries.mk fun e =>
if 0 < e ∧ m ∣ e then ((e / m : ℕ) : ℚ) ^ (k - 1) / (k - 1).factorial else 0
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:775
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition-Proposition of bi-brackets (defining sum truncated at
m₁ < M).
Uses 1 · Used by 2
DefinitionBi-brackets#✓fully proved
For integers \(k_1, \dots, k_r \ge 1\) and \(d_1, \dots, d_r \ge 0\), the bi-bracket is the \(q\)-series
and \(g(\varnothing; \varnothing) = 1\). The summands with \(m_1 > N\) have \(q\)-adic order greater than \(N\), so the coefficient of \(q^N\) is that of the finite partial sum over \(m_1 \le N\); this is how the series is defined.
The same formula, with \(k_j - 1\) read as \(0\), defines a value when some \(k_j = 0\).
public noncomputable def biBracket (kd : List (ℕ × ℕ)) : ℚ⟦X⟧ :=
PowerSeries.mk fun N => coeff N (biBracketPartial kd (N + 1))
public noncomputable def biBracketPartial : List (ℕ × ℕ) → ℕ → ℚ⟦X⟧
| [], _ => 1
| (k, d) :: kd, M => ∑ m ∈ Finset.Ioo 0 M,
((m : ℚ) ^ d / d.factorial) • (eulerianQSeries k m * biBracketPartial kd m)
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:792
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition-Proposition of bi-brackets (after Bachmann).
TheoremEmpty bi-bracket#✓fully proved
The bi-bracket of the empty index is \(1\): \(g(\varnothing; \varnothing) = 1\).
public theorem biBracket_nil : biBracket [] = 1
public noncomputable def biBracket (kd : List (ℕ × ℕ)) : ℚ⟦X⟧ :=
PowerSeries.mk fun N => coeff N (biBracketPartial kd (N + 1))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:805
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Definition-Proposition of bi-brackets.
Uses 2
DefinitionGenerating series of bi-brackets#✓fully proved
For \(r \in \mathbb{N}\), the generating series of the bi-brackets of depth \(r\) is the formal power series in the variables \(X_1, \dots, X_r\), \(Y_1, \dots, Y_r\) with coefficients in \(\mathbb{Q}[[q]]\)
where \(g(k_1, \dots, k_r; d_1, \dots, d_r)\) is the bi-bracket. Equivalently, the coefficient of \(\prod_{j=1}^{r} X_j^{a_j} Y_j^{b_j}\) is \(g(a_1 + 1, \dots, a_r + 1; b_1, \dots, b_r)\).
public noncomputable def biBracketGen (r : ℕ) : MvPowerSeries (Fin r ⊕ Fin r) ℚ⟦X⟧ :=
fun e => biBracket (List.ofFn fun j => (e (Sum.inl j) + 1, e (Sum.inr j)))
public noncomputable def biBracket (kd : List (ℕ × ℕ)) : ℚ⟦X⟧ :=
PowerSeries.mk fun N => coeff N (biBracketPartial kd (N + 1))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:805
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Theorem 11 (definition of the generating series).
TheoremCoefficients of the bi-bracket generating series#✓fully proved
For \(r \in \mathbb{N}\) and exponents \(a_1, \dots, a_r, b_1, \dots, b_r \ge 0\), the coefficient of \(\prod_{j=1}^{r} X_j^{a_j} Y_j^{b_j}\) in the generating series \(g(X_1, \dots, X_r; Y_1, \dots, Y_r)\) of bi-brackets of depth \(r\) is the bi-bracket \(g(a_1 + 1, \dots, a_r + 1; b_1, \dots, b_r)\).
public theorem coeff_biBracketGen (r : ℕ) (e : Fin r ⊕ Fin r →₀ ℕ) :
MvPowerSeries.coeff e (biBracketGen r) =
biBracket (List.ofFn fun j => (e (Sum.inl j) + 1, e (Sum.inr j)))
public noncomputable def biBracketGen (r : ℕ) : MvPowerSeries (Fin r ⊕ Fin r) ℚ⟦X⟧ :=
fun e => biBracket (List.ofFn fun j => (e (Sum.inl j) + 1, e (Sum.inr j)))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:822
public noncomputable def biBracket (kd : List (ℕ × ℕ)) : ℚ⟦X⟧ :=
PowerSeries.mk fun N => coeff N (biBracketPartial kd (N + 1))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:805
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Theorem 11.
Uses 2
DefinitionGenerating series of Schlesinger–Zudilin qMZVs#✓fully proved
For a natural number \(r\), the generating series of SZ-qMZVs of depth \(r\) is the formal power series in the \(2r\) variables \(X_1, \dots, X_r, Y_1, \dots, Y_r\) with coefficients in \(\mathbb{Q}[[q]]\)
where \(\{0\}^{d}\) stands for \(d\) consecutive zeros.
public noncomputable def szGen (r : ℕ) : MvPowerSeries (Fin r ⊕ Fin r) ℚ⟦X⟧ :=
fun e => szQMZV (szBlockIndex (List.ofFn fun j => (e (Sum.inl j) + 1, e (Sum.inr j) + 1)))
public noncomputable def szQMZV (k : List ℕ) : ℚ⟦X⟧ :=
PowerSeries.mk fun N => coeff N (szQMZVPartial k (N + 1))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:71
public def szBlockIndex (kd : List (ℕ × ℕ)) : List ℕ :=
(kd.map fun p => p.1 :: List.replicate (p.2 - 1) 0).flatten
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:113
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Theorem 4 (definition of the generating series).
Uses 2 · Used by 2
TheoremCoefficients of the SZ generating series#✓fully proved
For \(r \in \mathbb{N}\) and exponents \(a_1, \dots, a_r, b_1, \dots, b_r \ge 0\), the coefficient of \(\prod_{j=1}^{r} X_j^{a_j} Y_j^{b_j}\) in the generating series \(s(X_1, \dots, X_r; Y_1, \dots, Y_r)\) of Schlesinger–Zudilin \(q\)-multiple zeta values of depth \(r\) is \(\zeta_q^{\mathrm{SZ}}(a_1 + 1, \{0\}^{b_1}, \dots, a_r + 1, \{0\}^{b_r})\), where \(\{0\}^b\) stands for \(b\) consecutive zeros.
public theorem coeff_szGen (r : ℕ) (e : Fin r ⊕ Fin r →₀ ℕ) :
MvPowerSeries.coeff e (szGen r) =
szQMZV (szBlockIndex (List.ofFn fun j => (e (Sum.inl j) + 1, e (Sum.inr j) + 1)))
public noncomputable def szGen (r : ℕ) : MvPowerSeries (Fin r ⊕ Fin r) ℚ⟦X⟧ :=
fun e => szQMZV (szBlockIndex (List.ofFn fun j => (e (Sum.inl j) + 1, e (Sum.inr j) + 1)))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:840
public noncomputable def szQMZV (k : List ℕ) : ℚ⟦X⟧ :=
PowerSeries.mk fun N => coeff N (szQMZVPartial k (N + 1))
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:71
public def szBlockIndex (kd : List (ℕ × ℕ)) : List ℕ :=
(kd.map fun p => p.1 :: List.replicate (p.2 - 1) 0).flatten
WantedExt/NumberTheory/QMultipleZetaValuesWanted.lean:113
Sources
- Benjamin Brindle, A Unified Approach to qMZVs, INTEGERS 24 (2024), Article A6, Theorem 4.
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.