Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Algo2LeanLib.FibonacciRings definitions

Definition
Algo2LeanLib_FibonacciRings

by lunjia · Oct 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

algo2leanalgorithmsclrsdata-structuresrunning-timetextbook

Definitions and required structural lemmas from Algo2LeanLib.FibonacciRings. Source declarations are retained by compiler-reported ranges; imports are redirected to the corresponding definition bundles. This bundle contains no theorem stubs.

<!-- algo2lean-provenance-v0.1.4 -->

Algo2Lean provenance and reproduction. These definitions target Algo2Lean v0.1.4, using the compiler source at public commit 0f79d5e4242e6477531c9ee4410409f5b1c92f76, and Lean 4.33.1. The versioned compiler location is Algo2Lean v0.1.4. Compile all supplied .algo files and imports to reproduce the raw generated definitions. Release publication and exact website parity require their separately recorded checks; this metadata alone does not assert them. Prove2Me imports and declaration packaging are mechanically adapted, with original hashes, compiler-reported source ranges, and adaptations recorded in transplant provenance. Exact reproduction does not prove the compiler correct.

Definition code
import Std

set_option autoImplicit true
set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true



set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true

/-!
Finite circular doubly linked lists for Fibonacci-heap pointer proofs.

The representation is independent of heaps and sequence references: `left` and
`right` are the integer-indexed pointer arrays observed through an allocated
sequence. Primitive effects below follow the source's precise write order.
-/

namespace Algo2Lean.Fibonacci.Rings

def write (values : Int → Int) (index value : Int) : Int → Int :=
  fun other => if other = index then value else values other

@[simp] theorem write_same (values : Int → Int) (index value : Int) :
    write values index value index = value := by simp [write]

@[simp] theorem write_other (values : Int → Int) (index value other : Int)
    (different : other ≠ index) : write values index value other = values other := by
  simp [write, different]

/-- An open chain records both pointers along every adjacent pair. Its first
    predecessor and last successor are supplied by the enclosing ring. -/
inductive Chain (left right : Int → Int) : Int → List Int → Int → Prop where
  | singleton (vertex : Int) : Chain left right vertex [vertex] vertex
  | cons (first : Int) {next last : Int} {tail : List Int} :
      right first = next → left next = first → Chain left right next tail last →
      Chain left right first (first :: tail) last

/-- A nonempty ring in its chosen traversal order. Rotating the list changes
    the chosen head while describing exactly the same pointer arrays. -/
structure Ring (left right : Int → Int) (vertices : List Int) : Prop where
  unique : vertices.Nodup
  closed : ∃ first last, Chain left right first vertices last ∧ right last = first ∧ left first = last

def RingOrEmpty (left right : Int → Int) (vertices : List Int) : Prop :=
  vertices = [] ∨ Ring left right vertices





















def insertBeforeLeft (left : Int → Int) (head vertex : Int) : Int → Int :=
  write (write left vertex (left head)) head vertex

def insertBeforeRight (left right : Int → Int) (head vertex : Int) : Int → Int :=
  write (write right vertex head) (left head) vertex

def removeLeft (left right : Int → Int) (vertex : Int) : Int → Int :=
  write (write left (right vertex) (left vertex)) vertex vertex

def removeRight (left right : Int → Int) (vertex : Int) : Int → Int :=
  write (write right (left vertex) (right vertex)) vertex vertex



























/-- The root-list helper inserts after its minimum representative. These are
    its exact effects, distinct from the child-list insertion before its head. -/
def insertAfterLeft (left right : Int → Int) (head vertex : Int) : Int → Int :=
  write (write left vertex head) (right head) vertex

def insertAfterRight (right : Int → Int) (head vertex : Int) : Int → Int :=
  write (write right vertex (right head)) head vertex





end Algo2Lean.Fibonacci.Rings
Source
https://github.com/lunjiah/algo2lean/blob/0f79d5e4242e6477531c9ee4410409f5b1c92f76/Algo2LeanLib/FibonacciRings.lean

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