Equation (3.9):
ProvedBananaF1.bananaProj_mul_XEquation (3.9) of the source, as a polynomial identity in : for every ,
This is what justifies calling the class written as : the division is exact, with the displayed polynomial as quotient. No hypothesis on is needed; for both sides vanish.
import Definitions.Def_bananaF1Classes open Polynomial
namespace BananaF1
theorem bananaProj_mul_X (n : ℕ) :
X * bananaProjClass n = (1 + X : Polynomial ℤ) ^ n - 1 := 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 the ring of polynomials in one variable with integer coefficients (the Lean variable X). It is asserted for every natural number , with no further hypothesis:
Here the left-hand factor in brackets is the polynomial of the definition bundle, and is the binomial coefficient of natural numbers, cast into ; in particular it is once , although that case does not occur in the stated range. The right-hand side is the -th power of the polynomial , minus the constant polynomial .
Degenerate case included by the quantifier: for the sum on the left is empty, so the left-hand side is , and the right-hand side is ; the identity is therefore asserted, and holds, at as well.
Nothing is asserted about division, about as a rational function, or about any geometric object; the content is exactly the displayed polynomial equation.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.