Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 7.13 — compactness: a countable structure whose finite substructures map to a finite B maps to B

Proved
AlgebraicPCSP.BLP.remark_7_13

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

compactnesshomomorphismsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1promise-csp

Let I\mathbf II be a relational structure with a countable (possibly infinite) universe III, and let B\mathbf BB be a similar structure with a finite universe. Suppose that for every finite set S⊆IS\subseteq IS⊆I, the substructure of I\mathbf II on SSS maps homomorphically to B\mathbf BB. Then

I→B.\mathbf I\to\mathbf B.I→B.

In the proof of Theorem 7.9 this turns homomorphisms from the finite pieces of the countable structure LP(A)\mathrm{LP}(\mathbf A)LP(A) into a single homomorphism LP(A)→B\mathrm{LP}(\mathbf A)\to\mathbf BLP(A)→B.

Formalization Note A homomorphism from the substructure on SSS is encoded as a map I→BI\to BI→B required to preserve only the tuples of I\mathbf II whose entries all lie in SSS; its values off SSS are irrelevant. The platform theorem PCSPBLPAff.Characterization.lemma_16 states the same conclusion without the countability hypothesis.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
Formal statement
namespace AlgebraicPCSP.BLP

open PCSPBLPAff.Symmetric

/-- Remark 7.13 (arXiv:1811.00970v3, pp. 47–48), compactness for countable structures: let `𝕀`
be a structure with a countable (possibly infinite) universe and `𝔹` a similar finite structure.
If every finite substructure of `𝕀` maps homomorphically to `𝔹`, then `𝕀` maps homomorphically
to `𝔹`. A homomorphism from the substructure on a finite set `S` is encoded as a map `I → B`
that is required to preserve only the tuples of `𝕀` with all entries in `S`. -/
theorem remark_7_13 {τ : Type} {ar : τ → ℕ} {I B : Type} [Countable I] [Finite B]
    (𝕀 : RelStruct τ ar I) (𝔹 : RelStruct τ ar B)
    (hfin : ∀ S : Finset I, ∃ σ : I → B,
      ∀ R : τ, ∀ t ∈ 𝕀.rel R, (∀ k, t k ∈ S) → σ ∘ t ∈ 𝔹.rel R) :
    ∃ σ : I → B, IsHom 𝕀 𝔹 σ := by sorry

end AlgebraicPCSP.BLP
Source
L. Barto, J. Bulín, A. Krokhin, J. Opršal, Algebraic approach to promise constraint satisfaction, arXiv:1811.00970v3, pp. 47–48, Remark 7.13
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