Encyclopedia Mathematics Mathematics Combinatorics From Rs Choose84 Doubled
ARTICLE 3 claims 3 theorems
Mathematics Combinatorics From Rs Choose84 Doubled
A machine-checked proof that choosing 4 items from 8 equals twice choosing 3 from 7, and why that identity matters in a framework built on an eight-step cycle.
The doubled combination
In mathematics, the binomial coefficient C(8,4) counts the number of ways to choose 4 objects from a set of 8. Its value is 70. The identity C(8,4) = 2 × C(7,3) means that choosing 4 from 8 gives exactly twice as many possibilities as choosing 3 from 7, which is 35. This is a simple arithmetic fact, verifiable by hand: 70 equals 2 times 35.
The identity has a classical combinatorial interpretation. The number of ways to pick 4 items from 8 equals the number of ways to pick 3 from 7, doubled. This doubling reflects a symmetry: fixing one item, you either include it (then choose 3 from the remaining 7) or exclude it (then choose 4 from the remaining 7), and by symmetry these two counts are equal, giving the factor of 2.
In Recognition Science, the number 8 arises from an eight-tick recognition cycle, a discrete sequence of steps the framework derives from its founding cost function. The framework models this cycle as a structural constant, and the identity C(8,4) = 2 × C(7,3) is one of several combinatorial facts its machine-checked library records. The library, a collection of formal theorems verified by computer, proves this identity by direct computation: the declaration choose84_doubled states exactly that Nat.choose 8 4 equals 2 times Nat.choose 7 3.
The framework also notes that C(8,4) = 70 exceeds 45, a number it calls gap45, and that 70 equals gap45 plus 25, where 25 is 5 raised to the power 2. These observations connect the binomial value to other framework-internal constants, but they are arithmetic relationships, not derivations of new physics. The framework's library certifies five canonical combinatorial families (permutations, combinations, partitions, paths, Young tableaux) as a set of size 5, a definitional choice rather than a proved theorem.
What the declaration does not claim: it does not assert that the eight-tick cycle is physically real, nor that the number 70 has any experimental consequence. It establishes only the arithmetic identity, leaving the interpretation of 8 as a cycle count to the framework's broader theory. The identity itself is true regardless of any framework; its significance within Recognition Science is that it appears in a certified list of combinatorial facts tied to the framework's structural numbers.
THEOREM choose84_doubled · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
/-- C(8,4) = 2 × 35 = 2 × C(7,3). -/
theorem choose84_doubled : Nat.choose 8 4 = 2 * Nat.choose 7 3 := by decide
THEOREM combinatoricsFamilyCount · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
theorem combinatoricsFamilyCount : Fintype.card CombinatoricsFamily = 5 := by decide
THEOREM choose84_gt_gap45 · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
/-- C(8,4) = 70 > gap45 = 45. -/
theorem choose84_gt_gap45 : Nat.choose 8 4 > 45 := by decide
What this page does not claim
The declaration does not assert that the eight-tick cycle is physically real. The identity has no experimental consequence beyond its arithmetic truth. The framework's interpretation of 8 as a cycle count is a model, not a proved physical fact.
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:
- How does the eight-tick cycle arise from the framework's founding cost function?
- What is the physical significance, if any, of the number 70 in the framework's model?
- How are the five combinatorial families defined as a set within the framework?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM choose84_doubled · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
/-- C(8,4) = 2 × 35 = 2 × C(7,3). -/ theorem choose84_doubled : Nat.choose 8 4 = 2 * Nat.choose 7 3 := by decideThe identity C(8,4) = 2 × C(7,3) is proved by direct computation in the framework's machine-checked library. choose84_doubled · IndisputableMonolith/Mathematics/CombinatoricsFromRS.leanTHEOREM combinatoricsFamilyCount · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
theorem combinatoricsFamilyCount : Fintype.card CombinatoricsFamily = 5 := by decideThe framework's library certifies five canonical combinatorial families as a set of size 5. combinatoricsFamilyCount · IndisputableMonolith/Mathematics/CombinatoricsFromRS.leanTHEOREM choose84_gt_gap45 · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
/-- C(8,4) = 70 > gap45 = 45. -/ theorem choose84_gt_gap45 : Nat.choose 8 4 > 45 := by decideThe framework records that C(8,4) = 70 exceeds 45. choose84_gt_gap45 · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean