The closed form `NumV/DenV` solves the row-peeling recursion: this is the algebraic
ProvedPGLQuotient.NumDen_stepaether-catalogalgebra
The closed form NumV/DenV solves the row-peeling recursion: this is the algebraic
content of the induction step.
theorem PGLQuotient.NumDen_step(m c j : ℕ) :
(q ^ (m + 1) * (q ^ (j + 1) - 1))⁻¹ *
(NumV q m (c + 1) (j + 1) / DenV q m (c + 1) (j + 1)
+ (q ^ ((m + 1) * (c + 1)) - 1)⁻¹ * (NumV q m (c + 1) 0 / DenV q m (c + 1) 0))
= NumV q (m + 1) c j / DenV q (m + 1) c j := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Algebra/PGLQuotient/VolumeAlgebra.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Algebra/PGLQuotient/VolumeAlgebra.lean
import Mathlib
import Definitions.Def_Algebra_PGLQuotient_VolumeAlgebra
/-!
# The algebraic core of the general-rank vertex volume
This file contains the purely algebraic input for the closed product form of the vertex volume
of the standard arithmetic quotient of `PGL_d(F_q((t^{-1})))` in **arbitrary rank**.
The building-theoretic side (see `Algebra.PGLQuotient.TwistedWeight` and
`Algebra.PGLQuotient.VertexVolumeGeneral`) produces a two-parameter family of *twisted masses*
`M(n,c,j)` (rank `n+1`, twist parameters `c` and `j`) satisfying a row-peeling recursion. The
solution of that recursion is
`M(n,c,j) = NumV q n c j / DenV q n c j`,
where
* `NumV q n c j = ∑_{i=0}^{n} q^{ci} (∏_{k<i} (q^{n-k}-1)) (∏_{s<n-i}(q^{s+1+j}-1))`,
* `DenV q n c j = (∏_{s<n+1}(q^{s+1+j}-1)) (∏_{k<n}(q^{k+1}-1)) (∏_{k<n}(q^{c+k+1}-1))`.
The main result here is the **cut-set recursion** `NumV_rec`:
`q^{m+1} · NumV q (m+1) c j = (q^{m+1}-1)(q^{c+1}-1) · NumV q m (c+1) (j+1) + Jfac q (m+1) (j+1)`,
proved by an Abel summation whose term-by-term input is a pair of product identities.
Specialising `c = j = 0` collapses `NumV` to `(n+1)·Pfac q n`, which is what produces the
closed product form `d/(P(d)P(d-1))` of the vertex volume.
-/
open PGLQuotient
open Finset
variable (q : ℝ)
variable {q}
variable (hq : 1 < q)
include hqFormal statement
theorem PGLQuotient.NumDen_step(m c j : ℕ) :
(q ^ (m + 1) * (q ^ (j + 1) - 1))⁻¹ *
(NumV q m (c + 1) (j + 1) / DenV q m (c + 1) (j + 1)
+ (q ^ ((m + 1) * (c + 1)) - 1)⁻¹ * (NumV q m (c + 1) 0 / DenV q m (c + 1) 0))
= NumV q (m + 1) c j / DenV q (m + 1) c j := by sorrySource