OAI/Geometry/HyperbolicGroups/SubpairingCopies.lean
7 declarations, 0 contain sorry, 0 declared as axioms
- abbrev
OAI.HyperbolicObstruction.PictureSwitch.PictureMap.RetainedContactline 18 - def
OAI.HyperbolicObstruction.PictureSwitch.PictureMap.retainedContactEdgeline 20 - lemma
OAI.HyperbolicObstruction.PictureSwitch.PictureMap.retained_raw_edgeline 25 - lemma
OAI.HyperbolicObstruction.PictureSwitch.PictureMap.retained_contact_cardline 31 - lemma
OAI.HyperbolicObstruction.PictureSwitch.PictureMap.retained_contact_coversline 41 - lemma
OAI.HyperbolicObstruction.PictureSwitch.PictureMap.subpairing_edges_subset_retainedline 50 - theorem
OAI.HyperbolicObstruction.PictureSwitch.PictureMap.tree_retained_contacts_bijectiveline 69Source documentation
A one-boundary spanning subpairing has exactly one retained contact for each edge of its underlying tree. Euler and connectivity rule out BOTH loops and parallel copies, rather than silently forgetting them.
theorem tree_retained_contacts_bijective (hG : M.GenusZero) (hspan : SameCycle.setoid M.vertex ⊔ SameCycle.setoid q = ⊤) (hboundary : cycles (M.vertex*q) = 1) : Function.Injective (M.retainedContactEdge q) ∧ (M.subpairingGraph q (M.subpairing_sq q hq)).edgeFinset = Finset.univ.image (M.retainedContactEdge q) := by …