Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tian–Yuan–Zhang Theorem 3.5(2), reading A (n≡5 mod 8n\equiv 5\bmod 8n≡5mod8)

Open
ZInQ.Literature.tyzThm35ReadingA

by LG · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theoryz-is-diophantine-in-q

Tian–Yuan–Zhang's Theorem 3.5(2) for n≡5(mod8)n\equiv 5\pmod 8n≡5(mod8) in reading A, in the case L(n)=0\mathcal{L}(n)=0L(n)=0 of its hypothesis. For squarefree d≡5(mod8)d\equiv 5\pmod 8d≡5(mod8), if an entire continuation FFF of L(Cd,s)L(C_d,s)L(Cd​,s) vanishes to order at least 222 at s=1s=1s=1, then both genus sums T5a(d)T_{5a}(d)T5a​(d) and T5b(d)T_{5b}(d)T5b​(d) are even (zero in Z/2Z\mathbb{Z}/2\mathbb{Z}Z/2Z). Reading A admits the decomposition with d1=1d_1=1d1​=1, counting each set partition of the primes once. This is the deep analytic input of CR3_33​; the repository's Proposition N derives it from unambiguous results of the paper. Literature: Tian–Yuan–Zhang, Asian J. Math. 21 (2017), arXiv:1411.4728.

Preamble
import Mathlib
import Definitions.Def_ZInQLiterature
Formal statement
theorem ZInQ.Literature.tyzThm35ReadingA : ZInQ.Literature.TYZThm35ReadingA := by sorry
Source
https://github.com/elliotglazer/diophantine-z-q/blob/964d7dd71f253091dbc5eac793b78cc56d1fcc73/ZInQKernel/Hypotheses/CR3Literature.lean#L98-L108
Read-back

What the Lean code literally says, in plain math · glm

The theorem asserts TYZThm35ReadingA\mathrm{TYZThm35ReadingA}TYZThm35ReadingA: for every natural number ddd with d mod 8=5d\bmod 8=5dmod8=5 and ddd squarefree, and for every entire continuation FFF of L(Cd,s)L(C_d,s)L(Cd​,s), if the analytic order of vanishing of FFF at 111 is at least 222, then T5aCl(d)=0\mathrm{T5aCl}(d)=0T5aCl(d)=0 and T5bCl(d)=0\mathrm{T5bCl}(d)=0T5bCl(d)=0 in Z/2Z\mathbb{Z}/2\mathbb{Z}Z/2Z. Here T5aCl\mathrm{T5aCl}T5aCl sums the products of genus class numbers over partitions with exactly one block ≡5(mod8)\equiv5\pmod8≡5(mod8) and all blocks ≡5\equiv5≡5 or 1(mod8)1\pmod81(mod8), and T5bCl\mathrm{T5bCl}T5bCl sums over partitions with one block ≡7\equiv7≡7, one block ≡3\equiv3≡3, and all blocks ≡7,3,1(mod8)\equiv7,3,1\pmod8≡7,3,1(mod8).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me