Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit nonisomorphic directed Cayley triples at every positive scale

Proved
Couret.CayleyDoublet.cayley_twelve_mul_nonisomorphic

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

For a natural r>0, put G=Z/(12r), S={1,1+2r,1+8r} and T={1,1+4r,1+10r}, all entries taken modulo 12r. No bijection f:G→G can satisfy

[y−x∈S]  ⟺  [f(y)−f(x)∈T](x,y∈G).[y-x\in S]\iff[f(y)-f(x)\in T]\quad(x,y\in G).[y−x∈S]⟺[f(y)−f(x)∈T](x,y∈G).

Thus these directed Cayley graphs are nonisomorphic under arbitrary vertex bijections, not only affine maps.

Preamble
import Definitions.Def_Couret_CayleyDoubletCore_59125eeb43b1
import Mathlib
import Theorems.Thm_Couret_CayleyDoublet_noIso_of_two_colours
import Definitions.Def_Couret_CayleyDoubletCore_59125eeb43b1

set_option autoImplicit false

/-!
CAYLEY-TWO-COLOUR-ZMOD — arithmetic specialization, 2026-10-14.

This candidate closes the concrete modular arithmetic premises of the
already compiled, conditional noIso_of_two_colours theorem.

Status: NEW CANDIDATE. Do not report as compiled without the
cayley-two-colour-family-lean workflow passing on its exact commit SHA.
Only directed graph nonisomorphism is intended; no academic priority.
-/

namespace Couret.CayleyDoublet



Formal statement

theorem cayley_twelve_mul_nonisomorphic
    (r : ℕ) (hr : 0 < r)
    (f : ZMod (12 * r) ≃ ZMod (12 * r))
    (hf : ∀ x y : ZMod (12 * r),
      CayleyArc (TripleSupport (1 : ZMod (12 * r))
        ((1 + 2 * r : ℕ) : ZMod (12 * r))
        ((6 * r : ℕ) : ZMod (12 * r))) x y ↔
      CayleyArc (TripleSupport (1 : ZMod (12 * r))
        ((1 + 4 * r : ℕ) : ZMod (12 * r))
        ((6 * r : ℕ) : ZMod (12 * r))) (f x) (f y)) :
    False := by sorry



end Couret.CayleyDoublet
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/1483e8ae3e5491ee176364fe944c90c4341d40ff/research/correspondants_20261013/lean/CayleyTwoColourZMod.lean#L28-L142, lines 28–142; source file SHA-256 b9c53a814edc6573ecdb61d909b0988ad5b0154cde1bee9fcb4d39181b7464f1; theorem Couret.CayleyDoublet.cayley_twelve_mul_nonisomorphic

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