Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

srcS is injective on t < v (QHNetRecR SRC slots)

Proved
IntMul.Kappa.R8.Bit.Oppbank.srcS_inj

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

bitformalokr8

In the published QHNetRecR pack, the source-slot map srcS(t)=fieldOf(SRC,16,t)\mathrm{srcS}(t) = \mathrm{fieldOf}(\mathrm{SRC}, 16, t)srcS(t)=fieldOf(SRC,16,t) is injective for t<vt < vt<v (with v=1771v = 1771v=1771). The 1771 SRC field values are pairwise distinct. The formal certificate is a bitset/popcount argument: the folded OR-bitset of the concrete srcS values has popcount 1771, hence the list is nodup, hence srcS is injective on List.range v. This is not a monolithic List.Nodup decision on the 1771 fieldOf values.

Preamble
import Definitions.Def_IntMul_Kappa_R8_Data_BitOppbankQHNetRecR
import Mathlib

set_option autoImplicit false
set_option relaxedAutoImplicit false
set_option maxHeartbeats 8000000
set_option maxRecDepth 1000000
Formal statement
namespace IntMul.Kappa.R8.Bit.Oppbank

/-- The source-slot map `QHNetRecR.srcS t = fieldOf SRC 16 t` is injective
on `t < v`. Proved by a cheap bitset/popcount certificate (not a
monolithic `List.Nodup` decision on the 1771 `fieldOf` values). -/
theorem srcS_inj {t t' : ℕ} (ht : t < v) (ht' : t' < v)
    (heq : QHNetRecR.srcS t = QHNetRecR.srcS t') : t = t' := by
  sorry

end IntMul.Kappa.R8.Bit.Oppbank
Source
FormalOK cascade, Round-8, variant-R carrier QHNetRecR (definition 97df824b), SRC table of WireLayout v=1771; injectivity needed for copyoND MovesV after preF.

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