patrick/agdaproofs
1
0
Fork 0
mirror of https://github.com/Smaug123/agdaproofs synced 2025-10-16 17:08:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

Problem 1 of Project Euler (#85)

Browse Source
This commit is contained in:
Patrick Stevens
2019-12-04 19:53:34 +00:00
committed by GitHub
parent 2ed7bd8044
commit cfd9787bb8
10 changed files with 526 additions and 447 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Groups/FreeGroups.agda
View File

@@ -11,7 +11,7 @@ open import Numbers.Naturals.WithK
open import Sets.FinSet
open import Groups.Definition
open import Groups.SymmetricGroups.Definition
open import DecidableSet
open import Decidable.Sets
module Groups.FreeGroups where
@@ -107,7 +107,7 @@ badPrepend' {decA = decA} {x} (wordEnding pr x₁) | inr pr2 = pr2 refl
freeGroupGenerators : {a : _} (A : Set a) (decA : DecidableSet A) (w : FreeGroupGenerators A) → SymmetryGroupElements (reflSetoid (ReducedWord decA))
freeGroupGenerators A decA (χ x) = sym {f = f} bij
where
open DecidableSet.DecidableSet decA
open DecidableSet decA
f : ReducedWord decA → ReducedWord decA
f empty = prependLetter (ofLetter x) empty (wordEmpty refl)
f (prependLetter (ofLetter startLetter) w pr) = prependLetter (ofLetter x) (prependLetter (ofLetter startLetter) w pr) (wordEnding (succIsPositive _) ans)