Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 16 (compactness for structures), p. 15 — if every finite induced substructure of F maps to a finite B, so does F

Proved
PCSPBLPAff.Characterization.lemma_16

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

compactnesshomomorphismp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relational-structures

Let F\mathbf FF and B\mathbf BB be relational structures with the same signature, on domains DDD and BBB, with BBB finite. Suppose that for every finite subset S⊆DS\subseteq DS⊆D, the substructure of F\mathbf FF induced on SSS admits a homomorphism to B\mathbf BB. Then F\mathbf FF admits a homomorphism to B\mathbf BB:

(∀S⊆D finite: F[S]→B) ⟹ F→B.\bigl(\forall S\subseteq D\ \text{finite}:\ \mathbf F[S]\to\mathbf B\bigr)\ \Longrightarrow\ \mathbf F\to\mathbf B.(∀S⊆D finite: F[S]→B) ⟹ F→B.

This generalization of the de Bruijn–Erdős theorem turns the instance-wise condition of Observation 15 into the single homomorphism FMBLP+Aff(A)→BF_{\mathcal M_{\mathrm{BLP+Aff}}}(\mathbf A)\to\mathbf BFMBLP+Aff​​(A)→B.

Formalization Note A homomorphism from F[S]\mathbf F[S]F[S] is encoded as a map D→BD\to BD→B that is required to preserve only the tuples of F\mathbf FF with all entries in SSS; its values off SSS are irrelevant. The page's hypothesis that F\mathbf FF is infinite is dropped: for finite F\mathbf FF the statement is immediate (take S=DS=DS=D), and the generalization lets the lemma apply to every free structure, including the empty one.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Characterization_Setting
Formal statement
namespace PCSPBLPAff.Characterization

/-- Lemma 16 (compactness for structures), p. 15: if `𝔹` is finite and every finite induced
substructure of `𝔽` admits a homomorphism to `𝔹`, then so does `𝔽`. A homomorphism from the
substructure induced on a finite set `S` is encoded as a map `D → B` that is checked only on
the tuples with all entries in `S`. -/
theorem lemma_16 {τ : Type} {ar : τ → ℕ} {D B : Type} [Finite B]
    (𝔽 : PCSPBLPAff.Symmetric.RelStruct τ ar D) (𝔹 : PCSPBLPAff.Symmetric.RelStruct τ ar B)
    (h : ∀ S : Finset D, ∃ σ : D → B,
      ∀ R : τ, ∀ t ∈ 𝔽.rel R, (∀ k, t k ∈ S) → σ ∘ t ∈ 𝔹.rel R) :
    ∃ σ : D → B, PCSPBLPAff.Symmetric.IsHom 𝔽 𝔹 σ := by sorry

end PCSPBLPAff.Characterization
Source
arXiv:1907.04383v3, Lemma 16, p. 15
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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