pith. sign in

Explain the Lean module `IndisputableMonolith.Constants.AlphaDerivation`. Write a module-level guide for a reader arriving from Pith. Cover the module's purpose, the main declarations, how it fits into the Recognition Science forcing chain or runtime, and what remains outside this module. Cite only declarations present in the supplied Recognition source.

Big AI job. Grok 4.3 reads the canon and writes a Lean-grounded derivation; usually 20 seconds to 2 minutes. Your answer will appear below.
confidence: moderate in recognition cached

Module Guide: IndisputableMonolith.Constants.AlphaDerivation

Purpose

This module supplies a constructive derivation of the inverse fine-structure constant from the geometry of the cubic ledger Q₃. It assembles the geometric seed 4π·11, the curvature term -103/(102π⁵), and the derived α⁻¹ value using only cube combinatorics, discrete Gauss-Bonnet, wallpaper-group counts, and Euler closure.

Main Declarations

Fit into Recognition Science Forcing Chain

The module sits in the constants layer after dimension forcing. It sets D = 3 and derives all numeric ingredients (11, 103, 102, 4π) from Q₃ geometry and the imported wallpaper-group count, producing the structural inputs to α⁻¹.

What Remains Outside This Module

Higher-order δₙ corrections, the canonical exponential formula, and explicit numeric matching to CODATA are handled in sibling modules. The precise provenance link from the forcing-chain theorems that establish D = 3 is not declared inside this module.

cited recognition theorems

outside recognition

Aspects Recognition does not yet address:

  • Explicit theorems from the forcing chain that establish D = 3
  • Definition of f_gap (imported from GapWeight)
  • Higher-order curvature corrections and canonical exponential formula
  • Runtime execution or ledger simulation details

recognition modules consulted

The Recognition library is at github.com/jonwashburn/shape-of-logic. The model is restricted to the supplied Lean source and instructed not to invent theorem names. Treat output as a starting point, not a verified proof.