Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.9 (second half): [YΓn][Y_{\Gamma_n}][YΓn​​] has a negative coefficient

Proved
BananaF1.bananaComplementClass_coeff_neg

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

algebraic-geometrygrothendieck-ringmathematical-physicspolynomials

The second half of Lemma 3.9: the class of the hypersurface complement YΓn=Pn−1∖XΓnY_{\Gamma_n} = \mathbb{P}^{n-1} \smallsetminus X_{\Gamma_n}YΓn​​=Pn−1∖XΓn​​,

[YΓn]  =  Tn−1+(n−1)Tn−2+Tn−3−Tn−4+⋯±1,[Y_{\Gamma_n}] \;=\; \mathbb{T}^{n-1} + (n-1)\mathbb{T}^{n-2} + \mathbb{T}^{n-3} - \mathbb{T}^{n-4} + \cdots \pm 1,[YΓn​​]=Tn−1+(n−1)Tn−2+Tn−3−Tn−4+⋯±1,

fails the non-negativity condition of Lemma 3.8. The statement exhibits one explicit negative coefficient: for every n≥4n \ge 4n≥4 the coefficient of Tn−4\mathbb{T}^{n-4}Tn−4 equals −1-1−1. Consequently [YΓn][Y_{\Gamma_n}][YΓn​​] is not of the form ∑kakTk\sum_k a_k \mathbb{T}^k∑k​ak​Tk with all ak≥0a_k \ge 0ak​≥0, so the complement admits no torification in the sense of the source, in contrast with XΓnX_{\Gamma_n}XΓn​​.

Preamble
import Definitions.Def_bananaF1Classes
open Polynomial
Formal statement
namespace BananaF1

theorem bananaComplementClass_coeff_neg (n : ℕ) (hn : 4 ≤ n) :
    (bananaComplementClass n).coeff (n - 4) = -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.

For every natural number nnn satisfying n≥4n \ge 4n≥4, the statement asserts a single equality of integers: the coefficient of T n−4T^{\,n-4}Tn−4 in the polynomial

Qn  =  ∑j=0n−1(−1) n−1−j Tj  +  n T n−2  ∈  Z[T]Q_n \;=\; \sum_{j=0}^{n-1} (-1)^{\,n-1-j}\, T^{j} \;+\; n\,T^{\,n-2} \;\in\; \mathbb{Z}[T]Qn​=j=0∑n−1​(−1)n−1−jTj+nTn−2∈Z[T]

is equal to −1-1−1. The exponents n−4n-4n−4, n−1−jn-1-jn−1−j and n−2n-2n−2 are truncated natural subtractions; under the hypothesis n≥4n \ge 4n≥4 they are ordinary differences, and n−4≠n−2n - 4 \ne n - 2n−4=n−2, so the extra term n T n−2n\,T^{\,n-2}nTn−2 does not contribute to this coefficient.

The claim is about the single coefficient at index n−4n-4n−4 only. It does not assert that this is the only negative coefficient of QnQ_nQn​, nor does it make any statement about the polynomial HnH_nHn​, about positivity in general, or about any geometric object.

The hypothesis n≥4n \ge 4n≥4 is satisfiable, so the statement is not vacuous; it excludes n∈{0,1,2,3}n \in \{0,1,2,3\}n∈{0,1,2,3}, where n−4n-4n−4 would collapse to 000 under truncated subtraction.

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