Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Guarded companion divisibility: `Q n ∣ Q ((2k+1) * n)`.

Proved
Catalog.Novelty.PellSpine.pellQ_dvd_odd_multiple

by raver1975 · Sep 11, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalognovelty

Guarded companion divisibility: Q n ∣ Q ((2k+1) * n). Only odd multiples work — see not_pellQ_strong_divisibility for the failure at the even multiple 6 = 2 * 3.

theorem Catalog.Novelty.PellSpine.pellQ_dvd_odd_multiple(n k : ℕ) : pellQ n ∣ pellQ ((2 * k + 1) * n) := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Novelty/PellSpineDivisibility.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Novelty/PellSpineDivisibility.lean
import Mathlib
import Definitions.Def_Novelty_PellSpineCore
/-
# Strong divisibility on the Pell spine — and four conjectures it kills

Building on `Novelty.PellSpineCore`, this file proves that the Pell numbers form a
**strong divisibility sequence**,

`gcd (P m) (P n) = P (gcd m n)`,

and then uses that theorem as a *falsification engine*: four natural strengthenings of
it are each destroyed by a single explicit counterexample, all of them living inside the
first eight Pell numbers.

## Proved

* `pellP_gcd_step`   — the Euclidean step `gcd (P (m+n)) (P n) = gcd (P m) (P n)`;
* `pellP_gcd`        — **strong divisibility** `gcd (P m) (P n) = P (gcd m n)`;
* `pellP_dvd_iff`    — `m ∣ n ↔ P m ∣ P n`, with no side condition at all;
* `pellP_prime_index`— if `P n` is prime then `n` is prime;
* `pellQ_dvd_odd_multiple` — the *guarded* companion statement `Q n ∣ Q ((2k+1) * n)`.

## Refuted (each by one counterexample)

* `not_pellP_prime_of_prime_index`  — `n` prime does **not** force `P n` prime: `P 7 = 169 = 13²`;
* `not_pellP_squarefree`            — Pell numbers are **not** all squarefree: again `P 7 = 13²`
  (the exact analogue for Fibonacci numbers is a well-known open problem, and here it is
  false at the seventh term);
* `not_pellQ_strong_divisibility`   — the companion sequence is **not** a strong divisibility
  sequence: `gcd (Q 3) (Q 6) = gcd 7 99 = 1 ≠ 7 = Q 3`, even though `3 ∣ 6`;
* `not_prime_dvd_pellP_pred`        — the naive Fermat-style law `p ∣ P (p-1)` fails: `3 ∤ P 2 = 2`
  (the correct exponent is `p - (2/p)`, and `2` is a non-residue mod `3`).

The moral, extracted in `FUTURE_DIRECTIONS.md`: strong divisibility is a property of the
*norm-form solution* sequence `P`, not of the *trace* sequence `Q`, and it degrades to a
`2k+1`-graded statement on `Q`.
-/

open Catalog.Novelty.PellSpine

/-! ## The Euclidean step -/



/-! ## Strong divisibility -/




/-! ## The guarded companion statement -/
Formal statement
theorem Catalog.Novelty.PellSpine.pellQ_dvd_odd_multiple(n k : ℕ) : pellQ n ∣ pellQ ((2 * k + 1) * n) := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Novelty/PellSpineDivisibility.lean#L116

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me