Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix A.12, display — lim⁡q→−1(q+1)4h∑σ∈Ωleχσ(q)=4−h3h−n #X3C(I)\lim_{q\to-1}(q+1)^{4h}\sum_{\sigma\in\Omega_{le}}\chi_\sigma(q) = 4^{-h}3^{h-n}\,\#X3C(I)limq→−1​(q+1)4h∑σ∈Ωle​​χσ​(q)=4−h3h−n#X3C(I)

Proved
CountOrderings.NFree.display_A12_limit

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), and write χσ(q)=∏i=14n1/(i+q Ci,σ)\chi_\sigma(q) = \prod_{i=1}^{4n} 1/(i + q\, C_{i,\sigma})χσ​(q)=∏i=14n​1/(i+qCi,σ​). Then the chain of equalities in the proof of Theorem 6.3 holds:

lim⁡q→−1(q+1)4h∑σ∈Ωleχσ(q)=lim⁡q→−1∑X∈X3C(I) ∑σ∈Ωxc(X)(q+1)4hχσ(q)=1(4h)!∑X∈X3C(I) ∑σ∈Ωxc(X) ∏i=4h+14n1i−Ci,σ=1(4h)!∑X∈X3C(I)(4h)!4h3n−h=4−h 3h−n #X3C(I).\lim_{q\to-1} (q+1)^{4h} \sum_{\sigma\in\Omega_{le}} \chi_\sigma(q) = \lim_{q\to-1} \sum_{X\in \mathrm{X3C}(I)}\ \sum_{\sigma\in\Omega_{xc}(X)} (q+1)^{4h}\chi_\sigma(q) = \frac{1}{(4h)!}\sum_{X\in \mathrm{X3C}(I)}\ \sum_{\sigma\in\Omega_{xc}(X)}\ \prod_{i=4h+1}^{4n}\frac{1}{i - C_{i,\sigma}} = \frac{1}{(4h)!}\sum_{X\in \mathrm{X3C}(I)} \frac{(4h)!}{4^h 3^{n-h}} = 4^{-h}\, 3^{h-n}\, \#\mathrm{X3C}(I).q→−1lim​(q+1)4hσ∈Ωle​∑​χσ​(q)=q→−1lim​X∈X3C(I)∑​ σ∈Ωxc​(X)∑​(q+1)4hχσ​(q)=(4h)!1​X∈X3C(I)∑​ σ∈Ωxc​(X)∑​ i=4h+1∏4n​i−Ci,σ​1​=(4h)!1​X∈X3C(I)∑​4h3n−h(4h)!​=4−h3h−n#X3C(I).

Precisely: both limits exist and equal 4−h3h−n#X3C(I)4^{-h} 3^{h-n} \#\mathrm{X3C}(I)4−h3h−n#X3C(I), and the two finite expressions equal the same number.

Since ∑σ∈Ωleχσ(q)=#LE(PI,q)/(4n+3hq+nq)!\sum_{\sigma \in \Omega_{le}} \chi_\sigma(q) = \#\mathrm{LE}(P_{I,q})/(4n+3hq+nq)!∑σ∈Ωle​​χσ​(q)=#LE(PI,q​)/(4n+3hq+nq)! for positive integers qqq, this identity recovers #X3C(I)\#\mathrm{X3C}(I)#X3C(I) from the rational function determined by the numbers of linear extensions of the N-free height-3 posets PI,qP_{I,q}PI,q​.

Formalization Note. qqq ranges over R\mathbb{R}R and each limit is taken over a punctured neighbourhood of −1-1−1 (𝓝[≠] (-1)), so the value of the expressions at q=−1q = -1q=−1 itself (where some factors i+qCi,σi + q C_{i,\sigma}i+qCi,σ​ vanish and Lean's 1/0=01/0 = 01/0=0 applies) plays no role. The other poles of χσ\chi_\sigmaχσ​, at q=−i/Ci,σ≠−1q = -i/C_{i,\sigma} \neq -1q=−i/Ci,σ​=−1, are isolated and do not affect the limit. The chain is stated as four facts, each ending in the final value.

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, and #X3C(I)\#\mathrm{X3C}(I)#X3C(I) counts index sets; reason: the identity only uses indices; for distinct sets this is exactly the paper's instance and count.
  • 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: lim⁡q→−1\lim_{q\to-1}limq→−1​ of a rational function of qqq → Filter.Tendsto of the real function along the punctured neighbourhood 𝓝[≠] (-1); reason: the standard meaning of the limit; the punctured filter ignores the value at the pole.
  • encoding: a chain of five equal expressions → a conjunction of four statements, each equating one expression (or the existence and value of its limit) with the final value 4−h3h−n#X3C(I)4^{-h}3^{h-n}\#\mathrm{X3C}(I)4−h3h−n#X3C(I); reason: equivalent to the chain.
  • 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

open Filter Topology
Formal statement
namespace CountOrderings.NFree

theorem display_A12_limit (I : X3CInstance) (hI : I.Standing) :
    Tendsto (fun q : ℝ => (q + 1) ^ (4 * I.h) * ∑ σ ∈ omegaLE I, chi σ q) (𝓝[≠] (-1))
        (𝓝 ((4 : ℝ) ^ (-(I.h : ℤ)) * (3 : ℝ) ^ ((I.h : ℤ) - I.n) * I.numExactCovers)) ∧
      Tendsto (fun q : ℝ => ∑ X ∈ I.exactCovers, ∑ σ ∈ omegaXC I X, (q + 1) ^ (4 * I.h) * chi σ q)
        (𝓝[≠] (-1))
        (𝓝 ((4 : ℝ) ^ (-(I.h : ℤ)) * (3 : ℝ) ^ ((I.h : ℤ) - I.n) * I.numExactCovers)) ∧
      1 / ((4 * I.h).factorial : ℝ) * ∑ X ∈ I.exactCovers, ∑ σ ∈ omegaXC I X,
          ∏ i ∈ Finset.Icc (4 * I.h + 1) (4 * I.n), 1 / ((i : ℝ) - (Ccount σ i : ℝ)) =
        (4 : ℝ) ^ (-(I.h : ℤ)) * (3 : ℝ) ^ ((I.h : ℤ) - I.n) * I.numExactCovers ∧
      1 / ((4 * I.h).factorial : ℝ) * ∑ _X ∈ I.exactCovers,
          ((4 * I.h).factorial : ℝ) / ((4 : ℝ) ^ I.h * (3 : ℝ) ^ (I.n - I.h)) =
        (4 : ℝ) ^ (-(I.h : ℤ)) * (3 : ℝ) ^ ((I.h : ℤ) - I.n) * I.numExactCovers := by sorry

end CountOrderings.NFree
Source
Arenas, Schild and Subercaseaux, Hardness of Counting Orderings: Taking Gadget Amplification to the Limit, STOC 2027 submission, pp. 37–38 (PDF pp. 38–39), Appendix A.12, display in the proof of Theorem 6.3
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