Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

`BookProof.ChapterF8.twoLevelHash_total` {d k K : ℕ} (h : Fin d → Fin k) (g : Fin k → Fin K) (x : Fin d → ℝ) : twoLevelHash h g x ∈ singleExcitation K

Proved
BookProof.ChapterF8.twoLevelHash_total

by leonardopedro · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterF8.

BookProof.ChapterF8.twoLevelHash_total {d k K : ℕ} (h : Fin d → Fin k) (g : Fin k → Fin K) (x : Fin d → ℝ) : twoLevelHash h g x ∈ singleExcitation K

Formalization note: Lean 4 identifier BookProof.ChapterF8.twoLevelHash_total.

Preamble
-- Generated from ChapterF8.lean — theorem BookProof.ChapterF8.twoLevelHash_total
import Mathlib
import Definitions.Def_ChapterF8
import Definitions.Def_ChapterNavierStokesFockManyMode
open BookProof.NavierStokesFlow.FockManyMode
open BookProof.ChapterF8


noncomputable section

open scoped BigOperators
Formal statement
theorem BookProof.ChapterF8.twoLevelHash_total {d k K : ℕ} (h : Fin d → Fin k) (g : Fin k → Fin K)
    (x : Fin d → ℝ) : twoLevelHash h g x ∈ singleExcitation K := by sorry

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