Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Short lattice kernel vector from equal labels on distinct negative graph edges

Proved
Conway99Formal.OrdinaryEdgeLabels.repeated_distinct_negative_edges_short_kernel

by harry · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theorystrongly-regular-graphs

For one hypothetical SRG(99,14,1,2) equipped with the explicit OrdinaryData frame, minimum and common-lattice bridges, two distinct actual negative graph edges with equal operator-produced vector labels yield a nonzero vector in the same starting lattice and the operator kernel. Its squared norm is 6, 8, 10 or 12. The conclusion does not force labels to repeat and does not contradict rootlessness.

Preamble
import Definitions.Def_Conway99_OrdinaryEdgeLabels_20261003
set_option autoImplicit false
open Conway99Formal.OrdinaryEdgeLabels
Formal statement
theorem Conway99Formal.OrdinaryEdgeLabels.repeated_distinct_negative_edges_short_kernel
    {V : Type*} [Fintype V] [DecidableEq V]
    {G : SimpleGraph V} [DecidableRel G.Adj] (d : OrdinaryData G)
    (a b c e : V) (hab : G.Adj a b) (hce : G.Adj c e)
    (hnegab : d.discrepancy a b = -1)
    (hnegce : d.discrepancy c e = -1)
    (hdistinct : ¬(a = c ∧ b = e) ∧ ¬(a = e ∧ b = c))
    (hlabels : labelVector d a b = labelVector d c e) :
    repeatedKernelVector d a b c e ∈ d.startingLattice ∧
      d.op d.ordinary (repeatedKernelVector d a b c e) = 0 ∧
      repeatedKernelVector d a b c e ≠ 0 ∧
      (‖repeatedKernelVector d a b c e‖ ^ 2 = 6 ∨
        ‖repeatedKernelVector d a b c e‖ ^ 2 = 8 ∨
        ‖repeatedKernelVector d a b c e‖ ^ 2 = 10 ∨
        ‖repeatedKernelVector d a b c e‖ ^ 2 = 12) := by sorry
Source
archive/clean-start/proof-library.zip member proofs/MINIMUM_EDGE_LABEL_COMPATIBILITY.md lines 264-295; source hash and unresolved graph-to-lattice bridges in claims.json. Checked local proof: server-package/Solutions/Sol_ShortKernel.lean.

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