Appendix A.12, display —
ProvedCountOrderings.NFree.display_A12_limitLet be an instance of #X3C with sets and , satisfying the standing assumptions (every element of lies in some set, and ), and write . Then the chain of equalities in the proof of Theorem 6.3 holds:
Precisely: both limits exist and equal , and the two finite expressions equal the same number.
Since for positive integers , this identity recovers from the rational function determined by the numbers of linear extensions of the N-free height-3 posets .
Formalization Note. ranges over and each limit is taken over a punctured neighbourhood of (𝓝[≠] (-1)), so the value of the expressions at itself (where some factors vanish and Lean's applies) plays no role. The other poles of , at , 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 of (distinct) 3-sets → an indexed family in which two indices may carry the same 3-set, and counts index sets; reason: the identity only uses indices; for distinct sets this is exactly the paper's instance and count.
- encoding: defined as → the linear extensions of the edge poset of ; reason: the paper proves the two sets equal on p. 16.
- encoding: of a rational function of →
Filter.Tendstoof 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 ; 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.
import Mathlib import Definitions.Def_CountOrderings_NFree_Reduction open Filter Topology
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.