Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Case (4) of the proof of Theorem 1.1: a generator acting by translation

Proved
CayleyErdosGyarfas.affine_case_four

by burkh4rt · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

cayley-graphscombinatoricscycleserdos-gyarfasgroup-theory

Let GGG be a group of odd order acting faithfully on a field KKK through an injective homomorphism φ:G→Sym⁡(K)\varphi : G \to \operatorname{Sym}(K)φ:G→Sym(K), and suppose 2≠02 \ne 02=0 in KKK. Let S⊆GS \subseteq GS⊆G be closed under inverses, let s,t∈Ss, t \in Ss,t∈S, and let r∈Kr \in Kr∈K with r≠0r \ne 0r=0 and r≠1r \ne 1r=1. If

φ(s)(z)=rz,φ(t)(z)=z+1(z∈K),\varphi(s)(z) = r z, \qquad \varphi(t)(z) = z + 1 \qquad (z \in K),φ(s)(z)=rz,φ(t)(z)=z+1(z∈K),

then Cay⁡(G,S)\operatorname{Cay}(G,S)Cay(G,S) contains a symmetric figure-eight. Here Cay⁡(G,S)\operatorname{Cay}(G,S)Cay(G,S) has vertex set GGG, distinct g,hg, hg,h being adjacent when h=guh = guh=gu or g=hug = hug=hu for some u∈Su \in Su∈S, and a symmetric figure-eight is a pair of cycles of a common length 2n2^n2n, n≥2n \ge 2n≥2, that meet in exactly one vertex, one a left translate of the other up to the choice of starting vertex (definition CayleyErdosGyarfas_HasSymmetricFigureEight).

This is case (4) of the proof of Theorem 1.1 of the source paper: one of the two generators has trivial image modulo the minimal normal subgroup, and the generators are normalized to s=xs = xs=x and t=τ1t = \tau_1t=τ1​ in the affine group of a finite field.

Formalization Note Odd order is Odd (Nat.card G); since Nat.card is 000 on infinite types, this hypothesis also forces GGG to be finite. Generation by SSS is not assumed.

Preamble
import Definitions.Def_CayleyErdosGyarfas_HasSymmetricFigureEight
import Mathlib.Algebra.Field.Basic
import Mathlib.GroupTheory.Perm.Basic
import Mathlib.SetTheory.Cardinal.Finite
Formal statement
namespace CayleyErdosGyarfas

theorem affine_case_four {G K : Type*} [Group G] [Field K]
    (hodd : Odd (Nat.card G))
    (φ : G →* Equiv.Perm K) (hφ : Function.Injective φ)
    (S : Set G) (hinv : ∀ s ∈ S, s⁻¹ ∈ S)
    (s t : G) (hs : s ∈ S) (ht : t ∈ S)
    (r : K) (hr0 : r ≠ 0) (hr1 : r ≠ 1) (h2 : (2:K) ≠ 0)
    (hsact : ∀ z, φ s z = r*z) (htact : ∀ z, φ t z = z+1) :
    HasSymmetricFigureEight S := by sorry

end CayleyErdosGyarfas
Source
M. C. Burkhart, Odd-ordered Cayley graphs satisfy Erdős–Gyárfás, arXiv:2611.05060v1 (https://arxiv.org/abs/2611.05060v1), §2, p. 5, proof of Theorem 1.1, case (4). Lean statement: https://github.com/burkh4rt/Cayley-Erdos-Gyarfas-Formalized/blob/111aa033acfab934208ce6b2e0cebecacfd6bd24/CayleyErdosGyarfas/AffineCaseFour.lean#L355-L427 (Palomar entry PALOMAR-2026-11-04-000015).

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