Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eventual joint fractional certificate and guarded signed-unit bank states

Open
Erdos390.eventual_guarded_signed_bank_data_exists

by doctosil · Sep 16, 2026 · Mathlib c5ea003 (Lean v4.30.0)

combinatoricserdos390prime-valuations

Let c>C0c>C_0c>C0​, hn=⌈cn/log⁡n⌉h_n=\lceil cn/\log n\rceilhn​=⌈cn/logn⌉ and Mn=2n+hnM_n=2n+h_nMn​=2n+hn​. For all sufficiently large nnn, there is a joint guarded central anchor, charged fractional selector, and family of literal two-state bank slots satisfying the accompanying definition.

At every prime p≤yp\le yp≤y there are βp\beta_pβp​ slots of each sign, with

βp≥4⌊log⁡2Mn⌋⌊log⁡pMn⌋.\beta_p\ge4\lfloor\log_2 M_n\rfloor\lfloor\log_p M_n\rfloor.βp​≥4⌊log2​Mn​⌋⌊logp​Mn​⌋.

Each slot consists of two finite sets of legal positive factors, whose product-valuation difference is exactly +ep+e_p+ep​ or −ep-e_p−ep​. Both states avoid the anchor, fixed factors, and all candidates; states belonging to different slots are pairwise disjoint. The charged initial bank is precisely the union of all zero states.

The fractional weights lie in [0,1][0,1][0,1], have integer sums on complete rough-signature rows, and satisfy the exact charged valuation balance. The anchor and divisor DDD obey

∏A=(2nn)D,YD=∏2n<a≤Mna.\prod A=\binom{2n}{n}D,\qquad YD=\prod_{2n<a\le M_n}a.∏A=(n2n​)D,YD=2n<a≤Mn​∏​a.

This is the remaining geometric and analytic existence obligation. Its hypotheses concern individual factor states and their joint placement; universality for every bounded error follows separately from the finite signed-bank theorem.

Preamble
import Definitions.Def_erdos390_signed_bank_data
open Filter
open Erdos390
Formal statement
theorem Erdos390.eventual_guarded_signed_bank_data_exists :
    ∀ c : ℝ, C0 < c →
      ∀ᶠ n : ℕ in atTop,
        Nonempty (GuardedSignedBankData n (Nat.ceil (c * secondOrderScale n))) := by sorry
Source
Shouqiao Wang, A Proposed Solution to Erdos Problem 390, Section 5, Lemma precharged-universal-bank, bank-base-product and bank-all-factor-invariance; Sections 9-10, post-tangent-certificate, assembly-integer-row-certificate and assembly-valuation-certificate. https://github.com/ShouqiaoW/erdos/blob/61325b10bbdc29f4fb5e0618b414b9f2189333ad/390/paper.tex . Concrete state interface in BankPaperExactificationState.lean; joint post-tangent hypotheses in BankPaperUpperConstructionReduction.lean. Existence remains open.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me