@ceccec/millennium-solutions 9.2.6 → 9.2.8

package/src/proof/trial-all.json

@@ -15640,5 +15640,221 @@
     "verdict": "UNVERIFIED",
     "ground": "no candidate in the current space — nothing to recompute",
     "receipt": "1c1ebe41-4e80-80ad-b352-e90a09922838"
+  },
+  {
+    "key": "lean_light_the_second_returns_from_the_metre_and_the_period_for_every_s",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "1de974bb-854a-879c-a8f0-712b59f8d7bc"
+  },
+  {
+    "key": "lean_mechanical_repeated_doubling_is_the_power_of_two_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "71d6eeaa-fd06-8af1-893f-dfa60297892d"
+  },
+  {
+    "key": "lean_mechanical_relation_digitroot_is_residue_mod9_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "22aed33c-e7ff-80ef-aded-b466c40bf0e4"
+  },
+  {
+    "key": "lean_mechanical_the_nine_times_table_always_digital_roots_to_nine_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "36b3b4ea-25f1-8083-b075-d707f2fb91ea"
+  },
+  {
+    "key": "lean_mechanical_the_digital_root_has_the_residue_of_its_number",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "efc4383f-1f52-8cfc-9d4a-d291f4aa5bd4"
+  },
+  {
+    "key": "lean_mechanical_a_digital_root_lies_between_one_and_nine",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "298da32e-60d7-8bf9-9135-c6e904ae937f"
+  },
+  {
+    "key": "lean_mechanical_casting_out_nines_is_multiplicative_for_every_a_b",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "58842a8d-45b2-8316-b9a6-440b595e6782"
+  },
+  {
+    "key": "lean_mechanical_the_moduli_dimensions_are_three_g_minus_three_and_six_g_minus_six_for_every_g",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "633ba212-336a-8600-90d6-836751f6b813"
+  },
+  {
+    "key": "lean_reach_exhaustion_never_reaches_its_own_bound_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "dfc2849f-3870-823b-ade5-f036c5f40166"
+  },
+  {
+    "key": "lean_reach_the_successor_of_every_bound_lies_outside_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "1113761c-4967-898e-a9d9-d836a27b42ae"
+  },
+  {
+    "key": "lean_reach_doubling_the_domain_leaves_the_same_hole_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "f57338c8-104b-8058-90f6-b86622f64f86"
+  },
+  {
+    "key": "lean_z9plus_doubling_has_period_six_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "2c9ca8bc-08a6-87e8-ba10-0390547c7318"
+  },
+  {
+    "key": "lean_z9plus_orbit_digital_roots_have_period_six_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "e88dfdf8-3c33-87c9-b480-65d2db2769ac"
+  },
+  {
+    "key": "lean_z9plus_the_doubling_orbit_is_read_from_the_exponent_mod_six",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "c688c966-b59f-8e39-91d8-fa1f9fc564a0"
+  },
+  {
+    "key": "lean_z9plus_the_orbit_never_meets_the_triad_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "8c3dfc38-91e6-8a00-9d2f-ac18974cd169"
+  },
+  {
+    "key": "lean_z9plus_fibonacci_residues_mod_nine_repeat_every_twenty_four_steps",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "04f6a9cd-b19f-8b13-b5d9-7d88fec0139e"
+  },
+  {
+    "key": "lean_z9plus_pisano_period_mod_nine_is_twenty_four_for_every_k",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "985c1ebe-dc19-877e-8573-82765db72126"
+  },
+  {
+    "key": "lean_z9plus_the_fuelled_gcd_is_the_gcd_when_the_fuel_exceeds_the_second_argument",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "73c32b16-76ca-8bbc-91f3-3d550cd02477"
+  },
+  {
+    "key": "lean_z9plus_consecutive_fibonacci_numbers_are_coprime",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "5ae6ebcf-4c89-80d4-bc8c-1e5fed479a69"
+  },
+  {
+    "key": "lean_z9plus_consecutive_fibonacci_are_coprime_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "424d4751-1648-8d01-b6aa-e31be117166a"
+  },
+  {
+    "key": "lean_z9plus_digital_root_agrees_with_the_residue_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "20da0230-2b9f-8735-848e-8009809d9f04"
+  },
+  {
+    "key": "lean_z9plus_digital_root_is_the_digit_sum_residue_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "694fefdf-a71b-8019-84e5-04477e7be3d8"
+  },
+  {
+    "key": "lean_demand2_the_two_power_sums_are_one_sum",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "6551630b-4917-8c1c-999f-4728c266cfd1"
+  },
+  {
+    "key": "lean_demand2_nicomachus_sum_of_cubes_is_the_square_of_the_triangular_number_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "7aa0bbe0-b4ae-82e8-8319-7aed7047d654"
+  },
+  {
+    "key": "lean_demand2_the_sum_of_fifth_powers_has_the_closed_form_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "6916652f-bda2-80d1-882e-009dee2d791d"
+  },
+  {
+    "key": "lean_elementary_the_lucas_numbers_are_the_sum_of_the_neighbouring_fibonaccis_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "cacb33f1-2fc1-8887-87a8-67aa352b3ac6"
+  },
+  {
+    "key": "lean_families_cassinis_identity_for_every_m",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "75a810f1-ae27-8fb7-b4d3-b257c0c917c7"
+  },
+  {
+    "key": "lean_families_a_sum_over_one_to_n_plus_one_adds_the_last_term",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "f664ca1d-8371-8bd5-a369-060e34e5baaf"
+  },
+  {
+    "key": "lean_families_the_numbers_sum_to_their_closed_form_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "34fa9fc8-b8ed-8895-bb81-c92f4515e9fe"
+  },
+  {
+    "key": "lean_families_the_squares_sum_to_their_closed_form_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "0b7a0569-fb3f-8ba7-a49a-900c19bf369d"
+  },
+  {
+    "key": "lean_families_the_cubes_sum_to_their_closed_form_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "96b0047e-cf09-8755-be28-1cb49080d466"
+  },
+  {
+    "key": "lean_families_the_fourth_powers_sum_to_their_closed_form_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "3419aabd-970f-8738-ae26-0adbfd4cf7fb"
+  },
+  {
+    "key": "lean_families_the_fifth_powers_sum_to_their_closed_form_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "790310ea-f06d-875d-89aa-2aba93d133e3"
+  },
+  {
+    "key": "lean_families_power_sums_match_their_closed_forms_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "04b04822-598b-8529-a44c-7881174ec382"
+  },
+  {
+    "key": "lean_families_the_sums_of_triangular_numbers_are_the_tetrahedral_numbers_for_every_n",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "43b9cdd8-7110-8f6f-887b-297d0262ae80"
+  },
+  {
+    "key": "lean_sequences_cassinis_identity_for_every_m",
+    "verdict": "UNVERIFIED",
+    "ground": "no candidate in the current space — nothing to recompute",
+    "receipt": "3b815427-42b8-8b8c-abf3-423b1e268af3"
   }
 ]

package/src/proof/z9plus.lean

@@ -205,4 +205,96 @@ theorem both_parts_sum_to_zero :
   m9 ((R.filter (fun d => R.any (fun e => m9 (d * e) == 1))).foldl (· + ·) 0) == 0
   ∧ m9 ((R.filter (fun d => ! R.any (fun e => m9 (d * e) == 1))).foldl (· + ·) 0) == 0 := by decide
 
+
+-- ── the capped rows above, proved for every value — no bound ─────────────────────────────────────────────────
+-- doubling_has_period_six (k < 30), orbit_digital_roots_have_period_six (k < 24), the_orbit_never_meets_the_triad
+-- (k < 40), pisano_period_mod_nine_is_twenty_four (k < 30), consecutive_fibonacci_are_coprime (n ≤ 25) and
+-- digital_root_agrees_with_the_residue (n ≤ 300) were checked up to a bound; these prove them for every value.
+-- 2⁶ ≡ 1 mod 9 turns the orbit; the pair (fib k, fib (k+1)) mod 9 returns after 24 steps; gcd9 is Euclid with fuel
+-- a + b + 1, which always exceeds what Euclid needs, so it is the gcd.
+theorem doubling_has_period_six_for_every_k : ∀ k : Nat, pw 2 (k + 6) = pw 2 k := by
+  intro k
+  unfold pw m9
+  rw [Nat.pow_add, Nat.mul_mod]
+  have h : 2 ^ 6 % 9 = 1 := by decide
+  rw [h, Nat.mul_one, Nat.mod_mod]
+
+theorem orbit_digital_roots_have_period_six_for_every_k : ∀ k : Nat, dr (pw 2 (k + 6)) = dr (pw 2 k) := by
+  intro k
+  rw [doubling_has_period_six_for_every_k]
+
+theorem the_doubling_orbit_is_read_from_the_exponent_mod_six : ∀ k : Nat, pw 2 k = pw 2 (k % 6) := by
+  intro k
+  induction k using Nat.strongRecOn with
+  | _ k ih =>
+    if hk : k < 6 then rw [Nat.mod_eq_of_lt hk]
+    else
+      have e : k = (k - 6) + 6 := by omega
+      rw [e, doubling_has_period_six_for_every_k, ih (k - 6) (by omega), Nat.add_mod_right]
+
+theorem the_orbit_never_meets_the_triad_for_every_k : ∀ k : Nat, pw 2 k ≠ 0 ∧ pw 2 k ≠ 3 ∧ pw 2 k ≠ 6 := by
+  intro k
+  rw [the_doubling_orbit_is_read_from_the_exponent_mod_six]
+  have h : k % 6 < 6 := Nat.mod_lt _ (by decide)
+  generalize k % 6 = j at h ⊢
+  revert j
+  decide
+
+theorem fibonacci_residues_mod_nine_repeat_every_twenty_four_steps :
+    ∀ k : Nat, fib (k + 24) % 9 = fib k % 9 ∧ fib (k + 25) % 9 = fib (k + 1) % 9 := by
+  intro k
+  induction k with
+  | zero => decide
+  | succ k ih =>
+    refine ⟨ih.2, ?_⟩
+    show (fib (k + 24) + fib (k + 25)) % 9 = (fib k + fib (k + 1)) % 9
+    rw [Nat.add_mod, ih.1, ih.2, ← Nat.add_mod]
+
+theorem pisano_period_mod_nine_is_twenty_four_for_every_k : ∀ k : Nat, fib9 (k + 24) = fib9 k := by
+  intro k
+  exact (fibonacci_residues_mod_nine_repeat_every_twenty_four_steps k).1
+
+theorem the_fuelled_gcd_is_the_gcd_when_the_fuel_exceeds_the_second_argument :
+    ∀ f a b : Nat, b < f → gcdF f a b = Nat.gcd a b := by
+  intro f
+  induction f with
+  | zero => intro a b h; exact absurd h (Nat.not_lt_zero b)
+  | succ f ih =>
+    intro a b h
+    cases b with
+    | zero => show a = Nat.gcd a 0; rw [Nat.gcd_zero_right]
+    | succ b =>
+      show gcdF f (b + 1) (a % (b + 1)) = Nat.gcd a (b + 1)
+      have hm : a % (b + 1) < b + 1 := Nat.mod_lt a (Nat.succ_pos b)
+      rw [ih (b + 1) (a % (b + 1)) (by omega), Nat.gcd_comm a (b + 1), Nat.gcd_rec (b + 1) a, Nat.gcd_comm]
+
+theorem consecutive_fibonacci_numbers_are_coprime : ∀ n : Nat, Nat.gcd (fib n) (fib (n + 1)) = 1 := by
+  intro n
+  induction n with
+  | zero => show Nat.gcd 0 1 = 1; exact Nat.gcd_zero_left 1
+  | succ n ih =>
+    show Nat.gcd (fib (n + 1)) (fib n + fib (n + 1)) = 1
+    rw [Nat.gcd_rec, Nat.add_mod_right, ← Nat.gcd_rec, Nat.gcd_comm, ih]
+
+theorem consecutive_fibonacci_are_coprime_for_every_n : ∀ n : Nat, gcd9 (fib n) (fib (n + 1)) = 1 := by
+  intro n
+  unfold gcd9
+  rw [the_fuelled_gcd_is_the_gcd_when_the_fuel_exceeds_the_second_argument _ _ _ (by omega)]
+  exact consecutive_fibonacci_numbers_are_coprime n
+
+theorem digital_root_agrees_with_the_residue_for_every_n : ∀ n : Nat, 0 < n → (dr n = 9 ↔ m9 n = 0) := by
+  intro n hn
+  unfold dr m9
+  rw [if_neg (show ¬ ((n == 0) = true) by simp; omega)]
+  by_cases h : n % 9 = 0
+  · simp [h]
+  · rw [if_neg (show ¬ ((n % 9 == 0) = true) by simpa using h)]
+    constructor
+    · intro e; have := Nat.mod_lt n (show 0 < 9 by decide); omega
+    · intro e; exact absurd e h
+
+theorem digital_root_is_the_digit_sum_residue_for_every_n : ∀ n : Nat, m9 (digitSum n) = m9 n := by
+  intro n
+  exact Reversal.the_digit_sum_has_the_residue_of_the_number_mod_nine_for_every_n n
+
 end Z9Plus