The shared right factor, free basis and lift used by the amalgam and normal-form models.
The common free basis used to describe Gordon's uncompressed free-product-with-amalgamation presentation.
- conjugateA {n : ℕ} : BasisIndex n
- conjugateAlpha {n : ℕ} : BasisIndex n
- old {n : ℕ} (i : Fin n) : BasisIndex n
- commutator {n : ℕ} : BasisIndex n
Instances For
Equations
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.conjugateA Undecidability.Gordon.BasisIndex.conjugateA = isTrue ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.conjugateA Undecidability.Gordon.BasisIndex.conjugateAlpha = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.conjugateA (Undecidability.Gordon.BasisIndex.old i) = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.conjugateA Undecidability.Gordon.BasisIndex.commutator = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.conjugateAlpha Undecidability.Gordon.BasisIndex.conjugateA = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.conjugateAlpha Undecidability.Gordon.BasisIndex.conjugateAlpha = isTrue ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.conjugateAlpha (Undecidability.Gordon.BasisIndex.old i) = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.conjugateAlpha Undecidability.Gordon.BasisIndex.commutator = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq (Undecidability.Gordon.BasisIndex.old i) Undecidability.Gordon.BasisIndex.conjugateA = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq (Undecidability.Gordon.BasisIndex.old i) Undecidability.Gordon.BasisIndex.conjugateAlpha = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq (Undecidability.Gordon.BasisIndex.old a) (Undecidability.Gordon.BasisIndex.old b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq (Undecidability.Gordon.BasisIndex.old i) Undecidability.Gordon.BasisIndex.commutator = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.commutator Undecidability.Gordon.BasisIndex.conjugateA = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.commutator Undecidability.Gordon.BasisIndex.conjugateAlpha = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.commutator (Undecidability.Gordon.BasisIndex.old i) = isFalse ⋯
- Undecidability.Gordon.instDecidableEqBasisIndex.decEq Undecidability.Gordon.BasisIndex.commutator Undecidability.Gordon.BasisIndex.commutator = isTrue ⋯
Instances For
@[instance_reducible]
@[reducible, inline]
The right free factor used to construct the amalgam.
Equations
Instances For
The free generator b of the right-hand factor.
Equations
Instances For
The free generator beta of the right-hand factor.
Equations
Instances For
Gordon's right-hand conjugate beta^(-r) * b * beta^r.
Equations
Instances For
The right-hand amalgamating elements in Gordon's construction.
Equations
- Undecidability.Gordon.rightBasis Undecidability.Gordon.BasisIndex.conjugateA = Undecidability.Gordon.rightB ^ 2
- Undecidability.Gordon.rightBasis Undecidability.Gordon.BasisIndex.conjugateAlpha = Undecidability.Gordon.rightB * Undecidability.Gordon.rightBeta * Undecidability.Gordon.rightB⁻¹
- Undecidability.Gordon.rightBasis (Undecidability.Gordon.BasisIndex.old i) = Undecidability.Gordon.rightU (↑i + 1)
- Undecidability.Gordon.rightBasis Undecidability.Gordon.BasisIndex.commutator = Undecidability.Gordon.rightU (n + 1)
Instances For
The homomorphism freely extending Gordon’s right-hand amalgamating basis.