Mercurial > hg > Members > kono > Proof > galois
view Putil.agda @ 88:405c1f727ffe
...
| author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Fri, 28 Aug 2020 11:05:45 +0900 |
| parents | c68956f6c3ad |
| children | dcb4450680ab |
line wrap: on
line source
module Putil where open import Level hiding ( suc ; zero ) open import Algebra open import Algebra.Structures open import Data.Fin hiding ( _<_ ; _≤_ ; _-_ ; _+_ ) open import Data.Fin.Properties hiding ( <-trans ; ≤-trans ) renaming ( <-cmp to <-fcmp ) open import Data.Fin.Permutation open import Function hiding (id ; flip) open import Function.Inverse as Inverse using (_↔_; Inverse; _InverseOf_) open import Function.LeftInverse using ( _LeftInverseOf_ ) open import Function.Equality using (Π) open import Data.Nat -- using (ℕ; suc; zero; s≤s ; z≤n ) open import Data.Nat.Properties -- using (<-trans) open import Relation.Binary.PropositionalEquality open import Data.List using (List; []; _∷_ ; length ; _++_ ; head ; tail ) renaming (reverse to rev ) open import nat open import Symmetric open import Relation.Nullary open import Data.Empty open import Relation.Binary.Core open import Relation.Binary.Definitions open import fin -- An inductive construction of permutation -- Todo -- -- describe property of pins ( move 0 to any position) -- describe property of shrink ( remove one column ) -- prove FL→iso -- prove FL←iso -- we already have refl and trans in the Symmetric Group pprep : {n : ℕ } → Permutation n n → Permutation (suc n) (suc n) pprep {n} perm = permutation p→ p← record { left-inverse-of = piso→ ; right-inverse-of = piso← } where p→ : Fin (suc n) → Fin (suc n) p→ zero = zero p→ (suc x) = suc ( perm ⟨$⟩ʳ x) p← : Fin (suc n) → Fin (suc n) p← zero = zero p← (suc x) = suc ( perm ⟨$⟩ˡ x) piso← : (x : Fin (suc n)) → p→ ( p← x ) ≡ x piso← zero = refl piso← (suc x) = cong (λ k → suc k ) (inverseʳ perm) piso→ : (x : Fin (suc n)) → p← ( p→ x ) ≡ x piso→ zero = refl piso→ (suc x) = cong (λ k → suc k ) (inverseˡ perm) pswap : {n : ℕ } → Permutation n n → Permutation (suc (suc n)) (suc (suc n )) pswap {n} perm = permutation p→ p← record { left-inverse-of = piso→ ; right-inverse-of = piso← } where p→ : Fin (suc (suc n)) → Fin (suc (suc n)) p→ zero = suc zero p→ (suc zero) = zero p→ (suc (suc x)) = suc ( suc ( perm ⟨$⟩ʳ x) ) p← : Fin (suc (suc n)) → Fin (suc (suc n)) p← zero = suc zero p← (suc zero) = zero p← (suc (suc x)) = suc ( suc ( perm ⟨$⟩ˡ x) ) piso← : (x : Fin (suc (suc n)) ) → p→ ( p← x ) ≡ x piso← zero = refl piso← (suc zero) = refl piso← (suc (suc x)) = cong (λ k → suc (suc k) ) (inverseʳ perm) piso→ : (x : Fin (suc (suc n)) ) → p← ( p→ x ) ≡ x piso→ zero = refl piso→ (suc zero) = refl piso→ (suc (suc x)) = cong (λ k → suc (suc k) ) (inverseˡ perm) -- enumeration psawpn : {n : ℕ} → 1 < n → Permutation n n psawpn {suc zero} (s≤s ()) psawpn {suc n} (s≤s (s≤s x)) = pswap pid pfill : { n m : ℕ } → m ≤ n → Permutation m m → Permutation n n pfill {n} {m} m≤n perm = pfill1 (n - m) (n-m<n n m ) (subst (λ k → Permutation k k ) (n-n-m=m m≤n ) perm) where pfill1 : (i : ℕ ) → i ≤ n → Permutation (n - i) (n - i) → Permutation n n pfill1 0 _ perm = perm pfill1 (suc i) i<n perm = pfill1 i (≤to< i<n) (subst (λ k → Permutation k k ) (si-sn=i-n i<n ) ( pprep perm ) ) -- -- psawpim (inseert swap at position m ) -- psawpim : {n m : ℕ} → suc (suc m) ≤ n → Permutation n n psawpim {n} {m} m≤n = pfill m≤n ( psawpn (s≤s (s≤s z≤n)) ) n≤ : (i : ℕ ) → {j : ℕ } → i ≤ i + j n≤ (zero) {j} = z≤n n≤ (suc i) {j} = s≤s ( n≤ i ) lem0 : {n : ℕ } → n ≤ n lem0 {zero} = z≤n lem0 {suc n} = s≤s lem0 lem00 : {n m : ℕ } → n ≡ m → n ≤ m lem00 refl = lem0 -- pconcat : {n m : ℕ } → Permutation m m → Permutation n n → Permutation (m + n) (m + n) -- pconcat {n} {m} p q = pfill {n + m} {m} ? p ∘ₚ ? -- inductivley enmumerate permutations -- from n-1 length create n length inserting new element at position m -- 0 ∷ 1 ∷ 2 ∷ 3 ∷ [] -- 1 ∷ 0 ∷ 2 ∷ 3 ∷ [] plist ( pins {3} (n≤ 1) ) -- 1 ∷ 2 ∷ 0 ∷ 3 ∷ [] -- 1 ∷ 2 ∷ 3 ∷ 0 ∷ [] pins : {n m : ℕ} → m ≤ n → Permutation (suc n) (suc n) pins {_} {zero} _ = pid pins {suc _} {suc zero} _ = pswap pid pins {suc (suc n)} {suc m} (s≤s m<n) = pins1 (suc (suc n)) lem0 where pins1 : (j : ℕ ) → j ≤ suc (suc n) → Permutation (suc (suc (suc n ))) (suc (suc (suc n))) pins1 zero _ = pid pins1 (suc j) (s≤s si≤n) = psawpim {suc (suc (suc n))} {j} (s≤s (s≤s si≤n)) ∘ₚ pins1 j (≤-trans si≤n refl-≤s ) plist1 : {n : ℕ} → Permutation (suc n) (suc n) → (i : ℕ ) → i < suc n → List ℕ plist1 {n} perm zero _ = toℕ ( perm ⟨$⟩ˡ (fromℕ< {zero} (s≤s z≤n))) ∷ [] plist1 {n} perm (suc i) (s≤s lt) = toℕ ( perm ⟨$⟩ˡ (fromℕ< (s≤s lt))) ∷ plist1 perm i (<-trans lt a<sa) plist : {n : ℕ} → Permutation n n → List ℕ plist {0} perm = [] plist {suc n} perm = rev (plist1 perm n a<sa) plist2 : {n : ℕ} → Permutation (suc n) (suc n) → (i : ℕ ) → i < suc n → List ℕ plist2 {n} perm zero _ = toℕ ( perm ⟨$⟩ʳ (fromℕ< {zero} (s≤s z≤n))) ∷ [] plist2 {n} perm (suc i) (s≤s lt) = toℕ ( perm ⟨$⟩ʳ (fromℕ< (s≤s lt))) ∷ plist2 perm i (<-trans lt a<sa) plist0 : {n : ℕ} → Permutation n n → List ℕ plist0 {0} perm = [] plist0 {suc n} perm = plist2 perm n a<sa open _=p=_ -- -- plist cong -- ←pleq : {n : ℕ} → (x y : Permutation n n ) → x =p= y → plist0 x ≡ plist0 y ←pleq {zero} x y eq = refl ←pleq {suc n} x y eq = ←pleq1 n a<sa where ←pleq1 : (i : ℕ ) → (i<sn : i < suc n ) → plist2 x i i<sn ≡ plist2 y i i<sn ←pleq1 zero _ = cong ( λ k → toℕ k ∷ [] ) ( peq eq (fromℕ< {zero} (s≤s z≤n))) ←pleq1 (suc i) (s≤s lt) = cong₂ ( λ j k → toℕ j ∷ k ) ( peq eq (fromℕ< (s≤s lt))) ( ←pleq1 i (<-trans lt a<sa) ) headeq : {A : Set } → {x y : A } → {xt yt : List A } → (x ∷ xt) ≡ (y ∷ yt) → x ≡ y headeq refl = refl taileq : {A : Set } → {x y : A } → {xt yt : List A } → (x ∷ xt) ≡ (y ∷ yt) → xt ≡ yt taileq refl = refl -- -- plist equalizer -- pleq : {n : ℕ} → (x y : Permutation n n ) → plist0 x ≡ plist0 y → x =p= y pleq {0} x y refl = record { peq = λ q → pleq0 q } where pleq0 : (q : Fin 0 ) → (x ⟨$⟩ʳ q) ≡ (y ⟨$⟩ʳ q) pleq0 () pleq {suc n} x y eq = record { peq = λ q → pleq1 n a<sa eq q fin<n } where pleq1 : (i : ℕ ) → (i<sn : i < suc n ) → plist2 x i i<sn ≡ plist2 y i i<sn → (q : Fin (suc n)) → toℕ q < suc i → x ⟨$⟩ʳ q ≡ y ⟨$⟩ʳ q pleq1 zero i<sn eq q q<i with <-cmp (toℕ q) zero ... | tri< () ¬b ¬c ... | tri> ¬a ¬b c = ⊥-elim (nat-≤> c q<i ) ... | tri≈ ¬a b ¬c = begin x ⟨$⟩ʳ q ≡⟨ cong ( λ k → x ⟨$⟩ʳ k ) (toℕ-injective b )⟩ x ⟨$⟩ʳ zero ≡⟨ toℕ-injective (headeq eq) ⟩ y ⟨$⟩ʳ zero ≡⟨ cong ( λ k → y ⟨$⟩ʳ k ) (sym (toℕ-injective b )) ⟩ y ⟨$⟩ʳ q ∎ where open ≡-Reasoning pleq1 (suc i) (s≤s i<sn) eq q q<i with <-cmp (toℕ q) (suc i) ... | tri< a ¬b ¬c = pleq1 i (<-trans i<sn a<sa ) (taileq eq) q a ... | tri> ¬a ¬b c = ⊥-elim (nat-≤> c q<i ) ... | tri≈ ¬a b ¬c = begin x ⟨$⟩ʳ q ≡⟨ cong (λ k → x ⟨$⟩ʳ k) (pleq3 b) ⟩ x ⟨$⟩ʳ (suc (fromℕ< i<sn)) ≡⟨ toℕ-injective pleq2 ⟩ y ⟨$⟩ʳ (suc (fromℕ< i<sn)) ≡⟨ cong (λ k → y ⟨$⟩ʳ k) (sym (pleq3 b)) ⟩ y ⟨$⟩ʳ q ∎ where open ≡-Reasoning pleq3 : toℕ q ≡ suc i → q ≡ suc (fromℕ< i<sn) pleq3 tq=si = toℕ-injective ( begin toℕ q ≡⟨ b ⟩ suc i ≡⟨ sym (toℕ-fromℕ< (s≤s i<sn)) ⟩ toℕ (fromℕ< (s≤s i<sn)) ≡⟨⟩ toℕ (suc (fromℕ< i<sn)) ∎ ) where open ≡-Reasoning pleq2 : toℕ ( x ⟨$⟩ʳ (suc (fromℕ< i<sn)) ) ≡ toℕ ( y ⟨$⟩ʳ (suc (fromℕ< i<sn)) ) pleq2 = headeq eq pprep-cong : {n : ℕ} → {x y : Permutation n n } → x =p= y → pprep x =p= pprep y pprep-cong {n} {x} {y} x=y = record { peq = pprep-cong1 } where pprep-cong1 : (q : Fin (suc n)) → (pprep x ⟨$⟩ʳ q) ≡ (pprep y ⟨$⟩ʳ q) pprep-cong1 zero = refl pprep-cong1 (suc q) = begin pprep x ⟨$⟩ʳ suc q ≡⟨⟩ suc ( x ⟨$⟩ʳ q ) ≡⟨ cong ( λ k → suc k ) ( peq x=y q ) ⟩ suc ( y ⟨$⟩ʳ q ) ≡⟨⟩ pprep y ⟨$⟩ʳ suc q ∎ where open ≡-Reasoning pprep-dist : {n : ℕ} → {x y : Permutation n n } → pprep (x ∘ₚ y) =p= (pprep x ∘ₚ pprep y) pprep-dist {n} {x} {y} = record { peq = pprep-dist1 } where pprep-dist1 : (q : Fin (suc n)) → (pprep (x ∘ₚ y) ⟨$⟩ʳ q) ≡ ((pprep x ∘ₚ pprep y) ⟨$⟩ʳ q) pprep-dist1 zero = refl pprep-dist1 (suc q) = cong ( λ k → suc k ) refl pswap-cong : {n : ℕ} → {x y : Permutation n n } → x =p= y → pswap x =p= pswap y pswap-cong {n} {x} {y} x=y = record { peq = pswap-cong1 } where pswap-cong1 : (q : Fin (suc (suc n))) → (pswap x ⟨$⟩ʳ q) ≡ (pswap y ⟨$⟩ʳ q) pswap-cong1 zero = refl pswap-cong1 (suc zero) = refl pswap-cong1 (suc (suc q)) = begin pswap x ⟨$⟩ʳ suc (suc q) ≡⟨⟩ suc (suc (x ⟨$⟩ʳ q)) ≡⟨ cong ( λ k → suc (suc k) ) ( peq x=y q ) ⟩ suc (suc (y ⟨$⟩ʳ q)) ≡⟨⟩ pswap y ⟨$⟩ʳ suc (suc q) ∎ where open ≡-Reasoning pswap-dist : {n : ℕ} → {x y : Permutation n n } → pprep (pprep (x ∘ₚ y)) =p= (pswap x ∘ₚ pswap y) pswap-dist {n} {x} {y} = record { peq = pswap-dist1 } where pswap-dist1 : (q : Fin (suc (suc n))) → ((pprep (pprep (x ∘ₚ y))) ⟨$⟩ʳ q) ≡ ((pswap x ∘ₚ pswap y) ⟨$⟩ʳ q) pswap-dist1 zero = refl pswap-dist1 (suc zero) = refl pswap-dist1 (suc (suc q)) = cong ( λ k → suc (suc k) ) refl data FL : (n : ℕ )→ Set where f0 : FL 0 _::_ : { n : ℕ } → Fin (suc n ) → FL n → FL (suc n) open import logic shlem→ : {n : ℕ} → (perm : Permutation (suc n) (suc n) ) → (p0=0 : perm ⟨$⟩ˡ (# 0) ≡ # 0 ) → (x : Fin (suc n) ) → perm ⟨$⟩ˡ x ≡ zero → x ≡ zero shlem→ perm p0=0 x px=0 = begin x ≡⟨ sym ( inverseʳ perm ) ⟩ perm ⟨$⟩ʳ ( perm ⟨$⟩ˡ x) ≡⟨ cong (λ k → perm ⟨$⟩ʳ k ) px=0 ⟩ perm ⟨$⟩ʳ zero ≡⟨ cong (λ k → perm ⟨$⟩ʳ k ) (sym p0=0) ⟩ perm ⟨$⟩ʳ ( perm ⟨$⟩ˡ zero) ≡⟨ inverseʳ perm ⟩ zero ∎ where open ≡-Reasoning shlem← : {n : ℕ} → (perm : Permutation (suc n) (suc n) ) → (p0=0 : perm ⟨$⟩ˡ (# 0) ≡ # 0 ) → (x : Fin (suc n)) → perm ⟨$⟩ʳ x ≡ zero → x ≡ zero shlem← perm p0=0 x px=0 = begin x ≡⟨ sym (inverseˡ perm ) ⟩ perm ⟨$⟩ˡ ( perm ⟨$⟩ʳ x ) ≡⟨ cong (λ k → perm ⟨$⟩ˡ k ) px=0 ⟩ perm ⟨$⟩ˡ zero ≡⟨ p0=0 ⟩ zero ∎ where open ≡-Reasoning sh2 : {n : ℕ} → (perm : Permutation (suc n) (suc n) ) → (p0=0 : perm ⟨$⟩ˡ (# 0) ≡ # 0 ) → {x : Fin n} → ¬ perm ⟨$⟩ˡ (suc x) ≡ zero sh2 perm p0=0 {x} eq with shlem→ perm p0=0 (suc x) eq sh2 perm p0=0 {x} eq | () sh1 : {n : ℕ} → (perm : Permutation (suc n) (suc n) ) → (p0=0 : perm ⟨$⟩ˡ (# 0) ≡ # 0 ) → {x : Fin n} → ¬ perm ⟨$⟩ʳ (suc x) ≡ zero sh1 perm p0=0 {x} eq with shlem← perm p0=0 (suc x) eq sh1 perm p0=0 {x} eq | () -- 0 ∷ 1 ∷ 2 ∷ 3 ∷ [] → 0 ∷ 1 ∷ 2 ∷ [] shrink : {n : ℕ} → (perm : Permutation (suc n) (suc n) ) → perm ⟨$⟩ˡ (# 0) ≡ # 0 → Permutation n n shrink {n} perm p0=0 = permutation p→ p← record { left-inverse-of = piso→ ; right-inverse-of = piso← } where p→ : Fin n → Fin n p→ x with perm ⟨$⟩ʳ (suc x) | inspect (_⟨$⟩ʳ_ perm ) (suc x) p→ x | zero | record { eq = e } = ⊥-elim ( sh1 perm p0=0 {x} e ) p→ x | suc t | _ = t p← : Fin n → Fin n p← x with perm ⟨$⟩ˡ (suc x) | inspect (_⟨$⟩ˡ_ perm ) (suc x) p← x | zero | record { eq = e } = ⊥-elim ( sh2 perm p0=0 {x} e ) p← x | suc t | _ = t piso← : (x : Fin n ) → p→ ( p← x ) ≡ x piso← x with perm ⟨$⟩ˡ (suc x) | inspect (_⟨$⟩ˡ_ perm ) (suc x) piso← x | zero | record { eq = e } = ⊥-elim ( sh2 perm p0=0 {x} e ) piso← x | suc t | _ with perm ⟨$⟩ʳ (suc t) | inspect (_⟨$⟩ʳ_ perm ) (suc t) piso← x | suc t | _ | zero | record { eq = e } = ⊥-elim ( sh1 perm p0=0 e ) piso← x | suc t | record { eq = e0 } | suc t1 | record { eq = e1 } = begin t1 ≡⟨ plem0 plem1 ⟩ x ∎ where open ≡-Reasoning plem0 : suc t1 ≡ suc x → t1 ≡ x plem0 refl = refl plem1 : suc t1 ≡ suc x plem1 = begin suc t1 ≡⟨ sym e1 ⟩ Inverse.to perm Π.⟨$⟩ suc t ≡⟨ cong (λ k → Inverse.to perm Π.⟨$⟩ k ) (sym e0) ⟩ Inverse.to perm Π.⟨$⟩ ( Inverse.from perm Π.⟨$⟩ suc x ) ≡⟨ inverseʳ perm ⟩ suc x ∎ piso→ : (x : Fin n ) → p← ( p→ x ) ≡ x piso→ x with perm ⟨$⟩ʳ (suc x) | inspect (_⟨$⟩ʳ_ perm ) (suc x) piso→ x | zero | record { eq = e } = ⊥-elim ( sh1 perm p0=0 {x} e ) piso→ x | suc t | _ with perm ⟨$⟩ˡ (suc t) | inspect (_⟨$⟩ˡ_ perm ) (suc t) piso→ x | suc t | _ | zero | record { eq = e } = ⊥-elim ( sh2 perm p0=0 e ) piso→ x | suc t | record { eq = e0 } | suc t1 | record { eq = e1 } = begin t1 ≡⟨ plem2 plem3 ⟩ x ∎ where open ≡-Reasoning plem2 : suc t1 ≡ suc x → t1 ≡ x plem2 refl = refl plem3 : suc t1 ≡ suc x plem3 = begin suc t1 ≡⟨ sym e1 ⟩ Inverse.from perm Π.⟨$⟩ suc t ≡⟨ cong (λ k → Inverse.from perm Π.⟨$⟩ k ) (sym e0 ) ⟩ Inverse.from perm Π.⟨$⟩ ( Inverse.to perm Π.⟨$⟩ suc x ) ≡⟨ inverseˡ perm ⟩ suc x ∎ shrink-iso : { n : ℕ } → {perm : Permutation n n} → shrink (pprep perm) refl =p= perm shrink-iso {n} {perm} = record { peq = λ q → refl } p01 : (perm : Permutation 1 1) → perm =p= pid p01 perm = record { peq = p01e } where p01e : (q : Fin 1) → (perm ⟨$⟩ʳ q) ≡ (pid ⟨$⟩ʳ q) p01e zero with perm ⟨$⟩ʳ zero ... | zero = refl p=0 : {n : ℕ } → (perm : Permutation (suc n) (suc n) ) → ((perm ∘ₚ flip (pins (toℕ≤pred[n] (perm ⟨$⟩ʳ (# 0))))) ⟨$⟩ˡ (# 0)) ≡ # 0 p=0 {zero} perm with p01 perm | p01 ( flip (pins (toℕ≤pred[n] (perm ⟨$⟩ʳ (# 0)) ))) ... | s | t = begin ((perm ∘ₚ flip (pins (toℕ≤pred[n] (perm ⟨$⟩ʳ (# 0))))) ⟨$⟩ˡ (# 0)) ≡⟨ peqˡ (presp (p01 perm) (p01 (flip (pins (toℕ≤pred[n] (perm ⟨$⟩ʳ (# 0)) ))))) (# 0) ⟩ (pid ∘ₚ pid ) ⟨$⟩ʳ (# 0) ≡⟨⟩ # 0 ∎ where open ≡-Reasoning p=0 {suc (zero)} perm with perm ⟨$⟩ʳ (# 0) | inspect ( _⟨$⟩ʳ_ perm ) (# 0) ... | zero | record { eq = e } = begin (perm ∘ₚ pid) ⟨$⟩ˡ (# 0) ≡⟨⟩ perm ⟨$⟩ˡ (# 0) ≡⟨ cong (λ k → perm ⟨$⟩ˡ k ) (sym e ) ⟩ perm ⟨$⟩ˡ (perm ⟨$⟩ʳ (# 0)) ≡⟨ inverseˡ perm ⟩ # 0 ∎ where open ≡-Reasoning ... | suc zero | record { eq = e } = begin (perm ∘ₚ pswap pid) ⟨$⟩ˡ (# 0) ≡⟨⟩ perm ⟨$⟩ˡ (# 1) ≡⟨ cong (λ k → perm ⟨$⟩ˡ k ) (sym e ) ⟩ perm ⟨$⟩ˡ (perm ⟨$⟩ʳ (# 0)) ≡⟨ inverseˡ perm ⟩ # 0 ∎ where open ≡-Reasoning p=0 {suc (suc n) } perm = p=01 (suc (suc n)) lem0 where p=01 : (j : ℕ ) → j ≤ suc (suc n) → ((perm ∘ₚ flip (pins (toℕ≤pred[n] (perm ⟨$⟩ʳ (# 0))))) ⟨$⟩ˡ (# 0)) ≡ # 0 p=01 zero _ = {!!} p=01 (suc j) (s≤s si≤n) = {!!} FL→perm : {n : ℕ } → FL n → Permutation n n FL→perm f0 = pid FL→perm (x :: fl) = pprep (FL→perm fl) ∘ₚ pins ( toℕ≤pred[n] x ) t40 = (# 2) :: ( (# 1) :: (( # 0 ) :: f0 )) t4 = FL→perm ((# 2) :: t40 ) -- t1 = plist (shrink (pid {3} ∘ₚ (pins (n≤ 1))) refl) t2 = plist ((pid {5} ) ∘ₚ transpose (# 2) (# 4)) ∷ plist (pid {5} ∘ₚ reverse ) ∷ [] t3 = plist (FL→perm t40) -- ∷ plist (pprep (FL→perm t40)) -- ∷ plist ( pprep (FL→perm t40) ∘ₚ pins ( n≤ 0 {3} )) -- ∷ plist ( pprep (FL→perm t40 )∘ₚ pins ( n≤ 1 {2} )) -- ∷ plist ( pprep (FL→perm t40 )∘ₚ pins ( n≤ 2 {1} )) -- ∷ plist ( pprep (FL→perm t40 )∘ₚ pins ( n≤ 3 {0} )) ∷ plist ( FL→perm ((# 0) :: t40)) -- (0 ∷ 1 ∷ 2 ∷ []) ∷ ∷ plist ( FL→perm ((# 1) :: t40)) -- (0 ∷ 2 ∷ 1 ∷ []) ∷ ∷ plist ( FL→perm ((# 2) :: t40)) -- (1 ∷ 0 ∷ 2 ∷ []) ∷ ∷ plist ( FL→perm ((# 3) :: t40)) -- (2 ∷ 0 ∷ 1 ∷ []) ∷ -- ∷ plist ( FL→perm ((# 3) :: ((# 2) :: ( (# 0) :: (( # 0 ) :: f0 )) ))) -- (1 ∷ 2 ∷ 0 ∷ []) ∷ -- ∷ plist ( FL→perm ((# 3) :: ((# 2) :: ( (# 1) :: (( # 0 ) :: f0 )) ))) -- (2 ∷ 1 ∷ 0 ∷ []) ∷ -- ∷ plist ( (flip (FL→perm ((# 3) :: ((# 1) :: ( (# 0) :: (( # 0 ) :: f0 )) ))))) -- ∷ plist ( (flip (FL→perm ((# 3) :: ((# 1) :: ( (# 0) :: (( # 0 ) :: f0 )) ))) ∘ₚ (FL→perm ((# 3) :: (((# 1) :: ( (# 0) :: (( # 0 ) :: f0 )) )))) )) ∷ [] perm→FL : {n : ℕ } → Permutation n n → FL n perm→FL {zero} perm = f0 -- perm→FL {suc n} perm = (perm ⟨$⟩ʳ (# 0)) :: perm→FL (remove (# 0) perm) perm→FL {suc n} perm = (perm ⟨$⟩ʳ (# 0)) :: perm→FL (shrink (perm ∘ₚ flip (pins (toℕ≤pred[n] (perm ⟨$⟩ʳ (# 0))))) (p=0 perm) ) -- t5 = plist t4 ∷ plist ( t4 ∘ₚ flip (pins ( n≤ 3 ) )) t5 = plist (t4) ∷ plist (flip t4) ∷ ( toℕ (t4 ⟨$⟩ˡ fromℕ< a<sa) ∷ [] ) ∷ ( toℕ (t4 ⟨$⟩ʳ (# 0)) ∷ [] ) -- ∷ plist ( t4 ∘ₚ flip (pins ( n≤ 1 ) )) ∷ plist (remove (# 0) t4 ) ∷ plist ( FL→perm t40 ) ∷ [] t6 = perm→FL t4 postulate FL→iso : {n : ℕ } → (fl : FL n ) → perm→FL ( FL→perm fl ) ≡ fl -- FL→iso f0 = refl -- FL→iso (x :: fl) = {!!} -- with FL→iso fl -- ... | t = {!!} open _=p=_ postulate FL←iso : {n : ℕ } → (perm : Permutation n n ) → FL→perm ( perm→FL perm ) =p= perm -- FL←iso {0} perm = record { peq = λ () } -- FL←iso {suc n} perm = {!!} lem2 : {i n : ℕ } → i ≤ n → i ≤ suc n lem2 i≤n = ≤-trans i≤n ( refl-≤s ) ∀-FL : (n : ℕ ) → List (FL (suc n)) ∀-FL x = fls6 x where fls4 : ( i n : ℕ ) → (i<n : i ≤ n ) → FL n → List (FL (suc n)) → List (FL (suc n)) fls4 zero n i≤n perm x = (zero :: perm ) ∷ x fls4 (suc i) n i≤n perm x = fls4 i n (≤-trans refl-≤s i≤n ) perm ((fromℕ< (s≤s i≤n) :: perm ) ∷ x) fls5 : ( n : ℕ ) → List (FL n) → List (FL (suc n)) → List (FL (suc n)) fls5 n [] x = x fls5 n (h ∷ x) y = fls5 n x (fls4 n n lem0 h y) fls6 : ( n : ℕ ) → List (FL (suc n)) fls6 zero = (zero :: f0) ∷ [] fls6 (suc n) = fls5 (suc n) (fls6 n) [] all-perm : (n : ℕ ) → List (Permutation (suc n) (suc n) ) all-perm n = pls6 n where lem1 : {i n : ℕ } → i ≤ n → i < suc n lem1 z≤n = s≤s z≤n lem1 (s≤s lt) = s≤s (lem1 lt) pls4 : ( i n : ℕ ) → (i<n : i ≤ n ) → Permutation n n → List (Permutation (suc n) (suc n)) → List (Permutation (suc n) (suc n)) pls4 zero n i≤n perm x = (pprep perm ∘ₚ pins i≤n ) ∷ x pls4 (suc i) n i≤n perm x = pls4 i n (≤-trans refl-≤s i≤n ) perm (pprep perm ∘ₚ pins {n} {suc i} i≤n ∷ x) pls5 : ( n : ℕ ) → List (Permutation n n) → List (Permutation (suc n) (suc n)) → List (Permutation (suc n) (suc n)) pls5 n [] x = x pls5 n (h ∷ x) y = pls5 n x (pls4 n n lem0 h y) pls6 : ( n : ℕ ) → List (Permutation (suc n) (suc n)) pls6 zero = pid ∷ [] pls6 (suc n) = pls5 (suc n) (rev (pls6 n) ) [] -- rev to put id first pls : (n : ℕ ) → List (List ℕ ) pls n = Data.List.map plist (all-perm n)