Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, display on p. 17 — #LE(PI,q)σ=(4n+3hq+nq)!∏i=14n1/(i+q Ci,σ)\#LE(P_{I,q})_\sigma = (4n+3hq+nq)!\prod_{i=1}^{4n} 1/(i+q\,C_{i,\sigma})#LE(PI,q​)σ​=(4n+3hq+nq)!∏i=14n​1/(i+qCi,σ​)

Proved
CountOrderings.NFree.display_p17_count

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 paper's standing assumptions (every element of UUU lies in some set, and h<nh < nh<n), and let q≥1q \ge 1q≥1 be an integer. For every ordering σ∈Ωle\sigma \in \Omega_{le}σ∈Ωle​ of the edge set E′E'E′, the number of linear extensions of the edge poset PI,qP_{I,q}PI,q​ whose projection down to E′E'E′ coincides with σ\sigmaσ is

#LE(PI,q)σ=(4n+3hq+nq)! ∏i=14n1i+q⋅Ci,σ,\#\mathrm{LE}(P_{I,q})_\sigma = (4n + 3hq + nq)!\ \prod_{i=1}^{4n} \frac{1}{i + q \cdot C_{i,\sigma}} ,#LE(PI,q​)σ​=(4n+3hq+nq)! i=1∏4n​i+q⋅Ci,σ​1​,

where Ci,σC_{i,\sigma}Ci,σ​ counts the groups of qqq copied edges attached to the last iii edges of σ\sigmaσ (definition CountOrderings.NFree.Reduction).

This is the first step of the proof of Theorem 6.3: fixing σ\sigmaσ turns the remaining constraints into a tree poset, and the hook-length formula (Lemma 2.2) counts its linear extensions. Summing over σ\sigmaσ expresses #LE(PI,q)/(4n+3hq+nq)!\#\mathrm{LE}(P_{I,q})/(4n+3hq+nq)!#LE(PI,q​)/(4n+3hq+nq)! as ∑σ∈Ωleχσ(q)\sum_{\sigma \in \Omega_{le}} \chi_\sigma(q)∑σ∈Ωle​​χσ​(q).

Formalization Note. The identity is stated in R\mathbb{R}R. Sets, universe elements and copies are indexed from 000; the position ppp of σ:{0,…,4n−1}→E′\sigma : \{0,\dots,4n-1\} \to E'σ:{0,…,4n−1}→E′ is the paper's position p+1p+1p+1.

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 construction and the count only use 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: the identity between rationals → the same identity in ℝ; reason: same value.
  • 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 display_p17_count (I : X3CInstance) (hI : I.Standing) (q : ℕ) (hq : 1 ≤ q)
    (σ : Fin (4 * I.n) ≃ OrigEdge I) (hσ : σ ∈ omegaLE I) :
    (linExtCountGiven I q σ : ℝ) =
      ((4 * I.n + 3 * I.h * q + I.n * q).factorial : ℝ) *
        ∏ i ∈ Finset.Icc 1 (4 * I.n), 1 / ((i : ℝ) + (q : ℝ) * (Ccount σ i : ℝ)) := by sorry

end CountOrderings.NFree
Source
Arenas, Schild and Subercaseaux, Hardness of Counting Orderings: Taking Gadget Amplification to the Limit, STOC 2027 submission, p. 17 (PDF p. 18), §6, display for #LE(P_{I,q})_σ
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