Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Package a checked QHNet with exact histogram moments into BitNetMomStmtG

Proved
IntMul.Kappa.R6.Bit.BitNetMomStmtG_of_eq

by Ethan Cheung Wang · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theoryinteger-multiplicationturing-machines

Packaging lemma for moment-dominated bit networks.

Let WbW_bWb​, mbm_bmb​, TTT and q0q_0q0​ be natural numbers, let hbh_bhb​ be a child-width histogram, and let

C:QHNet(Z/2Z, Wb, T, mb)C:\mathrm{QHNet}(\mathbb{Z}/2\mathbb{Z},\,W_b,\,T,\,m_b)C:QHNet(Z/2Z,Wb​,T,mb​)

be a bit network such that:

  1. CCC runs correctly;
  2. for every prime q>q0q>q_0q>q0​ and every exponent fff, the edge and formal checks hold at qfq^fqf;
  3. for every τ∈(0,1]\tau\in(0,1]τ∈(0,1],
histMoment(C.hist, mb, τ)=histMoment(hb, mb, τ).\mathrm{histMoment}(C.\mathrm{hist},\,m_b,\,\tau)=\mathrm{histMoment}(h_b,\,m_b,\,\tau).histMoment(C.hist,mb​,τ)=histMoment(hb​,mb​,τ).

Then BitNetMomStmtG Wb mb hb\mathrm{BitNetMomStmtG}\,W_b\,m_b\,h_bBitNetMomStmtGWb​mb​hb​ holds.

This is the final packaging step of the proved round-six argument bitNetR6_mom (where exact moment equality is weakened to ≤\le≤). It lets round-seven/eight bit-network constructions reduce to (i) producing a checked network and (ii) matching histogram moments, without re-unfolding the BitNetMomStmtG predicate.

Formalization Note. BitNetMomStmtG and QHNet are from IntMul_Kappa_RG_Defs.

Preamble
import Definitions.Def_IntMul_Kappa_RG_Defs

set_option autoImplicit false
set_option relaxedAutoImplicit false
Formal statement
namespace IntMul.Kappa.R6.Bit

open IntMul.Kappa

/-- If a concrete QH-network runs correctly, passes edge/formal checks at large prime powers,
and its child-width moments agree exactly with a target histogram `hb`, then `BitNetMomStmtG`
holds for `(Wb, mb, hb)`. This is the packaging step used at the end of
`bitNetR6_mom` (`mom_eq.le`). -/
theorem BitNetMomStmtG_of_eq (Wb mb T q₀ : ℕ) (hb : List (ℕ × ℕ))
    (C : QHNet (ZMod 2) Wb T mb)
    (hRun : C.RunsOK)
    (hOK : ∀ q, q.Prime → q₀ < q → ∀ f, C.EdgesOK (q ^ f) ∧ C.FormalOK (q ^ f))
    (hmom : ∀ τ : ℝ, 0 < τ → τ ≤ 1 → histMoment C.hist mb τ = histMoment hb mb τ) :
    BitNetMomStmtG Wb mb hb := by
  sorry

end IntMul.Kappa.R6.Bit
Source
Prove2me IntMul.Kappa.R6.Bit.NB.bitNetR6_mom (submission packaging `mom_eq.le` into BitNetR6MomStmt / BitNetMomStmtG); Def_IntMul_Kappa_RG_Defs

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me