IndisputableMonolith.Physics.RunningCouplings
The RunningCouplings module derives beta functions and running alpha_s from the phi-ladder using J-cost identities. Physicists modeling RG flows or SM parameters cite these results to connect continuous evolution to discrete locking. The structure consists of targeted algebraic lemmas on asymptotic freedom criteria and perturbative anchors.
claim$\phi > 1$, $\beta(\alpha_s)$ from ladder derivative, $b_0^{\rm QCD}$, asymptotic freedom criterion, and $\alpha_s(\mu)$ running with RS anchors at $\phi^{-5}$ scales.
background
This module imports JcostCore, whose core object is the J-cost $J(x) = (x + x^{-1})/2 - 1$ obeying the Recognition Composition Law $J(xy) + J(x/y) = 2J(x)J(y) + 2J(x) + 2J(y)$. It works in the Recognition Science setting where mass and coupling scales sit on the phi-ladder with eight-tick octave periodicity. The upstream JcostCore module supplies the functional equation that forces phi as the self-similar fixed point and D=3 dimensions.
proof idea
The module opens with the elementary inequality phi_gt_one, then derives beta_function_from_ladder_derivative by differentiating the ladder, computes b0_qcd and b0_sm_positive coefficients, and closes with alpha_s_running together with positivity and perturbative bounds. Each sibling is an independent algebraic reduction; no overarching tactic script.
why it matters in Recognition Science
This module supplies the continuous RG flow that feeds CouplingLockIn, which formalizes the transition from RG flow to discrete geometric locking at the eight-beat plateau. It also supplies the running couplings required by ParticleSummary for Standard Model Parameters derived from Recognition Science. It occupies the RG segment of the T0-T8 forcing chain before discrete locking occurs.
scope and limits
- Does not compute explicit numerical running trajectories beyond the RS anchor scale.
- Does not treat non-perturbative strong-coupling regimes.
- Does not derive beta functions for electroweak or Yukawa couplings.
- Does not prove global convergence of the flow to fixed points.
used by (2)
depends on (1)
declarations in this module (33)
-
theorem
phi_gt_one -
theorem
beta_function_from_ladder_derivative -
def
b0_qcd -
theorem
b0_sm_positive -
theorem
asymptotic_freedom_criterion -
theorem
no_asymptotic_freedom_17 -
theorem
critical_flavor_number -
def
alpha_s_running -
theorem
alpha_s_positive -
def
rs_anchor_scale -
def
rs_alpha_s_anchor -
theorem
rs_alpha_s_perturbative -
def
rs_alpha_s_MZ -
theorem
rs_alpha_s_MZ_range -
def
rs_weinberg_angle_sq -
theorem
weinberg_angle_in_range -
structure
GUTUnification -
theorem
gut_above_ew -
def
mass_anomalous_dim -
def
mass_evolution_exp -
theorem
mass_anomalous_dim_pos -
theorem
mass_evolution_exp_pos -
theorem
mass_evo_exp_nf3 -
theorem
mass_evo_exp_nf4 -
theorem
mass_evo_exp_nf5 -
theorem
mass_evo_exp_nf6 -
def
running_mass -
theorem
mass_ratio_rg_invariant -
structure
FlavorThreshold -
def
charm_threshold -
def
bottom_threshold -
def
top_threshold -
def
transport_mass_through