Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (3.9): T [Pn−1]=(1+T)n−1\mathbb{T}\,[\mathbb{P}^{n-1}] = (1+\mathbb{T})^n - 1T[Pn−1]=(1+T)n−1

Proved
BananaF1.bananaProj_mul_X

by LG · Sep 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrygrothendieck-ringmathematical-physicspolynomials

Equation (3.9) of the source, as a polynomial identity in Z[T]\mathbb{Z}[\mathbb{T}]Z[T]: for every n∈Nn \in \mathbb{N}n∈N,

T⋅∑k=1n(nk)Tk−1  =  (1+T)n−1.\mathbb{T} \cdot \sum_{k=1}^{n} \binom{n}{k} \mathbb{T}^{k-1} \;=\; (1+\mathbb{T})^n - 1 .T⋅k=1∑n​(kn​)Tk−1=(1+T)n−1.

This is what justifies calling ∑k=1n(nk)Tk−1\sum_{k=1}^{n} \binom{n}{k}\mathbb{T}^{k-1}∑k=1n​(kn​)Tk−1 the class [Pn−1][\mathbb{P}^{n-1}][Pn−1] written as ((1+T)n−1)/T((1+\mathbb{T})^n-1)/\mathbb{T}((1+T)n−1)/T: the division is exact, with the displayed polynomial as quotient. No hypothesis on nnn is needed; for n=0n = 0n=0 both sides vanish.

Preamble
import Definitions.Def_bananaF1Classes
open Polynomial
Formal statement
namespace BananaF1

theorem bananaProj_mul_X (n : ℕ) :
    X * bananaProjClass n = (1 + X : Polynomial ℤ) ^ n - 1 := by sorry

end BananaF1
Source
D. Bejleri, M. Marcolli, Quantum field theory over F_1, Journal of Geometry and Physics (2013), doi:10.1016/j.geomphys.2013.03.002 (https://doi.org/10.1016/j.geomphys.2013.03.002); Section 3.6, Lemma 3.9 together with equations (3.8), (3.9), (3.10), and the necessary conditions of Section 3.3 Proposition 3.1 and Section 3.5 Lemma 3.8. The closed formula (3.8) is Theorem 3.10 of P. Aluffi, M. Marcolli, Feynman motives of banana graphs, Commun. Number Theory Phys. 3 (2009), no. 1, 1-57, and the complement formula is Corollary 3.13 there.
Read-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 Z[T]\mathbb{Z}[T]Z[T] of polynomials in one variable TTT with integer coefficients (the Lean variable X). It is asserted for every natural number nnn, with no further hypothesis:

T⋅(∑k=0n−1(nk+1) Tk)  =  (1+T)n−1.T \cdot \left( \sum_{k=0}^{n-1} \binom{n}{k+1}\, T^{k} \right) \;=\; (1 + T)^{n} - 1 .T⋅(k=0∑n−1​(k+1n​)Tk)=(1+T)n−1.

Here the left-hand factor in brackets is the polynomial PnP_nPn​ of the definition bundle, and (nk+1)\binom{n}{k+1}(k+1n​) is the binomial coefficient of natural numbers, cast into Z\mathbb{Z}Z; in particular it is 000 once k+1>nk+1 > nk+1>n, although that case does not occur in the stated range. The right-hand side is the nnn-th power of the polynomial 1+T1 + T1+T, minus the constant polynomial 111.

Degenerate case included by the quantifier: for n=0n = 0n=0 the sum on the left is empty, so the left-hand side is 000, and the right-hand side is (1+T)0−1=1−1=0(1+T)^0 - 1 = 1 - 1 = 0(1+T)0−1=1−1=0; the identity is therefore asserted, and holds, at n=0n = 0n=0 as well.

Nothing is asserted about division, about ((1+T)n−1)/T\left((1+T)^n - 1\right)/T((1+T)n−1)/T as a rational function, or about any geometric object; the content is exactly the displayed polynomial equation.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 24, 2026

    Confirmed by the mission captain (proposal self-audit).

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