Mathematics Combinatorics From Rs

Combinatorial families and their counts

Combinatorics is the mathematics of counting and arranging discrete objects. The five classical families are permutations (ordered arrangements), combinations (selections without order), partitions (ways to split a set into nonempty blocks), paths (routes through a grid), and Young tableaux (number shapes with rows and columns of boxes). These five families are the standard objects of enumerative combinatorics, and a machine-checked library of formal theorems proves that there are exactly five of them.

The central numerical fact is the binomial coefficient C(8,4), the number of ways to choose 4 objects from 8. The library proves that C(8,4) = 70, that this exceeds 45, and that it equals twice C(7,3) = 35. The number 70 is the maximum binomial coefficient for 8 items, and it appears in the framework as the count that sits above a certain gap value of 45, which itself relates to a structural constant in the Recognition Science account.

In Recognition Science, the framework models a discrete record of events called a ledger, and the number 8 arises from an eight-tick cycle that the framework derives from its cost function. The combinatorial module connects this cycle to classical counting: with 8 ticks, choosing half of them gives 70 possibilities, the largest such count. The framework also notes that the fifth Catalan number is 42 and the fifth Bell number is 52, both near the same gap value of 45, though those nearness claims are observations rather than proved equalities.

The library's contribution is a compact certificate: it packages the five-family count and the C(8,4) = 70 identity into a single structure, checked by computation with no unproved assumptions. What this establishes in plain language is that the framework's eight-tick cycle produces a definite, provable combinatorial fact, and that the five classical families form a complete list under the framework's own definition.

theorem combinatoricsFamilyCount : Fintype.card CombinatoricsFamily = 5 := by decide

/-- C(8,4) = 70. -/
theorem choose84_eq_70 : Nat.choose 8 4 = 70 := by decide

/-- C(8,4) = 70 > gap45 = 45. -/
theorem choose84_gt_gap45 : Nat.choose 8 4 > 45 := by decide

/-- C(8,4) = 2 × 35 = 2 × C(7,3). -/
theorem choose84_doubled : Nat.choose 8 4 = 2 * Nat.choose 7 3 := by decide

What this page does not claim

The module does not prove that the five families are the only combinatorial objects in all of mathematics. The nearness of Catalan number 42 or Bell number 52 to 45 is not a proved equality. The module does not derive the eight-tick cycle itself; it takes that as an input from the framework.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: