Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.1 — exact-cover orderings are exactly those with Ci,σ=iC_{i,\sigma} = iCi,σ​=i on [4h][4h][4h]

Proved
CountOrderings.NFree.lemma_6_1

by Shuze Chen · Nov 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricslinear-extensionsp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let III be an instance of #X3C with nnn sets and ∣U∣=3h|U| = 3h∣U∣=3h, satisfying the standing assumptions (every element of UUU lies in some set, and h<nh < nh<n). Let σ∈Ωle\sigma \in \Omega_{le}σ∈Ωle​. Then:

  1. If σ∈Ωxc(X)\sigma \in \Omega_{xc}(X)σ∈Ωxc​(X) for some exact cover XXX, then
Ci,σ=i(1≤i≤4h)andCi,σ<i(4h+1≤i≤4n).C_{i,\sigma} = i \quad (1 \le i \le 4h) \qquad\text{and}\qquad C_{i,\sigma} < i \quad (4h+1 \le i \le 4n).Ci,σ​=i(1≤i≤4h)andCi,σ​<i(4h+1≤i≤4n).
  1. If σ\sigmaσ induces no exact cover, then the set Bσ={i∈{1,…,4h}∣Ci,σ<i}B_\sigma = \{ i \in \{1, \dots, 4h\} \mid C_{i,\sigma} < i\}Bσ​={i∈{1,…,4h}∣Ci,σ​<i} is non-empty.

In the proof of Theorem 6.3, a factor i+q Ci,σi + q\, C_{i,\sigma}i+qCi,σ​ of χσ(q)\chi_\sigma(q)χσ​(q) vanishes at q=−1q = -1q=−1 exactly when Ci,σ=iC_{i,\sigma} = iCi,σ​=i; the lemma says that χσ\chi_\sigmaχσ​ has a pole of order 4h4h4h at q=−1q = -1q=−1 exactly for the orderings that induce an exact cover, and of smaller order otherwise.

Formalization Note. Quantities as in CountOrderings.NFree.Reduction; "σ\sigmaσ induces no exact cover" is "there is no X∈X3C(I)X \in \mathrm{X3C}(I)X∈X3C(I) with σ∈Ωxc(X)\sigma \in \Omega_{xc}(X)σ∈Ωxc​(X)".

Differences from the source:

  • generalization: a family S={S1,…,Sn}\mathcal{S} = \{S_1, \dots, S_n\}S={S1​,…,Sn​} of nnn (distinct) 3-sets → an indexed family S0,…,Sn−1S_0, \dots, S_{n-1}S0​,…,Sn−1​ in which two indices may carry the same 3-set; reason: the lemma only uses indices; for distinct sets this is exactly the paper's instance.
  • encoding: Ωle\Omega_{le}Ωle​ defined as {σ∣#LE(PI,q)σ>0}\{\sigma \mid \#\mathrm{LE}(P_{I,q})_\sigma > 0\}{σ∣#LE(PI,q​)σ​>0} → the linear extensions of the edge poset of E′E'E′; reason: the paper proves the two sets equal on p. 16.
  • encoding: sets, universe elements and ordering positions numbered from 1 → zero-based Fin indices, with position p represented in rho and Ccount by p + 1 and the product index i still starting at 1; reason: bijective relabeling preserves the last i edges and every count.
Preamble
import Mathlib
import Definitions.Def_CountOrderings_NFree_Reduction
Formal statement
namespace CountOrderings.NFree

theorem lemma_6_1 (I : X3CInstance) (hI : I.Standing) (σ : Fin (4 * I.n) ≃ OrigEdge I)
    (hσ : σ ∈ omegaLE I) :
    (∀ X ∈ I.exactCovers, σ ∈ omegaXC I X →
        (∀ i ∈ Finset.Icc 1 (4 * I.h), Ccount σ i = i) ∧
          ∀ i ∈ Finset.Icc (4 * I.h + 1) (4 * I.n), Ccount σ i < i) ∧
      ((¬ ∃ X ∈ I.exactCovers, σ ∈ omegaXC I X) →
        ((Finset.Icc 1 (4 * I.h)).filter (fun i => Ccount σ i < i)).Nonempty) := by sorry

end CountOrderings.NFree
Source
Arenas, Schild and Subercaseaux, Hardness of Counting Orderings: Taking Gadget Amplification to the Limit, STOC 2027 submission, p. 18 (PDF p. 19), Lemma 6.1; proof in Appendix A.10, p. 35 (PDF p. 36)
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 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