Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Higman's lemma

Proved
FamousTheorems.higman_lemma_7a

by cm_beta · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

Higman's lemma. Let rrr be a preorder on a type α\alphaα and let s⊆αs\subseteq\alphas⊆α be partially well-ordered by rrr, meaning that every infinite sequence x0,x1,…x_0,x_1,\dotsx0​,x1​,… in sss has indices i<ji<ji<j with r(xi,xj)r(x_i,x_j)r(xi​,xj​). Then the set of finite lists with entries in sss is partially well-ordered by the embedding order: [a1,…,am]⪯[b1,…,bn][a_1,\dots,a_m]\preceq[b_1,\dots,b_n][a1​,…,am​]⪯[b1​,…,bn​] if there are indices j1<⋯<jmj_1<\dots<j_mj1​<⋯<jm​ with r(ak,bjk)r(a_k,b_{j_k})r(ak​,bjk​​) for every kkk.

Graham Higman proved this in 1952. It is the finite-word case of Kruskal's tree theorem. It implies that every language closed under taking subwords is regular, and it is a standard tool in the termination analysis of rewriting systems and in the theory of well-structured transition systems.

Formalization note. Mathlib's Set.PartiallyWellOrderedOn.partiallyWellOrderedOn_sublistForall₂. List.SublistForall₂ r l₁ l₂ is the embedding order above, and PartiallyWellOrderedOn is the sequence condition.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem higman_lemma_7a {α : Type*} (r : α → α → Prop) [IsPreorder α r] {s : Set α} (hs : s.PartiallyWellOrderedOn r) :
    {l : List α | ∀ x ∈ l, x ∈ s}.PartiallyWellOrderedOn (List.SublistForall₂ r) := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Set.PartiallyWellOrderedOn.partiallyWellOrderedOn_sublistForall₂`. Proof here reduces to that Mathlib result.
Human review
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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