/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilA logarithmic derivative with prime-divisible coefficients
Let $F(x)$ be the generating function of A381353, with $F(0)=1$, $[x]F(x)=1$, and $[x^n]F(x)^{p_n}=0$ for $n>1$, where $p_n$ is the $n$-th prime. The sequence is defined by $\sum_{n\ge1}a(n)x^n=xF'(x)/F(x)$.
References:
[Li26] Wentao Li, Prime divisibility of logarithmic-derivative coefficients, 2026.
@[expose] public sectionnamespace OeisA381355open PowerSeriesThe $n$-th prime, indexed from $p_1=2$.
noncomputable def primeN (n : ℕ) : ℕ := Nat.nth Nat.Prime (n - 1)The coefficients of $F$, obtained successively from $[x^n]F(x)^{p_n}=0$.
noncomputable def f : ℕ → ℤ :=
Nat.strongRec fun n ih =>
if n = 0 then 1
else if n = 1 then 1
else
-(coeff n
(PowerSeries.mk (fun k => if h : k < n then ih k h else 0) ^ primeN n) /
(primeN n : ℤ))The generating function of A381353.
noncomputable def series : PowerSeries ℤ := PowerSeries.mk fThe coefficients of $xF'(x)/F(x)$.
noncomputable def a (n : ℕ) : ℤ :=
coeff n (X * derivative ℤ series * invOfUnit series 1)n:ℕ⊢ (if n = 0 then 1
else
if n = 1 then 1
else
-((coeff n)
((mk fun k ↦
if h : k < n then
(fun m x ↦
Nat.strongRec
(fun n ih ↦
if n = 0 then 1
else
if n = 1 then 1
else -((coeff n) ((mk fun k ↦ if h : k < n then ih k h else 0) ^ primeN n) / ↑(primeN n)))
m)
k h
else 0) ^
primeN n) /
↑(primeN n))) =
if n = 0 then 1
else if n = 1 then 1 else -((coeff n) ((mk fun k ↦ if k < n then f k else 0) ^ primeN n) / ↑(primeN n))
rfl All goals completed! 🐙
@[category API, AMS 11]
private lemma f_0 : f 0 = 1 := by ⊢ f 0 = 1 rw [f_eq ⊢ (if 0 = 0 then 1
else if 0 = 1 then 1 else -((coeff 0) ((mk fun k ↦ if k < 0 then f k else 0) ^ primeN 0) / ↑(primeN 0))) =
1 ⊢ (if 0 = 0 then 1
else if 0 = 1 then 1 else -((coeff 0) ((mk fun k ↦ if k < 0 then f k else 0) ^ primeN 0) / ↑(primeN 0))) =
1] ⊢ (if 0 = 0 then 1
else if 0 = 1 then 1 else -((coeff 0) ((mk fun k ↦ if k < 0 then f k else 0) ^ primeN 0) / ↑(primeN 0))) =
1; norm_num All goals completed! 🐙
@[category API, AMS 11]
private lemma f_1 : f 1 = 1 := by ⊢ f 1 = 1 rw [f_eq ⊢ (if 1 = 0 then 1
else if 1 = 1 then 1 else -((coeff 1) ((mk fun k ↦ if k < 1 then f k else 0) ^ primeN 1) / ↑(primeN 1))) =
1 ⊢ (if 1 = 0 then 1
else if 1 = 1 then 1 else -((coeff 1) ((mk fun k ↦ if k < 1 then f k else 0) ^ primeN 1) / ↑(primeN 1))) =
1] ⊢ (if 1 = 0 then 1
else if 1 = 1 then 1 else -((coeff 1) ((mk fun k ↦ if k < 1 then f k else 0) ^ primeN 1) / ↑(primeN 1))) =
1; norm_num All goals completed! 🐙
@[category API, AMS 11]
private lemma coeff_mul_range (n : ℕ) (F G : PowerSeries ℤ) :
coeff n (F * G) = ∑ k ∈ Finset.range (n + 1), coeff k F * coeff (n - k) G := by n:ℕF:ℤ⟦X⟧G:ℤ⟦X⟧⊢ (coeff n) (F * G) = ∑ k ∈ Finset.range (n + 1), (coeff k) F * (coeff (n - k)) G
rw [coeff_mul, n:ℕF:ℤ⟦X⟧G:ℤ⟦X⟧⊢ ∑ p ∈ Finset.HasAntidiagonal.antidiagonal n, (coeff p.1) F * (coeff p.2) G =
∑ k ∈ Finset.range (n + 1), (coeff k) F * (coeff (n - k)) G All goals completed! 🐙 Finset.Nat.sum_antidiagonal_eq_sum_range_succ_mk n:ℕF:ℤ⟦X⟧G:ℤ⟦X⟧⊢ ∑ k ∈ Finset.range n.succ, (coeff (k, n - k).1) F * (coeff (k, n - k).2) G =
∑ k ∈ Finset.range (n + 1), (coeff k) F * (coeff (n - k)) G All goals completed! 🐙] All goals completed! 🐙
@[category API, AMS 11]
private lemma coeff_pow_succ (n p : ℕ) (G : PowerSeries ℤ) :
coeff n (G ^ (p + 1)) =
∑ k ∈ Finset.range (n + 1), coeff k (G ^ p) * coeff (n - k) G := by n:ℕp:ℕG:ℤ⟦X⟧⊢ (coeff n) (G ^ (p + 1)) = ∑ k ∈ Finset.range (n + 1), (coeff k) (G ^ p) * (coeff (n - k)) G
rw [pow_succ, n:ℕp:ℕG:ℤ⟦X⟧⊢ (coeff n) (G ^ p * G) = ∑ k ∈ Finset.range (n + 1), (coeff k) (G ^ p) * (coeff (n - k)) G All goals completed! 🐙 coeff_mul_range n:ℕp:ℕG:ℤ⟦X⟧⊢ ∑ k ∈ Finset.range (n + 1), (coeff k) (G ^ p) * (coeff (n - k)) G =
∑ k ∈ Finset.range (n + 1), (coeff k) (G ^ p) * (coeff (n - k)) G All goals completed! 🐙] All goals completed! 🐙
@[category API, AMS 11]
private lemma f_2 : f 2 = -1 := by ⊢ f 2 = -1
rw [f_eq ⊢ (if 2 = 0 then 1
else if 2 = 1 then 1 else -((coeff 2) ((mk fun k ↦ if k < 2 then f k else 0) ^ primeN 2) / ↑(primeN 2))) =
-1 ⊢ (if 2 = 0 then 1
else if 2 = 1 then 1 else -((coeff 2) ((mk fun k ↦ if k < 2 then f k else 0) ^ primeN 2) / ↑(primeN 2))) =
-1] ⊢ (if 2 = 0 then 1
else if 2 = 1 then 1 else -((coeff 2) ((mk fun k ↦ if k < 2 then f k else 0) ^ primeN 2) / ↑(primeN 2))) =
-1
norm_num [primeN, Nat.nth_prime_one_eq_three, coeff_pow_succ,
Finset.sum_range_succ, coeff_mk, coeff_one, f_0, f_1] All goals completed! 🐙
@[category API, AMS 11]
private lemma f_3 : f 3 = 2 := by ⊢ f 3 = 2
rw [f_eq ⊢ (if 3 = 0 then 1
else if 3 = 1 then 1 else -((coeff 3) ((mk fun k ↦ if k < 3 then f k else 0) ^ primeN 3) / ↑(primeN 3))) =
2 ⊢ (if 3 = 0 then 1
else if 3 = 1 then 1 else -((coeff 3) ((mk fun k ↦ if k < 3 then f k else 0) ^ primeN 3) / ↑(primeN 3))) =
2] ⊢ (if 3 = 0 then 1
else if 3 = 1 then 1 else -((coeff 3) ((mk fun k ↦ if k < 3 then f k else 0) ^ primeN 3) / ↑(primeN 3))) =
2
norm_num [primeN, Nat.nth_prime_two_eq_five, coeff_pow_succ,
Finset.sum_range_succ, coeff_mk, coeff_one, f_0, f_1, f_2] All goals completed! 🐙
@[category API, AMS 11]
private lemma coeff_natCast (n k : ℕ) :
coeff n (k : PowerSeries ℤ) = if n = 0 then (k : ℤ) else 0 := by n:ℕk:ℕ⊢ (coeff n) ↑k = if n = 0 then ↑k else 0
have h : (k : PowerSeries ℤ) = C (k : ℤ) := by simp n:ℕk:ℕh:↑k = C ↑k⊢ (coeff n) ↑k = if n = 0 then ↑k else 0 n:ℕk:ℕh:↑k = C ↑k⊢ (coeff n) ↑k = if n = 0 then ↑k else 0
rw [h, n:ℕk:ℕh:↑k = C ↑k⊢ (coeff n) (C ↑k) = if n = 0 then ↑k else 0 All goals completed! 🐙 coeff_C n:ℕk:ℕh:↑k = C ↑k⊢ (if n = 0 then ↑k else 0) = if n = 0 then ↑k else 0 All goals completed! 🐙] All goals completed! 🐙
@[category API, AMS 11]
private lemma coeff_natCast_mul (n k : ℕ) (G : PowerSeries ℤ) :
coeff n ((k : PowerSeries ℤ) * G) = (k : ℤ) * coeff n G := by n:ℕk:ℕG:ℤ⟦X⟧⊢ (coeff n) (↑k * G) = ↑k * (coeff n) G
have h : (k : PowerSeries ℤ) = C (k : ℤ) := by simp n:ℕk:ℕG:ℤ⟦X⟧h:↑k = C ↑k⊢ (coeff n) (↑k * G) = ↑k * (coeff n) G n:ℕk:ℕG:ℤ⟦X⟧h:↑k = C ↑k⊢ (coeff n) (↑k * G) = ↑k * (coeff n) G
rw [h, n:ℕk:ℕG:ℤ⟦X⟧h:↑k = C ↑k⊢ (coeff n) (C ↑k * G) = ↑k * (coeff n) G All goals completed! 🐙 coeff_C_mul n:ℕk:ℕG:ℤ⟦X⟧h:↑k = C ↑k⊢ ↑k * (coeff n) G = ↑k * (coeff n) G All goals completed! 🐙] All goals completed! 🐙@[category API, AMS 11]
private lemma coeff_ofNat (n k : ℕ) [k.AtLeastTwo] :
coeff n (ofNat(k) : PowerSeries ℤ) = if n = 0 then (ofNat(k) : ℤ) else 0 := by n:ℕk:ℕinst✝:k.AtLeastTwo⊢ (coeff n) (OfNat.ofNat k) = if n = 0 then OfNat.ofNat k else 0
exact coeff_natCast n k All goals completed! 🐙@[category API, AMS 11]
private lemma coeff_ofNat_mul (n k : ℕ) [k.AtLeastTwo] (G : PowerSeries ℤ) :
coeff n ((ofNat(k) : PowerSeries ℤ) * G) = (ofNat(k) : ℤ) * coeff n G := by n:ℕk:ℕinst✝:k.AtLeastTwoG:ℤ⟦X⟧⊢ (coeff n) (OfNat.ofNat k * G) = OfNat.ofNat k * (coeff n) G
exact coeff_natCast_mul n k G All goals completed! 🐙
@[category API, AMS 11]
private lemma f_4 : f 4 = -5 := by ⊢ f 4 = -5
have ht : PowerSeries.mk (fun k => if k < 4 then f k else 0) =
(1 + X - X ^ 2 + 2 * X ^ 3 : PowerSeries ℤ) := by
ext n n:ℕ⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5
by_cases hn : n < 4 pos n:ℕhn:n < 4⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3)neg n:ℕhn:¬n < 4⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5
· pos n:ℕhn:n < 4⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5 interval_cases n pos.«0» n:ℕhn:0 < 4⊢ (coeff 0) (mk fun k ↦ if k < 4 then f k else 0) = (coeff 0) (1 + X - X ^ 2 + 2 * X ^ 3)pos.«1» n:ℕhn:1 < 4⊢ (coeff 1) (mk fun k ↦ if k < 4 then f k else 0) = (coeff 1) (1 + X - X ^ 2 + 2 * X ^ 3)pos.«2» n:ℕhn:2 < 4⊢ (coeff 2) (mk fun k ↦ if k < 4 then f k else 0) = (coeff 2) (1 + X - X ^ 2 + 2 * X ^ 3)pos.«3» n:ℕhn:3 < 4⊢ (coeff 3) (mk fun k ↦ if k < 4 then f k else 0) = (coeff 3) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5 <;> pos.«0» n:ℕhn:0 < 4⊢ (coeff 0) (mk fun k ↦ if k < 4 then f k else 0) = (coeff 0) (1 + X - X ^ 2 + 2 * X ^ 3)pos.«1» n:ℕhn:1 < 4⊢ (coeff 1) (mk fun k ↦ if k < 4 then f k else 0) = (coeff 1) (1 + X - X ^ 2 + 2 * X ^ 3)pos.«2» n:ℕhn:2 < 4⊢ (coeff 2) (mk fun k ↦ if k < 4 then f k else 0) = (coeff 2) (1 + X - X ^ 2 + 2 * X ^ 3)pos.«3» n:ℕhn:3 < 4⊢ (coeff 3) (mk fun k ↦ if k < 4 then f k else 0) = (coeff 3) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5
norm_num [coeff_mk, f_0, f_1, f_2, f_3, coeff_X_pow, coeff_X, coeff_ofNat_mul] All goals completed! 🐙 ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5
· neg n:ℕhn:¬n < 4⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5 have h0 : n ≠ 0 := by ⊢ f 4 = -5 neg n:ℕhn:¬n < 4h0:n ≠ 0⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5 omeganeg n:ℕhn:¬n < 4h0:n ≠ 0⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5neg n:ℕhn:¬n < 4h0:n ≠ 0⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5
have h1 : n ≠ 1 := by ⊢ f 4 = -5 neg n:ℕhn:¬n < 4h0:n ≠ 0h1:n ≠ 1⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5 omeganeg n:ℕhn:¬n < 4h0:n ≠ 0h1:n ≠ 1⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5neg n:ℕhn:¬n < 4h0:n ≠ 0h1:n ≠ 1⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5
have h2 : n ≠ 2 := by ⊢ f 4 = -5 neg n:ℕhn:¬n < 4h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5 omeganeg n:ℕhn:¬n < 4h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5neg n:ℕhn:¬n < 4h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5
have h3 : n ≠ 3 := by ⊢ f 4 = -5 neg n:ℕhn:¬n < 4h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2h3:n ≠ 3⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5 omeganeg n:ℕhn:¬n < 4h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2h3:n ≠ 3⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5neg n:ℕhn:¬n < 4h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2h3:n ≠ 3⊢ (coeff n) (mk fun k ↦ if k < 4 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3) ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5
simp [coeff_mk, hn, coeff_X_pow, h0, h1, h2, h3, coeff_X, coeff_ofNat_mul] ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5 ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ f 4 = -5
rw [f_eq ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ (if 4 = 0 then 1
else if 4 = 1 then 1 else -((coeff 4) ((mk fun k ↦ if k < 4 then f k else 0) ^ primeN 4) / ↑(primeN 4))) =
-5 ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ (if 4 = 0 then 1
else if 4 = 1 then 1 else -((coeff 4) ((mk fun k ↦ if k < 4 then f k else 0) ^ primeN 4) / ↑(primeN 4))) =
-5] ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ (if 4 = 0 then 1
else if 4 = 1 then 1 else -((coeff 4) ((mk fun k ↦ if k < 4 then f k else 0) ^ primeN 4) / ↑(primeN 4))) =
-5
norm_num only [primeN, Nat.reduceSub, Nat.nth_prime_three_eq_seven, Nat.cast_ofNat,
show (4 : ℕ) ≠ 0 from by ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ 4 ≠ 0 decide All goals completed! 🐙, show (4 : ℕ) ≠ 1 from by ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ 4 ≠ 1 decide All goals completed! 🐙, if_false]
rw [ht ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ -((coeff 4) ((1 + X - X ^ 2 + 2 * X ^ 3) ^ 7) / 7) = -5 ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ -((coeff 4) ((1 + X - X ^ 2 + 2 * X ^ 3) ^ 7) / 7) = -5] ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ -((coeff 4) ((1 + X - X ^ 2 + 2 * X ^ 3) ^ 7) / 7) = -5
ring_nf ht:(mk fun k ↦ if k < 4 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3⊢ -((coeff 4)
(1 + X * 7 + X ^ 2 * 14 + X ^ 3 * 7 + X ^ 4 * 35 + X ^ 5 * 112 + X ^ 6 * 21 + X ^ 7 * 29 + X ^ 8 * 427 -
X ^ 10 * 175 +
X ^ 11 * 1057 -
X ^ 12 * 294 -
X ^ 13 * 427 +
X ^ 14 * 1735 -
X ^ 15 * 1134 +
X ^ 16 * 140 +
X ^ 17 * 1288 -
X ^ 18 * 1456 +
X ^ 19 * 1120 -
X ^ 20 * 448 +
X ^ 21 * 128) /
7) =
-5
norm_num [map_add, coeff_mul, coeff_X_pow, coeff_X, coeff_ofNat, map_ofNat,
Finset.Nat.sum_antidiagonal_eq_sum_range_succ_mk, Finset.sum_range_succ] All goals completed! 🐙
@[category API, AMS 11]
private lemma f_5 : f 5 = 13 := by ⊢ f 5 = 13
have ht : PowerSeries.mk (fun k => if k < 5 then f k else 0) =
(1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4 : PowerSeries ℤ) := by
ext n n:ℕ⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
by_cases hn : n < 5 pos n:ℕhn:n < 5⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4)neg n:ℕhn:¬n < 5⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
· pos n:ℕhn:n < 5⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13 interval_cases n pos.«0» n:ℕhn:0 < 5⊢ (coeff 0) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 0) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4)pos.«1» n:ℕhn:1 < 5⊢ (coeff 1) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 1) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4)pos.«2» n:ℕhn:2 < 5⊢ (coeff 2) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 2) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4)pos.«3» n:ℕhn:3 < 5⊢ (coeff 3) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 3) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4)pos.«4» n:ℕhn:4 < 5⊢ (coeff 4) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 4) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13 <;> pos.«0» n:ℕhn:0 < 5⊢ (coeff 0) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 0) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4)pos.«1» n:ℕhn:1 < 5⊢ (coeff 1) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 1) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4)pos.«2» n:ℕhn:2 < 5⊢ (coeff 2) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 2) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4)pos.«3» n:ℕhn:3 < 5⊢ (coeff 3) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 3) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4)pos.«4» n:ℕhn:4 < 5⊢ (coeff 4) (mk fun k ↦ if k < 5 then f k else 0) = (coeff 4) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
norm_num [coeff_mk, f_0, f_1, f_2, f_3, f_4, coeff_X_pow, coeff_X, coeff_ofNat_mul] All goals completed! 🐙 ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
· neg n:ℕhn:¬n < 5⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13 have h0 : n ≠ 0 := by ⊢ f 5 = 13 neg n:ℕhn:¬n < 5h0:n ≠ 0⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13 omeganeg n:ℕhn:¬n < 5h0:n ≠ 0⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13neg n:ℕhn:¬n < 5h0:n ≠ 0⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
have h1 : n ≠ 1 := by ⊢ f 5 = 13 neg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13 omeganeg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13neg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
have h2 : n ≠ 2 := by ⊢ f 5 = 13 neg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13 omeganeg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13neg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
have h3 : n ≠ 3 := by ⊢ f 5 = 13 neg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2h3:n ≠ 3⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13 omeganeg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2h3:n ≠ 3⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13neg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2h3:n ≠ 3⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
have h4 : n ≠ 4 := by ⊢ f 5 = 13 neg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2h3:n ≠ 3h4:n ≠ 4⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13 omeganeg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2h3:n ≠ 3h4:n ≠ 4⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13neg n:ℕhn:¬n < 5h0:n ≠ 0h1:n ≠ 1h2:n ≠ 2h3:n ≠ 3h4:n ≠ 4⊢ (coeff n) (mk fun k ↦ if k < 5 then f k else 0) = (coeff n) (1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
simp [coeff_mk, hn, coeff_X_pow, h0, h1, h2, h3, h4, coeff_X, coeff_ofNat_mul] ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13 ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ f 5 = 13
rw [f_eq ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ (if 5 = 0 then 1
else if 5 = 1 then 1 else -((coeff 5) ((mk fun k ↦ if k < 5 then f k else 0) ^ primeN 5) / ↑(primeN 5))) =
13 ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ (if 5 = 0 then 1
else if 5 = 1 then 1 else -((coeff 5) ((mk fun k ↦ if k < 5 then f k else 0) ^ primeN 5) / ↑(primeN 5))) =
13] ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ (if 5 = 0 then 1
else if 5 = 1 then 1 else -((coeff 5) ((mk fun k ↦ if k < 5 then f k else 0) ^ primeN 5) / ↑(primeN 5))) =
13
norm_num only [primeN, Nat.reduceSub, Nat.nth_prime_four_eq_eleven, Nat.cast_ofNat,
show (5 : ℕ) ≠ 0 from by ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ 5 ≠ 0 decide All goals completed! 🐙, show (5 : ℕ) ≠ 1 from by ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ 5 ≠ 1 decide All goals completed! 🐙, if_false]
rw [ht ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ -((coeff 5) ((1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ^ 11) / 11) = 13 ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ -((coeff 5) ((1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ^ 11) / 11) = 13] ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ -((coeff 5) ((1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4) ^ 11) / 11) = 13
ring_nf ht:(mk fun k ↦ if k < 5 then f k else 0) = 1 + X - X ^ 2 + 2 * X ^ 3 - 5 * X ^ 4⊢ -((coeff 5)
(1 + X * 11 + X ^ 2 * 44 + X ^ 3 * 77 + X ^ 4 * 55 - X ^ 5 * 143 - X ^ 6 * 1078 - X ^ 7 * 2222 - X ^ 8 * 1331 -
X ^ 9 * 110 +
X ^ 10 * 10769 +
X ^ 11 * 32429 +
X ^ 12 * 8756 +
X ^ 13 * 11473 -
X ^ 14 * 36740 -
X ^ 15 * 331738 +
X ^ 16 * 42427 -
X ^ 17 * 62612 -
X ^ 18 * 350581 +
X ^ 19 * 2753245 -
X ^ 20 * 1428350 +
X ^ 21 * 120505 +
X ^ 22 * 5650820 -
X ^ 23 * 19285750 +
X ^ 24 * 16905130 -
X ^ 25 * 5143699 -
X ^ 26 * 34672429 +
X ^ 27 * 104961164 -
X ^ 28 * 128245733 +
X ^ 29 * 93386920 +
X ^ 30 * 64320454 -
X ^ 31 * 347501176 +
X ^ 32 * 577229411 -
X ^ 33 * 662649227 +
X ^ 34 * 425239430 +
X ^ 35 * 190639625 -
X ^ 36 * 947395625 +
X ^ 37 * 1669146875 -
X ^ 38 * 2070681250 +
X ^ 39 * 2001312500 -
X ^ 40 * 1615625000 +
X ^ 41 * 1052734375 -
X ^ 42 * 537109375 +
X ^ 43 * 214843750 -
X ^ 44 * 48828125) /
11) =
13
norm_num [map_add, coeff_mul, coeff_X_pow, coeff_X, coeff_ofNat, map_ofNat,
Finset.Nat.sum_antidiagonal_eq_sum_range_succ_mk, Finset.sum_range_succ] All goals completed! 🐙
@[category API, AMS 11]
private lemma inv_coeff (n : ℕ) :
coeff n (invOfUnit series 1) = if n = 0 then 1 else
-∑ k ∈ Finset.range (n + 1),
if n - k < n then f k * coeff (n - k) (invOfUnit series 1) else 0 := by n:ℕ⊢ (coeff n) (series.invOfUnit 1) =
if n = 0 then 1 else -∑ k ∈ Finset.range (n + 1), if n - k < n then f k * (coeff (n - k)) (series.invOfUnit 1) else 0
rw [coeff_invOfUnit n:ℕ⊢ (if n = 0 then ↑1⁻¹
else
-↑1⁻¹ *
∑ x ∈ Finset.HasAntidiagonal.antidiagonal n,
if x.2 < n then (coeff x.1) series * (coeff x.2) (series.invOfUnit 1) else 0) =
if n = 0 then 1 else -∑ k ∈ Finset.range (n + 1), if n - k < n then f k * (coeff (n - k)) (series.invOfUnit 1) else 0 n:ℕ⊢ (if n = 0 then ↑1⁻¹
else
-↑1⁻¹ *
∑ x ∈ Finset.HasAntidiagonal.antidiagonal n,
if x.2 < n then (coeff x.1) series * (coeff x.2) (series.invOfUnit 1) else 0) =
if n = 0 then 1 else -∑ k ∈ Finset.range (n + 1), if n - k < n then f k * (coeff (n - k)) (series.invOfUnit 1) else 0] n:ℕ⊢ (if n = 0 then ↑1⁻¹
else
-↑1⁻¹ *
∑ x ∈ Finset.HasAntidiagonal.antidiagonal n,
if x.2 < n then (coeff x.1) series * (coeff x.2) (series.invOfUnit 1) else 0) =
if n = 0 then 1 else -∑ k ∈ Finset.range (n + 1), if n - k < n then f k * (coeff (n - k)) (series.invOfUnit 1) else 0
simp only [inv_one, Units.val_one, neg_one_mul, series, coeff_mk,
Finset.Nat.sum_antidiagonal_eq_sum_range_succ_mk] All goals completed! 🐙
@[category API, AMS 11]
private lemma inv_0 : coeff 0 (invOfUnit series 1) = 1 := by ⊢ (coeff 0) (series.invOfUnit 1) = 1
rw [inv_coeff ⊢ (if 0 = 0 then 1
else -∑ k ∈ Finset.range (0 + 1), if 0 - k < 0 then f k * (coeff (0 - k)) (series.invOfUnit 1) else 0) =
1 ⊢ (if 0 = 0 then 1
else -∑ k ∈ Finset.range (0 + 1), if 0 - k < 0 then f k * (coeff (0 - k)) (series.invOfUnit 1) else 0) =
1] ⊢ (if 0 = 0 then 1
else -∑ k ∈ Finset.range (0 + 1), if 0 - k < 0 then f k * (coeff (0 - k)) (series.invOfUnit 1) else 0) =
1
norm_num [Finset.sum_range_succ, f_0] All goals completed! 🐙
@[category API, AMS 11]
private lemma inv_1 : coeff 1 (invOfUnit series 1) = -1 := by ⊢ (coeff 1) (series.invOfUnit 1) = -1
rw [inv_coeff ⊢ (if 1 = 0 then 1
else -∑ k ∈ Finset.range (1 + 1), if 1 - k < 1 then f k * (coeff (1 - k)) (series.invOfUnit 1) else 0) =
-1 ⊢ (if 1 = 0 then 1
else -∑ k ∈ Finset.range (1 + 1), if 1 - k < 1 then f k * (coeff (1 - k)) (series.invOfUnit 1) else 0) =
-1] ⊢ (if 1 = 0 then 1
else -∑ k ∈ Finset.range (1 + 1), if 1 - k < 1 then f k * (coeff (1 - k)) (series.invOfUnit 1) else 0) =
-1
norm_num [Finset.sum_range_succ, f_0, f_1, inv_0] All goals completed! 🐙
@[category API, AMS 11]
private lemma inv_2 : coeff 2 (invOfUnit series 1) = 2 := by ⊢ (coeff 2) (series.invOfUnit 1) = 2
rw [inv_coeff ⊢ (if 2 = 0 then 1
else -∑ k ∈ Finset.range (2 + 1), if 2 - k < 2 then f k * (coeff (2 - k)) (series.invOfUnit 1) else 0) =
2 ⊢ (if 2 = 0 then 1
else -∑ k ∈ Finset.range (2 + 1), if 2 - k < 2 then f k * (coeff (2 - k)) (series.invOfUnit 1) else 0) =
2] ⊢ (if 2 = 0 then 1
else -∑ k ∈ Finset.range (2 + 1), if 2 - k < 2 then f k * (coeff (2 - k)) (series.invOfUnit 1) else 0) =
2
norm_num [Finset.sum_range_succ, f_0, f_1, f_2, inv_0, inv_1] All goals completed! 🐙
@[category API, AMS 11]
private lemma inv_3 : coeff 3 (invOfUnit series 1) = -5 := by ⊢ (coeff 3) (series.invOfUnit 1) = -5
rw [inv_coeff ⊢ (if 3 = 0 then 1
else -∑ k ∈ Finset.range (3 + 1), if 3 - k < 3 then f k * (coeff (3 - k)) (series.invOfUnit 1) else 0) =
-5 ⊢ (if 3 = 0 then 1
else -∑ k ∈ Finset.range (3 + 1), if 3 - k < 3 then f k * (coeff (3 - k)) (series.invOfUnit 1) else 0) =
-5] ⊢ (if 3 = 0 then 1
else -∑ k ∈ Finset.range (3 + 1), if 3 - k < 3 then f k * (coeff (3 - k)) (series.invOfUnit 1) else 0) =
-5
norm_num [Finset.sum_range_succ, f_0, f_1, f_2, f_3, inv_0, inv_1, inv_2] All goals completed! 🐙
@[category API, AMS 11]
private lemma inv_4 : coeff 4 (invOfUnit series 1) = 14 := by ⊢ (coeff 4) (series.invOfUnit 1) = 14
rw [inv_coeff ⊢ (if 4 = 0 then 1
else -∑ k ∈ Finset.range (4 + 1), if 4 - k < 4 then f k * (coeff (4 - k)) (series.invOfUnit 1) else 0) =
14 ⊢ (if 4 = 0 then 1
else -∑ k ∈ Finset.range (4 + 1), if 4 - k < 4 then f k * (coeff (4 - k)) (series.invOfUnit 1) else 0) =
14] ⊢ (if 4 = 0 then 1
else -∑ k ∈ Finset.range (4 + 1), if 4 - k < 4 then f k * (coeff (4 - k)) (series.invOfUnit 1) else 0) =
14
norm_num [Finset.sum_range_succ, f_0, f_1, f_2, f_3, f_4, inv_0, inv_1, inv_2, inv_3] All goals completed! 🐙
@[category API, AMS 11]
private lemma a_succ (n : ℕ) :
a (n + 1) = ∑ k ∈ Finset.range (n + 1),
(f (k + 1) * (k + 1)) * coeff (n - k) (invOfUnit series 1) := by n:ℕ⊢ a (n + 1) = ∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1)
rw [a, n:ℕ⊢ (coeff (n + 1)) (X * (d⁄dX ℤ) series * series.invOfUnit 1) =
∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1) n:ℕ⊢ ∑ k ∈ Finset.range (n + 1), (coeff k) ((d⁄dX ℤ) series) * (coeff (n - k)) (series.invOfUnit 1) =
∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1) mul_assoc, n:ℕ⊢ (coeff (n + 1)) (X * ((d⁄dX ℤ) series * series.invOfUnit 1)) =
∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1) n:ℕ⊢ ∑ k ∈ Finset.range (n + 1), (coeff k) ((d⁄dX ℤ) series) * (coeff (n - k)) (series.invOfUnit 1) =
∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1) coeff_succ_X_mul, n:ℕ⊢ (coeff n) ((d⁄dX ℤ) series * series.invOfUnit 1) =
∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1) n:ℕ⊢ ∑ k ∈ Finset.range (n + 1), (coeff k) ((d⁄dX ℤ) series) * (coeff (n - k)) (series.invOfUnit 1) =
∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1) coeff_mul_range n:ℕ⊢ ∑ k ∈ Finset.range (n + 1), (coeff k) ((d⁄dX ℤ) series) * (coeff (n - k)) (series.invOfUnit 1) =
∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1) n:ℕ⊢ ∑ k ∈ Finset.range (n + 1), (coeff k) ((d⁄dX ℤ) series) * (coeff (n - k)) (series.invOfUnit 1) =
∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1)] n:ℕ⊢ ∑ k ∈ Finset.range (n + 1), (coeff k) ((d⁄dX ℤ) series) * (coeff (n - k)) (series.invOfUnit 1) =
∑ k ∈ Finset.range (n + 1), f (k + 1) * (↑k + 1) * (coeff (n - k)) (series.invOfUnit 1)
simp only [coeff_derivative, series, coeff_mk] All goals completed! 🐙
@[category test, AMS 11]
theorem a_1 : a 1 = 1 := by ⊢ a 1 = 1
rw [show 1 = 0 + 1 from rfl, ⊢ a (0 + 1) = 1 ⊢ ∑ k ∈ Finset.range (0 + 1), f (k + 1) * (↑k + 1) * (coeff (0 - k)) (series.invOfUnit 1) = 1 a_succ ⊢ ∑ k ∈ Finset.range (0 + 1), f (k + 1) * (↑k + 1) * (coeff (0 - k)) (series.invOfUnit 1) = 1 ⊢ ∑ k ∈ Finset.range (0 + 1), f (k + 1) * (↑k + 1) * (coeff (0 - k)) (series.invOfUnit 1) = 1] ⊢ ∑ k ∈ Finset.range (0 + 1), f (k + 1) * (↑k + 1) * (coeff (0 - k)) (series.invOfUnit 1) = 1
norm_num [Finset.sum_range_succ, inv_0, inv_1, inv_2, inv_3, inv_4, f_0, f_1] All goals completed! 🐙
@[category test, AMS 11]
theorem a_2 : a 2 = -3 := by ⊢ a 2 = -3
rw [show 2 = 1 + 1 from rfl, ⊢ a (1 + 1) = -3 ⊢ ∑ k ∈ Finset.range (1 + 1), f (k + 1) * (↑k + 1) * (coeff (1 - k)) (series.invOfUnit 1) = -3 a_succ ⊢ ∑ k ∈ Finset.range (1 + 1), f (k + 1) * (↑k + 1) * (coeff (1 - k)) (series.invOfUnit 1) = -3 ⊢ ∑ k ∈ Finset.range (1 + 1), f (k + 1) * (↑k + 1) * (coeff (1 - k)) (series.invOfUnit 1) = -3] ⊢ ∑ k ∈ Finset.range (1 + 1), f (k + 1) * (↑k + 1) * (coeff (1 - k)) (series.invOfUnit 1) = -3
norm_num [Finset.sum_range_succ, inv_0, inv_1, inv_2, inv_3, inv_4, f_0, f_1, f_2] All goals completed! 🐙
@[category test, AMS 11]
theorem a_3 : a 3 = 10 := by ⊢ a 3 = 10
rw [show 3 = 2 + 1 from rfl, ⊢ a (2 + 1) = 10 ⊢ ∑ k ∈ Finset.range (2 + 1), f (k + 1) * (↑k + 1) * (coeff (2 - k)) (series.invOfUnit 1) = 10 a_succ ⊢ ∑ k ∈ Finset.range (2 + 1), f (k + 1) * (↑k + 1) * (coeff (2 - k)) (series.invOfUnit 1) = 10 ⊢ ∑ k ∈ Finset.range (2 + 1), f (k + 1) * (↑k + 1) * (coeff (2 - k)) (series.invOfUnit 1) = 10] ⊢ ∑ k ∈ Finset.range (2 + 1), f (k + 1) * (↑k + 1) * (coeff (2 - k)) (series.invOfUnit 1) = 10
norm_num [Finset.sum_range_succ, inv_0, inv_1, inv_2, inv_3, inv_4, f_0, f_1, f_2, f_3] All goals completed! 🐙
@[category test, AMS 11]
theorem a_4 : a 4 = -35 := by ⊢ a 4 = -35
rw [show 4 = 3 + 1 from rfl, ⊢ a (3 + 1) = -35 ⊢ ∑ k ∈ Finset.range (3 + 1), f (k + 1) * (↑k + 1) * (coeff (3 - k)) (series.invOfUnit 1) = -35 a_succ ⊢ ∑ k ∈ Finset.range (3 + 1), f (k + 1) * (↑k + 1) * (coeff (3 - k)) (series.invOfUnit 1) = -35 ⊢ ∑ k ∈ Finset.range (3 + 1), f (k + 1) * (↑k + 1) * (coeff (3 - k)) (series.invOfUnit 1) = -35] ⊢ ∑ k ∈ Finset.range (3 + 1), f (k + 1) * (↑k + 1) * (coeff (3 - k)) (series.invOfUnit 1) = -35
norm_num [Finset.sum_range_succ, inv_0, inv_1, inv_2, inv_3, inv_4, f_0, f_1, f_2, f_3, f_4] All goals completed! 🐙
@[category test, AMS 11]
theorem a_5 : a 5 = 121 := by ⊢ a 5 = 121
rw [show 5 = 4 + 1 from rfl, ⊢ a (4 + 1) = 121 ⊢ ∑ k ∈ Finset.range (4 + 1), f (k + 1) * (↑k + 1) * (coeff (4 - k)) (series.invOfUnit 1) = 121 a_succ ⊢ ∑ k ∈ Finset.range (4 + 1), f (k + 1) * (↑k + 1) * (coeff (4 - k)) (series.invOfUnit 1) = 121 ⊢ ∑ k ∈ Finset.range (4 + 1), f (k + 1) * (↑k + 1) * (coeff (4 - k)) (series.invOfUnit 1) = 121] ⊢ ∑ k ∈ Finset.range (4 + 1), f (k + 1) * (↑k + 1) * (coeff (4 - k)) (series.invOfUnit 1) = 121
norm_num [Finset.sum_range_succ, inv_0, inv_1, inv_2, inv_3, inv_4, f_0, f_1, f_2, f_3, f_4, f_5] All goals completed! 🐙"Conjecture: $a(n)$ is divisible by $\operatorname{prime}(n)$ for $n > 1$."
Paul D. Hanna, Mar 11 2025.
Proved and formalized in Lean by Wentao Li, with AI assistance; see [Li26].
@[category research solved, AMS 11,
formal_proof using lean4 at "https://github.com/VictorLiwentao/lean-oeis-proofs/blob/0a23974e54b90afd1453ef02c27cf8f617bad940/LeanOeisProofs/NewProofs/A381355.lean#L380"]
theorem conjecture (n : ℕ) (hn : 1 < n) : (primeN n : ℤ) ∣ a n := by n:ℕhn:1 < n⊢ ↑(primeN n) ∣ a n
sorry All goals completed! 🐙end OeisA381355