pith. sign in
module module moderate

IndisputableMonolith.CrossDomain.ProductRecognitionLattice

show as:
view Lean formalization →

The ProductRecognitionLattice module supplies numerical inequalities between powers of 5 and 2. It proves 5^6 < 2^14 to confirm that cognitive-oncology joint states fit inside 14 bits. The module assembles a short list of independent computational lemmas verified directly from Mathlib arithmetic.

claimThe module establishes the inequalities $5^6 < 2^{14}$, $5^5 < 2^{13}$, $5^4 < 2^{10}$, $5^3 < 2^7$ and $5^2 < 2^5$.

background

This module operates in the cross-domain section of the Recognition Science framework and focuses on product recognition lattices. It introduces no new definitions and depends only on Mathlib for arithmetic. The inequalities verify compact bit-length encodings for joint states, consistent with the module documentation stating that 5^6 < 2^14 allows cognitive-oncology states to fit in 14 bits.

proof idea

The module consists of independent lemmas. Each inequality is proved by direct numerical evaluation using Mathlib tactics that unfold the powers and compare the resulting integers.

why it matters in Recognition Science

These bounds feed the product recognition lattice constructions by ensuring state sizes remain within practical bit limits. The module supplies the concrete verification for the 14-bit joint-state claim in its documentation and supports cross-domain integration without exceeding the stated width.

scope and limits

declarations in this module (24)