Mathematics Combinatorics From Rs Combinatorics Family Count

Counting the families

Combinatorics is the mathematics of counting and arranging. Its objects come in families: permutations (orderings of a list), combinations (selections without regard to order), partitions (ways to split a set into nonempty blocks), paths (routes through a grid), and Young tableaux (fillings of a shape with numbers). These five families are a standard inventory in the field, each with its own theory and its own counting formulas.

In Recognition Science, the framework's machine-checked library of formal theorems defines a type called CombinatoricsFamily, a discrete record of exactly these five families, and proves that the number of such families is five. The proof is a direct computation: the theorem combinatoricsFamilyCount states that the cardinality of the type equals 5, and the proof is by decide, meaning the computer checks the finite case by case. This is a theorem in the sense that it is formally verified, but its content is definitional: the framework chooses to model the five families as a single type, and the count follows from that choice.

The same file also proves several identities about the binomial coefficient C(8,4), which equals 70. It shows C(8,4) = 70, that 70 is greater than 45 (a number the framework calls the gap), and that C(8,4) = 2 × C(7,3). These are all true statements of arithmetic, verified by computation. The framework's interest in 70 is that it relates to the number 8, which the framework derives from an eight-tick recognition cycle, and to 45, but the identities themselves are ordinary combinatorial facts, not new mathematics.

What the declaration does not claim is the important part. The count of five families is a modeling choice, not a proof that the universe must have five combinatorial families. The framework does not derive the number 5 from its forcing chain; it simply names five classical families and counts them. Similarly, the identity C(8,4) = 70 does not establish any physical law; it is a computation about binomial coefficients. The framework's library proves these statements, but the statements are about the framework's own definitions, not about external reality.

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

inductive CombinatoricsFamily where
  | permutations | combinations | partitions | paths | youngTableaux
  deriving DecidableEq, Repr, BEq, Fintype

/-- 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 number 5 is not derived from any physical principle; it is a definitional choice. The identity C(8,4) = 70 does not establish any physical law or empirical fact. No claim is made that these five families are the only possible combinatorial families.

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: