ComparatorChallenges/BinPackingGap.lean
Explanation legend Lean4 Domain Explanation Language (L4DEL)
L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.
- L4DEL
- Lean4 Domain Explanation Language
Credit: OpenAI's pinned repository says an unreleased internal model produced the manuscripts and supporting proof artifacts. The collection builds on the mathematics community's accumulated problems, results, language, and formal libraries; each manuscript's BibTeX and bibliography are the authority for individual scholarly credit.
Project sources: Pinned openai/math documentation, Pinned formalization catalogue
75 declarations, 1 contain sorry, 0 declared as axioms
- def
OAI.BinPackingGames.Foundations.Complexity.encodeWordline 9Also declared: OAI/Computability/BinPacking/Model.lean:9 (same declaration text).
- def
OAI.BinPackingGames.Foundations.Complexity.MachineFiniteAlphabet.FiniteAlphabetline 17Also declared: OAI/Computability/BinPacking/Model.lean:17 (same declaration text).
- def
OAI.BinPackingGames.Foundations.Complexity.CookLevin.pairBitsline 23Also declared: OAI/Computability/BinPacking/Model.lean:23 (same declaration text).
- structure
OAI.BinPackingGames.Foundations.Complexity.CookLevin.NPVerifierline 26Also declared: OAI/Computability/BinPacking/Model.lean:26 (same declaration text).
- def
OAI.BinPackingGames.Foundations.Complexity.CookLevin.NPVerifier.Acceptsline 32Also declared: OAI/Computability/BinPacking/Model.lean:32 (same declaration text).
- def
OAI.BinPackingGames.Foundations.Complexity.CookLevin.InNPline 37Also declared: OAI/Computability/BinPacking/Model.lean:37 (same declaration text).
- def
OAI.BinPackingCompleteness.BinaryEncoding.bitsValueline 44Also declared: OAI/Computability/BinPacking/Model.lean:44 (same declaration text).
- def
OAI.BinPackingCompleteness.BinaryEncoding.frameline 48Also declared: OAI/Computability/BinPacking/Model.lean:48 (same declaration text).
- def
OAI.BinPackingCompleteness.BinaryEncoding.parseFrameline 52Also declared: OAI/Computability/BinPacking/Model.lean:52 (same declaration text).
- def
OAI.BinPackingCompleteness.BinaryEncoding.nameBitsline 59Also declared: OAI/Computability/BinPacking/Model.lean:59 (same declaration text).
- def
OAI.BinPackingCompleteness.BinaryEncoding.parseNameline 61Also declared: OAI/Computability/BinPacking/Model.lean:61 (same declaration text).
- structure
OAI.BinPackingGap.Instanceline 72Also declared: OAI/Computability/BinPacking/Model.lean:72 (same declaration text).
- abbrev
OAI.BinPackingGap.Instance.Itemline 80Also declared: OAI/Computability/BinPacking/Model.lean:80 (same declaration text).
- structure
OAI.BinPackingGap.Packingline 84Also declared: OAI/Computability/BinPacking/Model.lean:84 (same declaration text).
- def
OAI.BinPackingGap.HasPackingline 88Also declared: OAI/Computability/BinPacking/Model.lean:88 (same declaration text).
- def
OAI.BinPackingGap.singletonPackingline 90Also declared: OAI/Computability/BinPacking/Model.lean:90 (same declaration text).
- theorem
OAI.BinPackingGap.exists_packingline 103Also declared: OAI/Computability/BinPacking/Model.lean:103 (same declaration text).
- def
OAI.BinPackingGap.optline 106Also declared: OAI/Computability/BinPacking/Model.lean:106 (same declaration text).
- def
OAI.BinPackingGap.IndividualConfigurationline 110Also declared: OAI/Computability/BinPacking/Model.lean:110 (same declaration text).
- instance
OAI.BinPackingGap.(instance at line 113)line 113 - def
OAI.BinPackingGap.NumericalSizeline 116Also declared: OAI/Computability/BinPacking/Model.lean:116 (same declaration text).
- instance
OAI.BinPackingGap.(instance at line 118)line 118 - theorem
OAI.BinPackingGap.NumericalSize.positiveline 125Also declared: OAI/Computability/BinPacking/Model.lean:125 (same declaration text).
Checked implications (found by the pipeline and checked by Lean's kernel when it ran; a recorded result, not checked again in this build: what these are)
Gives
- together with
OAI.PerfectCompleteness.Theorem11.exists_reduction, gives∀ {I : OAI.BinPackingGap.Instance} (s : OAI.BinPackingGap.NumericalSize I), ↑s < 1 → Nonempty (OAI.PerfectCompleteness.BinaryGapReduction ↑s)(short composition) checked derivation
- together with
- def
OAI.BinPackingGap.NumericalSize.multiplicityline 130Also declared: OAI/Computability/BinPacking/Model.lean:130 (same declaration text).
- def
OAI.BinPackingGap.NumericalSize.capacityBoundline 133Also declared: OAI/Computability/BinPacking/Model.lean:133 (same declaration text).
- theorem
OAI.BinPackingGap.NumericalSize.capacityBound_specline 136Also declared: OAI/Computability/BinPacking/Model.lean:136 (same declaration text).
- def
OAI.BinPackingGap.TypeConfigurationline 141Also declared: OAI/Computability/BinPacking/Model.lean:141 (same declaration text).
- theorem
OAI.BinPackingGap.TypeConfiguration.count_lt_boundline 148Also declared: OAI/Computability/BinPacking/Model.lean:148 (same declaration text).
Checked implications (found by the pipeline and checked by Lean's kernel when it ran; a recorded result, not checked again in this build: what these are)
Gives
- together with
OAI.Problem337.egyptian_length_is_minimum, gives∀ {I : OAI.BinPackingGap.Instance} (c : OAI.BinPackingGap.TypeConfiguration I) (s : OAI.BinPackingGap.NumericalSize I), 1 ≤ ↑c s → (∃ n, OAI.Problem337.IsEgyptianExpansion (↑(↑c s) / ↑s.capacityBound) n) ∧ ∀ (k : ℕ), (∃…(short composition) checked derivation
- together with
- def
OAI.BinPackingGap.TypeConfiguration.boundedCountsline 159Also declared: OAI/Computability/BinPacking/Model.lean:159 (same declaration text).
- theorem
OAI.BinPackingGap.TypeConfiguration.boundedCounts_injectiveline 162Also declared: OAI/Computability/BinPacking/Model.lean:162 (same declaration text).
- instance
OAI.BinPackingGap.TypeConfiguration.(instance at line 170)line 170 - instance
OAI.BinPackingGap.TypeConfiguration.(instance at line 174)line 174 - def
OAI.BinPackingGap.FractionalCover.Feasibleline 183Also declared: OAI/Computability/BinPacking/Model.lean:183 (same declaration text).
- def
OAI.BinPackingGap.FractionalCover.objectiveline 186Also declared: OAI/Computability/BinPacking/Model.lean:186 (same declaration text).
- def
OAI.BinPackingGap.FractionalCover.objectiveSetline 188Also declared: OAI/Computability/BinPacking/Model.lean:188 (same declaration text).
- def
OAI.BinPackingGap.FractionalCover.valueline 191Also declared: OAI/Computability/BinPacking/Model.lean:191 (same declaration text).
- def
OAI.BinPackingGap.individualMatrixline 196Also declared: OAI/Computability/BinPacking/Model.lean:196 (same declaration text).
- def
OAI.BinPackingGap.individualLPline 199Also declared: OAI/Computability/BinPacking/Model.lean:199 (same declaration text).
- def
OAI.BinPackingGap.typeMatrixline 202Also declared: OAI/Computability/BinPacking/Model.lean:202 (same declaration text).
- def
OAI.BinPackingGap.typeLPline 205Also declared: OAI/Computability/BinPacking/Model.lean:205 (same declaration text).
- abbrev
OAI.BinPackingGap.RawInstanceline 208Also declared: OAI/Computability/BinPacking/Model.lean:208 (same declaration text).
- abbrev
OAI.BinPackingGap.RawReductionOutputline 210Also declared: OAI/Computability/BinPacking/Model.lean:210 (same declaration text).
- def
OAI.BinPackingGap.RawInstance.Validline 214Also declared: OAI/Computability/BinPacking/Model.lean:214 (same declaration text).
- def
OAI.BinPackingGap.RawInstance.ratValueline 217Also declared: OAI/Computability/BinPacking/Model.lean:217 (same declaration text).
- theorem
OAI.BinPackingGap.RawInstance.den_posline 219Also declared: OAI/Computability/BinPacking/Model.lean:219 (same declaration text).
- def
OAI.BinPackingGap.RawInstance.toInstanceline 222Also declared: OAI/Computability/BinPacking/Model.lean:222 (same declaration text).
- structure
OAI.BinPackingGap.RawPackingline 232Also declared: OAI/Computability/BinPacking/Model.lean:232 (same declaration text).
- def
OAI.BinPackingGap.RawPacking.loadline 238Also declared: OAI/Computability/BinPacking/Model.lean:238 (same declaration text).
- def
OAI.BinPackingGap.RawPacking.Feasibleline 242Also declared: OAI/Computability/BinPacking/Model.lean:242 (same declaration text).
- abbrev
OAI.BinPackingGap.BinaryEncoding.natBitsline 251Also declared: OAI/Computability/BinPacking/Model.lean:251 (same declaration text).
- abbrev
OAI.BinPackingGap.BinaryEncoding.parseNatline 253Also declared: OAI/Computability/BinPacking/Model.lean:253 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.listBitsline 255Also declared: OAI/Computability/BinPacking/Model.lean:255 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.pairBitsline 259Also declared: OAI/Computability/BinPacking/Model.lean:259 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.optionBitsline 262Also declared: OAI/Computability/BinPacking/Model.lean:262 (same declaration text).
- abbrev
OAI.BinPackingGap.BinaryEncoding.Parserline 266Also declared: OAI/Computability/BinPacking/Model.lean:266 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.parsePairline 268Also declared: OAI/Computability/BinPacking/Model.lean:268 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.parseListAuxline 274Also declared: OAI/Computability/BinPacking/Model.lean:274 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.parseListline 283Also declared: OAI/Computability/BinPacking/Model.lean:283 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.decodeline 286Also declared: OAI/Computability/BinPacking/Model.lean:286 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.rawInstanceBitsline 290Also declared: OAI/Computability/BinPacking/Model.lean:290 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.assignmentBitsline 293Also declared: OAI/Computability/BinPacking/Model.lean:293 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.rawPackingBitsline 295Also declared: OAI/Computability/BinPacking/Model.lean:295 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.packingResultBitsline 298Also declared: OAI/Computability/BinPacking/Model.lean:298 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.rawReductionOutputBitsline 300Also declared: OAI/Computability/BinPacking/Model.lean:300 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.parseRawInstanceline 303Also declared: OAI/Computability/BinPacking/Model.lean:303 (same declaration text).
- def
OAI.BinPackingGap.BinaryEncoding.decodeRawInstanceline 305Also declared: OAI/Computability/BinPacking/Model.lean:305 (same declaration text).
- abbrev
OAI.BinPackingGap.BitLanguageline 313Also declared: OAI/Computability/BinPacking/Model.lean:311 (same declaration text).
- def
OAI.BinPackingGap.InPline 315Also declared: OAI/Computability/BinPacking/Model.lean:313 (same declaration text).
- def
OAI.BinPackingGap.ClassPline 322Also declared: OAI/Computability/BinPacking/Model.lean:320 (same declaration text).
- def
OAI.BinPackingGap.ClassNPline 324Also declared: OAI/Computability/BinPacking/Model.lean:322 (same declaration text).
- def
OAI.BinPackingGap.PEqualsNPline 326Also declared: OAI/Computability/BinPacking/Model.lean:324 (same declaration text).
- structure
OAI.BinPackingGap.AbsoluteAdditiveAlgorithmline 328Also declared: OAI/Computability/BinPacking/Model.lean:326 (same declaration text).
- structure
OAI.BinPackingGap.PackingGapReductionline 337Also declared: OAI/Computability/BinPacking/Model.lean:335 (same declaration text).
- def
OAI.BinPackingGap.PackingGapNPHardline 351Also declared: OAI/Computability/BinPacking/Model.lean:349 (same declaration text).
- theorem
OAI.BinPackingGap.main_resultsChallenge statement: Bin packing and unbounded configuration-LP gaps sorry line 356L4DEL explanation
The formalized results rule out a universal additive bound for the configuration linear program in bin packing. For every integer $c\ge0$, there are an integer $B$ and a rational instance with $5B$ items whose individual-copy and size-type configuration-LP values both equal $B$, but whose integral optimum is greater than $B+c$. Distinguishing a packing in $B$ bins from the absence of one in $B+c$ bins is NP-hard for each fixed $c$. A deterministic polynomial-time algorithm with a fixed absolute additive allowance exists exactly when $P=NP$; under that equality, an optimal algorithm is constructed.
- This is an exact comparator target linked by the pinned repository's formalization note for this result.
- The repository's comparator configuration selects OAI.Computability.BinPacking.Main as the released solution module checked against this declaration.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Distinct definitions of this name: OAI/Computability/BinPacking/Main.lean:7 (same statement text; different proof or body). Qualify references as OAI.BinPackingGap.main_results@path.
theorem main_results : (∀ c : ℕ, ∃ I : Instance, ∃ B : ℕ, I.n = 5 * B ∧ (∀ i, (1 / 6 : ℚ) < I.size i ∧ I.size i < 1) ∧ B + c < opt I ∧ individualLP I = (B : ℝ) ∧ typeLP I = (B : ℝ)) ∧ (∀ c : Nat, PackingGapNPHard c) ∧ ((∃ c : Nat, Nonempty (AbsoluteAdditiveAlgorithm c)) ↔ PEqualsNP) ∧ (PEqualsNP → ∃ algorithm : AbsoluteAdditiveAlgorithm 0, (∀ (items : RawInstance) (valid : items.Valid), ∃ packing : RawPacking, algorithm.run (BinaryEncoding.rawInstanceBits items) = some packing ∧ packing.Feasible items ∧ packing.bins = opt (items.toInstance valid)) ∧ algorithm.run (BinaryEncoding.rawInstanceBits []) = some ⟨0, []⟩ ∧ …Mentions: OAI.BinPackingGap.Instance, OAI.BinPackingGap.opt, OAI.BinPackingGap.individualLP, OAI.BinPackingGap.typeLP, OAI.BinPackingGap.PackingGapNPHard, OAI.BinPackingGap.AbsoluteAdditiveAlgorithm, OAI.BinPackingGap.PEqualsNP, OAI.BinPackingGap.RawInstance, OAI.BinPackingGap.RawPacking, OAI.BinPackingGap.BinaryEncoding.rawInstanceBits