Power-sum moments of the half-system T_k in F_p #
For a prime p > 7, m = (p-1)/2 and k <= m with 8k(k+1)+1 = 0 in F_p, the half-system T_k = {1,...,k} u {-(k+1),...,-m} of F_p has odd power-sum moments M_3 = -1/128, M_5 = 7/1536, M_7 = -245/49152 (all in F_p). The proof reduces M_j(T_k) = 2F_j(k) - F_j(m) for odd j, proves the Faulhaber closed forms for j = 3, 5, 7 over the integers by induction, and substitutes k(k+1) = -1/8 and m(m+1) = -1/4. The existence and uniqueness of k (needs (2|p) = 1), the half-system and centring claims and the semigroup S_{T_k} = <3,5,7> are NOT formalized here; k is taken as a hypothesis.
Main results #
P3a.moments_Tk: M_3, M_5, M_7 of T_k equal -1/128, 7/1536, -245/49152 in F_p for p > 7P3a.moment_Tk_odd: M_j(T_k) = 2F_j(k) - F_j(m) for odd j
References #
- C. Marín, The order generated by a column of the SU(n)ₖ S-matrix is locally a numerical semigroup
ring (Part II), Zenodo (2026), doi:10.5281/zenodo.22864267,
prop:familia.
The half-system T_k = {1,…,k} ∪ {-(k+1),…,-m} in 𝔽_p, m = (p-1)/2.
Equations
- P3a.Tk p k = Finset.image (fun (r : ℕ) => ↑r) (Finset.Icc 1 k) ∪ Finset.image (fun (r : ℕ) => -↑r) (Finset.Icc (k + 1) ((p - 1) / 2))
Instances For
The j-th power-sum moment of a finite subset of 𝔽_p.
Equations
- P3a.moment T j = ∑ t ∈ T, t ^ j
Instances For
theorem
P3a.tk_disjoint
{p : ℕ}
(hp : 2 < p)
(k : ℕ)
:
Disjoint (Finset.image (fun (r : ℕ) => ↑r) (Finset.Icc 1 k))
(Finset.image (fun (r : ℕ) => -↑r) (Finset.Icc (k + 1) ((p - 1) / 2)))