Skip to content

Fixed dirCycle pmap and is_well_defined #13

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Shreyas4991 merged 1 commit into from
Feb 28, 2026
Merged

Fixed dirCycle pmap and is_well_defined #13

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 17 additions & 4 deletions DGAlgorithms/Models/PortNumbering.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -274,16 +274,29 @@ end Examples

def dirCycle (n : ℕ) : PNNetwork (Fin (n+2)) where
deg := fun _ ↦ 2
pmap := fun p ↦ (ite (p.port == 0) (p.node+1) (p.node-1), ite (p.port == 0) 1 0)
pmap := fun p ↦ match p.2 with
| 0 => (p.node-1,1)
| 1 => (p.node+1,0)
| _ => p
pmap_involutive := by
intro v i hi
have hi : i = 0 ∨ i = 1 := by grind
cases' hi with hi hi
all_goals grind
is_well_defined := by
intro vp

sorry
intro vp hfun
let (node,port) := vp
simp [Port.port]
simp [Port.port, Port.node] at hfun
cases port with
| zero => linarith
| succ k => cases k with
| zero => linarith
| succ w =>
have h0 : (w+1+1≠0) := by linarith
have h1 : (w+1+1≠1) := by linarith
simp at hfun
contradiction

-- def fooboar (A : Type*) : PNAlgorithm A A where
-- Msg := Unit
Expand Down