pith. sign in
def

core_dependent_claims

definition
show as:
module
IndisputableMonolith.Physics.QuarkCoordinateReconciliation
domain
Physics
line
235 · github
papers citing
none yet

plain-language theorem explainer

The definition enumerates four mass-law results that presuppose the integer-rung phi-ladder convention for quarks and leptons. A researcher deriving parameter-free particle masses from Recognition Science geometry would reference this list to isolate the canonical core from the exploratory quarter-ladder layer. The body is assembled as a direct list literal with no computation or reduction.

Claim. Let $C$ be the list of claims depending on the core integer-rung convention, given explicitly by $C = [$mass rung scaling$, $predict mass positive$, $yardstick derived$, $sector formulas$]$.

background

Recognition Science places particle masses on the phi-ladder via the formula $m = y(S) phi^{r-8 + g(Z)}$, where $r$ is an integer rung, $y(S)$ the sector yardstick, and $g(Z)$ the gap correction. The module separates this canonical integer-rung assignment (rungs 4, 15, 21 for quarks) from the quarter-ladder hypothesis that permits fractional residues for phenomenological fit. Upstream, mass_rung_scaling asserts that increasing the rung by one multiplies the predicted mass by phi, while predict_mass_pos asserts positivity for any valid sector and rung.

proof idea

The definition is a direct list construction that enumerates four strings naming the dependent claims. No tactics, reductions, or external lemmas are invoked; the body is a static registry literal.

why it matters

This definition supports the layer separation documented in the quark coordinate module, keeping parameter-free core derivations distinct from the quarter-ladder exploratory layer. It registers the relevant theorems from Masses.MassLaw and the phi-ladder lattice structure without altering their statements. The declaration closes a documentation gap between the two conventions.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.