mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-07-31 03:05:21 +00:00
c0641ea875
- Update 3-Mathematical-Models JSON datasets (NUVMAP index, mass proofs, math_centric_samples, math_raw_summary, math_self_discovered +1.5M lines, structural_discovery, unified_9pattern_samples, unknown_discovery_report) - Add adjacent_coprime_classification receipt (Lean proof + manifest) - Add codebase-memory-receipt (Rust crate + manifests) - Add desi_model_projection receipt (Lean proofs + manifest) - Add deterministic_build_receipt (Lean build proof) - Add Containerfile, run-container.sh, cupfox-config.nix - Restore .github assets and changes.zip
100 lines
4.1 KiB
Text
100 lines
4.1 KiB
Text
-- AdjacentCoprimeClassification.lean
|
|
-- Complete Classification of Adjacent Coprimality in Second-Order
|
|
-- Integer Linear Recurrences
|
|
--
|
|
-- Theorem: For a_{n+1} = c1.a_n + c2.a_{n-1}:
|
|
-- gcd(a_n, a_{n+1}) = 1 ∀ n ≥ 1
|
|
-- iff gcd(a1, a2) = gcd(a2, c2) = gcd(c1, c2) = 1
|
|
--
|
|
-- Key identity: gcd(a_n, a_{n+1}) = gcd(a_n, c2.a_{n-1})
|
|
-- Invariant: gcd(a_n, a_{n+1}) = gcd(a_n, c2) if gcd(a_{n-1}, a_n) = 1
|
|
--
|
|
-- Project language: state flow + gate + hidden history channel + leakage failure
|
|
|
|
namespace Semantics.Physics.AdjacentCoprimeClassification
|
|
|
|
-- Step function for the recurrence
|
|
def step (c1 c2 aPrev aCurr : Int) : Int := c1 * aCurr + c2 * aPrev
|
|
|
|
-- Example 1: Fibonacci-like (c1=1, c2=1, a1=1, a2=2)
|
|
-- Conditions: gcd(1,2)=1, gcd(2,1)=1, gcd(1,1)=1 ALL PASS
|
|
-- Sequence: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89
|
|
|
|
theorem fib_cond1 : Int.gcd 1 2 = 1 := by native_decide
|
|
theorem fib_cond2 : Int.gcd 2 1 = 1 := by native_decide
|
|
theorem fib_cond3 : Int.gcd 1 1 = 1 := by native_decide
|
|
|
|
theorem fib_gcd_1 : Int.gcd 1 2 = 1 := by native_decide
|
|
theorem fib_gcd_2 : Int.gcd 2 3 = 1 := by native_decide
|
|
theorem fib_gcd_3 : Int.gcd 3 5 = 1 := by native_decide
|
|
theorem fib_gcd_4 : Int.gcd 5 8 = 1 := by native_decide
|
|
theorem fib_gcd_5 : Int.gcd 8 13 = 1 := by native_decide
|
|
theorem fib_gcd_6 : Int.gcd 13 21 = 1 := by native_decide
|
|
theorem fib_gcd_7 : Int.gcd 21 34 = 1 := by native_decide
|
|
theorem fib_gcd_8 : Int.gcd 34 55 = 1 := by native_decide
|
|
theorem fib_gcd_9 : Int.gcd 55 89 = 1 := by native_decide
|
|
|
|
-- Supporting identity: gcd(5, 1*5+1*3) = gcd(5, 1*3)
|
|
theorem fib_support : Int.gcd 5 (step 1 1 3 5) = Int.gcd 5 3 := by native_decide
|
|
|
|
-- Invariant core: gcd(5, step...) = gcd(5, c2) = gcd(5, 1) = 1
|
|
theorem fib_core : Int.gcd 5 (step 1 1 3 5) = Int.gcd 5 1 := by native_decide
|
|
|
|
-- Example 2: c1=2, c2=2, a1=1, a2=3. gcd(c1,c2)=2 FAIL
|
|
-- Sequence: 1, 3, 8, 22, 60, 164. Break at gcd(8, 22) = 2
|
|
|
|
theorem bad_cond1 : Int.gcd 1 3 = 1 := by native_decide
|
|
theorem bad_cond2 : Int.gcd 3 2 = 1 := by native_decide
|
|
theorem bad_cond3 : Int.gcd 2 2 = 2 := by native_decide
|
|
|
|
theorem bad_break : Int.gcd 8 22 = 2 := by native_decide
|
|
|
|
-- Example 3: c1=3, c2=5, a1=2, a2=7. All conditions PASS.
|
|
-- Sequence: 2, 7, 31, 128, 539, 2257, 9466, 39683, 166409
|
|
|
|
theorem ex3_cond1 : Int.gcd 2 7 = 1 := by native_decide
|
|
theorem ex3_cond2 : Int.gcd 7 5 = 1 := by native_decide
|
|
theorem ex3_cond3 : Int.gcd 3 5 = 1 := by native_decide
|
|
|
|
theorem ex3_gcd_1 : Int.gcd 2 7 = 1 := by native_decide
|
|
theorem ex3_gcd_2 : Int.gcd 7 31 = 1 := by native_decide
|
|
theorem ex3_gcd_3 : Int.gcd 31 128 = 1 := by native_decide
|
|
theorem ex3_gcd_4 : Int.gcd 128 539 = 1 := by native_decide
|
|
theorem ex3_gcd_5 : Int.gcd 539 2257 = 1 := by native_decide
|
|
theorem ex3_gcd_6 : Int.gcd 2257 9466 = 1 := by native_decide
|
|
theorem ex3_gcd_7 : Int.gcd 9466 39683 = 1 := by native_decide
|
|
theorem ex3_gcd_8 : Int.gcd 39683 166409 = 1 := by native_decide
|
|
|
|
-- Invariant core: gcd(31, step 3 5 7 31) = gcd(31, 5) = 1
|
|
theorem ex3_core : Int.gcd 31 (step 3 5 7 31) = Int.gcd 31 5 := by native_decide
|
|
|
|
-- Example 4: c1=2, c2=4, a1=1, a2=3. gcd(c1,c2)=4 FAIL.
|
|
-- Sequence: 1, 3, 10, 32, 104. Break at gcd(10, 32) = 2
|
|
|
|
theorem bad2_cond1 : Int.gcd 1 3 = 1 := by native_decide
|
|
theorem bad2_cond2 : Int.gcd 3 4 = 1 := by native_decide
|
|
theorem bad2_cond3 : Int.gcd 2 4 = 2 := by native_decide
|
|
|
|
theorem bad2_break : Int.gcd 10 32 = 2 := by native_decide
|
|
|
|
-- Example 5: c1=1, c2=3, a1=5, a2=7. All conditions PASS.
|
|
-- Sequence: 5, 7, 22, 43, 109, 238, 565, 1279
|
|
|
|
theorem ex5_cond1 : Int.gcd 5 7 = 1 := by native_decide
|
|
theorem ex5_cond2 : Int.gcd 7 3 = 1 := by native_decide
|
|
theorem ex5_cond3 : Int.gcd 1 3 = 1 := by native_decide
|
|
|
|
theorem ex5_gcd_1 : Int.gcd 5 7 = 1 := by native_decide
|
|
theorem ex5_gcd_2 : Int.gcd 7 22 = 1 := by native_decide
|
|
theorem ex5_gcd_3 : Int.gcd 22 43 = 1 := by native_decide
|
|
theorem ex5_gcd_4 : Int.gcd 43 109 = 1 := by native_decide
|
|
theorem ex5_gcd_5 : Int.gcd 109 238 = 1 := by native_decide
|
|
theorem ex5_gcd_6 : Int.gcd 238 565 = 1 := by native_decide
|
|
|
|
-- Receipts
|
|
#eval step 1 1 3 5
|
|
#eval Int.gcd 5 (step 1 1 3 5)
|
|
#eval Int.gcd 5 3
|
|
#eval Int.gcd 5 1
|
|
|
|
end Semantics.Physics.AdjacentCoprimeClassification
|