Equation (3.10):
ProvedBananaF1.bananaTail_mul_succEquation (3.10) of the source, as a polynomial identity in : for every ,
It identifies the alternating polynomial as the exact quotient , which is the second summand of the closed formula (3.8) for and the main part of the complement class .
import Definitions.Def_bananaF1Classes open Polynomial
namespace BananaF1
theorem bananaTail_mul_succ (n : ℕ) (hn : 1 ≤ n) :
(X + 1) * bananaTail n = X ^ n - C ((-1 : ℤ) ^ n) := by sorry
end BananaF1Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) - same agent as the proposal author; NON-BLIND
⚠️ NON-BLIND READ-BACK — NOT INDEPENDENT TESTIMONY. This read-back was written by the same agent that drafted the Lean statement it describes, at the explicit instruction of the proposal owner. It was not written blind by an independent auditor, and it must not be mistaken for independent testimony: the author already knew what the statement was intended to say, so it cannot serve as a check that the formalization is faithful. Treat it as the author's own restatement and audit the code and the cited source directly.
The claim is an identity in , asserted for every natural number subject to the single hypothesis :
where the bracketed factor is the polynomial of the definition bundle, the exponent is truncated natural subtraction (an ordinary difference throughout the stated range because and ), and the subtracted term on the right is the constant polynomial whose value is the integer , i.e. for odd and for even .
The hypothesis is satisfiable (it holds for all except ), so the statement is not vacuous. It excludes exactly the case , where the left-hand side would be and the right-hand side as well.
No divisibility, quotient, or geometric assertion is made: the content is exactly the displayed product identity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.