OAI/GroupTheory/BooneHigman/Diagrams.lean
53 declarations, 0 contain sorry, 0 declared as axioms
Represented diagrams and actual endpoint evaluation injectivity and equivalence.
- structure
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagramline 18Source documentation
A full finite decorated tree pair, including the entire leaf bijection.
structure Diagram (Γ:Type u) (X:Type v) where …
- def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.valueline 28 - def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.Realizesline 31 - def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.rootline 34 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value_rootline 36 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.realizes_rootline 39 - def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.inverseline 42 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value_inverseline 46 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.Realizes.inverseline 54 - def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.composeline 64Source documentation
Compose after identifying the two intermediate partitions.
def compose (A C:Diagram Γ X) (e:A.target.Leaves ≃ C.source.Leaves) : Diagram Γ X where …
Mentions: OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram
- lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value_composeline 71 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.Realizes.composeline 85 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value_one_of_realizes_oneline 94 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Tree.graft_brick_symmline 113 - abbrev
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.expansionFamilyline 119 - def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.expandline 123Source documentation
Expand the whole target and pull every fibre back through its true label.
def expand (A:Diagram Γ X) (F:A.target.Leaves → Tree X) : Diagram Γ X where …
Mentions: OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram, OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Tree
- lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.expand_labelline 130 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value_expandline 137 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.Realizes.expandline 149 - abbrev
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Tree.gridFillline 176 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Tree.gridFill_lengthline 178 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Tree.gridFill_equivline 189 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.refine_target_gridline 201 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.refine_source_gridline 208 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.productline 218Source documentation
The actual tree-pair value is closed under multiplication, synchronizing all intermediate bricks by a finite grid; no patching assumption is used.
lemma product (gl:Tree.GridLaw d q B) {A C:Diagram Γ X} {f g:Equiv.Perm (Cube X)} (ha:Realizes A f) (hc:Realizes C g) : ∃ D:Diagram Γ X,Realizes D (g*f) ∧ value d q B R D=value d q B R C*value d q B R A := by …Mentions: OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Tree.GridLaw, OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram, OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Cube, OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.Realizes, OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value
- def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.plainline 239Source documentation
Undecorated full tree wiring.
def plain (a b:Tree X) (e:a.Leaves ≃ b.Leaves) : Diagram Γ X := ⟨a,b,e,fun _=>1⟩ …
Mentions: OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Tree, OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram
- lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value_plainline 241 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.realizes_plainline 245 - def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.halfline 255Source documentation
Prefix-localize an entire diagram, including its bijection and labels.
def half (x:X) (A:Diagram Γ X) : Diagram Γ X where …
Mentions: OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram
- lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value_halfline 262 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.Realizes.halfline 273 - abbrev
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.rotationline 287 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value_rotationline 292 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.realizes_rotationline 295 - abbrev
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.exchangeline 298 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.value_exchangeline 301 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.realizes_exchangeline 303 - def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.representedline 331Source documentation
Elements with a genuine decorated-tree witness for both their algebraic value and their actual cube action form a subgroup.
def represented : Subgroup K where …
- lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Diagram.mem_representedline 349 - def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.seedRepresentedline 375 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.root_mem_seedRepresentedline 379 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.half_mem_seedRepresentedline 384 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.associator_mem_seedRepresentedline 394 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.flip_mem_seedRepresentedline 399 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.half_associator_mem_seedRepresentedline 404 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.half_flip_mem_seedRepresentedline 417 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.generator_mem_seedRepresentedline 430 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.all_seedRepresentedline 442Source documentation
The entire finite presentation seed, not just its selected finite subgenerators, is represented by genuine decorated diagrams.
lemma all_seedRepresented (g:Seed (Γ:=Γ) x) : g∈seedRepresented x s t y₀ hs ht hxy htwo := by …
Mentions: OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.Seed, OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.seedRepresented
- lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.endpointProject_surjectiveline 471 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.endpointEvaluation_projectline 473 - lemma
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.endpoint_diagramline 480Source documentation
Every element of the actual finite endpoint presentation has a finite coloured decorated tree-pair whose value and semantics agree with it.
lemma endpoint_diagram (z:EndpointQuotient (Γ:=Γ) x s t y₀) : …
Mentions: OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.EndpointQuotient
- theorem
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.endpointEvaluation_injectiveline 491Source documentation
Completeness of the explicit finite presentation via whole permutations and decorated common refinement; semantic injectivity follows from the construction.
theorem endpointEvaluation_injective [FaithfulSMul Γ X] : Function.Injective (endpointEvaluation x s t y₀ hxy) := by …Mentions: OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.endpointEvaluation
- def
OAI.FiniteAlgebraicEnvelopes.TwistedBrinThompson.Generators.endpointEquivalenceline 503