Paper pinning and rigidity
ProvedErdosProblems.Erdos269.PaperR7.paper_pinning_and_rigidityerdos-269theorem
The true state satisfies a positive quotient recurrence, and integrality at one scale propagates to every later scale. A real orbit following the same recurrence from A and lying with the true state in the same positive-width digit/base windows agrees at A, provided width(A+k)/2^k tends to zero.
Preamble
import Definitions.Def_ErdosProblems_Erdos269_BoundedRadixTailEscape import Definitions.Def_ErdosProblems_Erdos269_ResidueEscape import Definitions.Def_ErdosProblems_Erdos269_ThreePrimeRunningLcm import Definitions.Def_ErdosProblems_Erdos269_RestrictedFloorSum import Definitions.Def_ErdosProblems_Erdos269_DyadicBlockMassIdentity import Definitions.Def_ErdosProblems_Erdos269_DyadicBlockThresholdPartition import Definitions.Def_ErdosProblems_Erdos269_DyadicOrderedTailRecurrence import Definitions.Def_ErdosProblems_Erdos269_DyadicShellSummability import Definitions.Def_ErdosProblems_Erdos269_IntegralBranchExtinction import Definitions.Def_ErdosProblems_Shared_IrrationalRotationStaircase import Definitions.Def_ErdosProblems_Erdos269_KernelCarryRank import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.BigOperators.Group.Finset.Sigma import Mathlib.Algebra.BigOperators.Group.List.Basic import Mathlib.Algebra.GCDMonoid.Finset import Mathlib.Algebra.Order.Floor.Ring import Mathlib.Algebra.Order.Floor.Semiring import Mathlib.Algebra.Ring.Parity import Mathlib.Analysis.SpecialFunctions.Log.Base import Mathlib.Data.Finset.Card import Mathlib.Data.Finset.Prod import Mathlib.Data.Fintype.Pigeonhole import Mathlib.Data.Int.ModEq import Mathlib.Data.Nat.Log import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Nat.Prime.Int import Mathlib.Data.Real.Archimedean import Mathlib.LinearAlgebra.Matrix.Block import Mathlib.LinearAlgebra.Matrix.Determinant.Basic import Mathlib.Tactic import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring namespace ErdosProblems.Erdos269.PaperR7 end ErdosProblems.Erdos269.PaperR7 /-! # Round 7: whole displayed statements assembled from the supplied library No replacement definitions of the underlying geometry are introduced. Each assembly names every clause printed under its paper label. These conjunctions are intentionally explicit: a nearby individual helper is not silently counted as an end-to-end paper theorem. Dependencies are copied unchanged from the packet and retain their original evidence status. No admissions. -/ open scoped BigOperators open ErdosProblems.Erdos269.PaperR7
Formal statement
theorem ErdosProblems.Erdos269.PaperR7.paper_pinning_and_rigidity :
(∀ a : ℕ, trueNormalizedState a =
((dyadicOrderedBlockDigit235 a : ℝ) + trueNormalizedState (a + 1)) /
(dyadicBlockBase235 a : ℝ) ∧ 0 < trueNormalizedState a) ∧
(∀ a : ℕ, ∀ z : ℤ, trueNormalizedState a = (z : ℝ) →
∀ n, a ≤ n → ∃ w : ℤ, trueNormalizedState n = (w : ℝ)) ∧
(∀ (width : ℕ → ℝ) (A : ℕ) (y : ℕ → ℝ),
(∀ n, 0 < width n) →
(∀ n, A ≤ n → y (n + 1) =
(dyadicBlockBase235 n : ℝ) * y n - (dyadicOrderedBlockDigit235 n : ℝ)) →
(∀ n, A ≤ n →
(dyadicOrderedBlockDigit235 n : ℝ) / (dyadicBlockBase235 n : ℝ) < y n ∧
y n ≤ (dyadicOrderedBlockDigit235 n : ℝ) / (dyadicBlockBase235 n : ℝ) + width n) →
(∀ n, A ≤ n →
(dyadicOrderedBlockDigit235 n : ℝ) / (dyadicBlockBase235 n : ℝ) < trueNormalizedState n ∧
trueNormalizedState n ≤
(dyadicOrderedBlockDigit235 n : ℝ) / (dyadicBlockBase235 n : ℝ) + width n) →
(∀ ε > 0, ∃ k₀ : ℕ, ∀ k, k₀ ≤ k → width (A + k) / 2 ^ k < ε) →
y A = trueNormalizedState A) := by sorry
Source
Lean source (Apache-2.0): https://github.com/wcook04/plectis-erdos-lean/blob/cc7e541cf2081c6fef5a5e377d52e365e33b01eb/ErdosProblems/Erdos269/PaperR7BasicAssembly.lean#L165-L193
Related paper by Will Cook (CC-BY-4.0): https://github.com/wcook04/plectis-erdos/blob/551bae6dc6e732cf85172d66323c8d2bc77ba962/paper/269/erdos-269-three-prime-running-lcm.tex#L1-L260
Paper prior-art bibliography: https://github.com/wcook04/plectis-erdos/blob/551bae6dc6e732cf85172d66323c8d2bc77ba962/paper/269/erdos-269-three-prime-running-lcm.tex#L681-L689