`A`

definition

show as: view math explainer →

module: IndisputableMonolith.Foundation.IntegrationGap
domain: Foundation
line: 105 · github
papers citing: none yet

open explainer

Read the cached plain-language explainer.

open lean source

IndisputableMonolith.Foundation.IntegrationGap on GitHub at line 105.

browse module

All declarations in this module, on Recognition.

explainer page

A cached Ask Recognition explainer exists for this declaration.

open explainer

depends on

used by

formal source

 102noncomputable section
 103
 104/-- The active edge count per fundamental tick. -/
 105def A : ℤ := 1
 106
 107/-- The φ-power balance identity at `D = 3`:
 108    `φ^(A − gap) · φ^gap = φ`, equivalently `φ^(−44) · φ^45 = φ`. -/
 109theorem gap_balance :
 110    phi ^ (A - ↑(integrationGap D)) * phi ^ (↑(integrationGap D) : ℤ) = phi := by
 111  have hg : (↑(integrationGap D) : ℤ) = 45 := by exact_mod_cast integrationGap_at_D3
 112  rw [hg, show A = (1 : ℤ) from rfl, ← zpow_add₀ (ne_of_gt phi_pos)]
 113  have : (1 : ℤ) - 45 + 45 = 1 := by norm_num
 114  rw [this, zpow_one]
 115
 116end
 117
 118/-! ## Master certificate -/
 119
 120structure IntegrationGapCert where
 121  config_dim : configDim D = 5
 122  parity_count : parityCount D = 9
 123  gap_value : integrationGap D = 45
 124  gap_minus_one : gapMinusOne D = 44
 125  coprime_at_3 : Nat.Coprime (2 ^ D) (integrationGap D)
 126  odd_coprime : ∀ k, Nat.Coprime (2 ^ (2*k+1)) ((2*k+1)^2 * (2*k+3))
 127  even_not_coprime : ∀ k, 0 < k → ¬ Nat.Coprime (2^(2*k)) ((2*k)^2 * (2*k+2))
 128
 129theorem integrationGapCert : IntegrationGapCert where
 130  config_dim := configDim_at_D3
 131  parity_count := parityCount_at_D3
 132  gap_value := integrationGap_at_D3
 133  gap_minus_one := gapMinusOne_at_D3
 134  coprime_at_3 := coprime_at_D3
 135  odd_coprime := coprimality_odd

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.