Encyclopedia Mathematics Mathematics Combinatorics From Rs Choose84 Gt Gap45
ARTICLE 3 claims 2 theorems 1 model
Mathematics Combinatorics From Rs Choose84 Gt Gap45
A single arithmetic fact, 70 is greater than 45, sits inside a larger framework; here is what it says and what it does not.
A small inequality
The number 70 is greater than 45. That is the entire content of the formal statement choose84_gt_gap45: it asserts that the binomial coefficient C(8,4), which counts the ways to choose 4 objects from 8, equals 70, and that 70 exceeds 45. The proof is a direct calculation, checked by a machine, with no hidden assumptions. In ordinary mathematics, this is a trivial arithmetic comparison, not a deep theorem.
The statement gains context only inside a larger framework called Recognition Science, which studies how a discrete record of events, a ledger, forces certain mathematical structures. Within that framework, the number 8 appears as the eight ticks of a recognition cycle, and 4 as half of 8. The framework's library, a machine-checked collection of formal theorems, records this inequality as one small piece of a larger story about how combinatorial families, such as permutations and partitions, relate to the number 5.
The framework also notes a numerical coincidence: C(8,4) = 70, and 70 = 45 + 25, where 25 is 5 raised to the power (5 minus 1). The number 45 is called the gap, and the inequality simply states that the central binomial coefficient exceeds this gap. This is a definitional choice within the framework, not a derived law of nature. The framework does not claim that this inequality causes anything, nor that it predicts any physical or mathematical outcome beyond the arithmetic itself.
What the statement does not claim is worth stating plainly. It does not claim that the number 45 has any special mathematical status on its own; it is just a named constant in this framework. It does not claim that the binomial coefficient 70 is the maximum possible value for any choice of parameters; that would be a different theorem. And it does not claim that the framework's interpretation of 8 and 5 is the only or the standard one; those are modeling choices, not mathematical necessities.
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
THEOREM choose84_eq_70 · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
/-- C(8,4) = 70. -/
theorem choose84_eq_70 : Nat.choose 8 4 = 70 := by decide
MODEL CombinatoricsFamily · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
inductive CombinatoricsFamily where
| permutations | combinations | partitions | paths | youngTableaux
deriving DecidableEq, Repr, BEq, Fintype
What this page does not claim
The number 45 has any special mathematical status outside this framework. The binomial coefficient 70 is the maximum possible value for any choice of parameters. The framework's interpretation of 8 and 5 is the only or the standard one.
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:
- What is the full definition of the gap constant 45 in the framework?
- How does the framework derive the number 8 as the eight ticks of a recognition cycle?
- What is the significance of the number 5 for combinatorial families in the framework?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM choose84_gt_gap45 · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
/-- C(8,4) = 70 > gap45 = 45. -/ theorem choose84_gt_gap45 : Nat.choose 8 4 > 45 := by decideThe number 70 is greater than 45. choose84_gt_gap45 · IndisputableMonolith/Mathematics/CombinatoricsFromRS.leanTHEOREM choose84_eq_70 · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
/-- C(8,4) = 70. -/ theorem choose84_eq_70 : Nat.choose 8 4 = 70 := by decideThe binomial coefficient C(8,4) equals 70. choose84_eq_70 · IndisputableMonolith/Mathematics/CombinatoricsFromRS.leanMODEL CombinatoricsFamily · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean
inductive CombinatoricsFamily where | permutations | combinations | partitions | paths | youngTableaux deriving DecidableEq, Repr, BEq, FintypeThe framework's library records this inequality as one small piece of a larger story about how combinatorial families relate to the number 5. CombinatoricsFamily · IndisputableMonolith/Mathematics/CombinatoricsFromRS.lean