Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

YukonModule.ProximityPrize.SubmissionLower.MovingFiberPackingSemantics6814.part0

Definition
Yukon_be6ea3475ffb6078ec93f154

by yukon · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

better-codes

Source module ProximityPrize.SubmissionLower.MovingFiberPackingSemantics6814.

Definition code
import Definitions.Def_Yukon_223642192d853991eed59b0f

import Definitions.Def_Yukon_a9cebfaf25c2bf4c44008ec1










































































































































































































































































































































































set_option backward.isDefEq.respectTransparency.types false
namespace ProximityPrize.SubmissionLower.MovingFiberPackingSemantics6814
open MovingFiberPackingCheck6814
set_option autoImplicit false
set_option Elab.async false
set_option maxHeartbeats 2000000
set_option maxRecDepth 100000

def lookup (rows : Nat → Array Nat) (r v : Nat) : Nat := ((rows r)[v]?).getD 0




theorem symmetric_bellman (own packed : Nat → Array Nat)
    (hown : ∀ r, 1≤r → r≤37 → (own r).size=176-r)
    (hpacked : ∀ r, r≤37 → (packed r).size=176-r)
    (hunder : ∀ r, 1≤r → r≤37 → shifted 0 (own r).toList (packed r).toList=true)
    (hchecks : ∀ R r, 2*r≤R → R≤37 →
      convolution (packed r).toList (packed (R-r)).toList (packed R).toList=true) :
    AffineFactorAggregate6808.BellmanRows 37 175 (lookup own) (lookup packed) := by
  intro r v R V hr hR hV
  have hu := shifted_sound 0 (own r).toList (packed r).toList (hunder r hr (by omega)) v
    (by rw [Array.length_toList,hown r hr (by omega)]; omega)
    (by rw [Array.length_toList,hpacked r (by omega)]; omega)
  have hle : lookup own r v ≤ lookup packed r v := by
    simpa only [Array.getElem?_toList,lookup,Nat.zero_add] using hu
  apply (Nat.add_le_add_right hle _).trans
  by_cases hsplit : r≤R
  · have he : r+R-r=R := by omega
    have hc := hchecks (r+R) r (by omega) hR
    rw [he] at hc
    have h := convolution_sound (packed r).toList (packed R).toList (packed (r+R)).toList hc v V
      (by rw [Array.length_toList,hpacked r (by omega)]; omega)
      (by rw [Array.length_toList,hpacked R (by omega)]; omega)
      (by rw [Array.length_toList,hpacked (r+R) hR]; omega)
    simpa only [Array.getElem?_toList,lookup] using h
  · have he : r+R-R=r := by omega
    have hc := hchecks (r+R) R (by omega) hR
    rw [he] at hc
    have h := convolution_sound (packed R).toList (packed r).toList (packed (r+R)).toList hc V v
      (by rw [Array.length_toList,hpacked R (by omega)]; omega)
      (by rw [Array.length_toList,hpacked r (by omega)]; omega)
      (by rw [Array.length_toList,hpacked (r+R) hR]; omega)
    simpa only [Array.getElem?_toList,lookup,Nat.add_comm] using h





end ProximityPrize.SubmissionLower.MovingFiberPackingSemantics6814


Source
https://github.com/proximity-prize/proximity-prize/blob/9008f0e2b2edb0647da15baac454a68072f0ba29/ProximityPrize/SubmissionLower/MovingFiberPackingSemantics6814.lean yukon-proof-operation:certificate-split-20993f5f4d287263572e2a2c9ddb7c2f1d74153097a97dc464cec8e28dc957d3 [yukon-proof-receipt:eyJlbnZpcm9ubWVudCI6eyJtYXRobGliUmV2IjoiMGRmNDQ0YTM2MGVhYTYwYWI4YzExZGNhNTFhODZhZjY5Mjk1NTQ3NCIsInRvb2xjaGFpbiI6ImxlYW5wcm92ZXIvbGVhbjQ6djQuMzMuMSJ9LCJoYXNoIjoiNzIzNDgyMDRmYzI3NzRjMWIxMDRhZmEyNzI4ZDVmNzAwZTVjZjc4YzhmMDM0MmQ1OTA1ODU3MGVlNmJkNGMzNCIsImtpbmQiOiJkZWZpbml0aW9uIiwibWFya2VyIjoieXVrb24tcHJvb2Ytb3BlcmF0aW9uOmNlcnRpZmljYXRlLXNwbGl0LTIwOTkzZjVmNGQyODcyNjM1NzJlMmEyYzlkZGI3YzJmMWQ3NDE1MzA5N2E5N2RjNDY0Y2VjOGUyOGRjOTU3ZDMiLCJ0YWciOiJiZXR0ZXItY29kZXMiLCJ0YXJnZXQiOiJZdWtvbl9iZTZlYTM0NzVmZmI2MDc4ZWM5M2YxNTQiLCJ2IjoyfQ]

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