OAI/Algebra/GroupRing/MapRestrict.lean
52 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.TorsionFreeZeroDivisors.MapRestrict.componentIncludeline 20 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.componentInclude_componentline 24 - def
OAI.TorsionFreeZeroDivisors.MapRestrict.componentRawline 27 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.componentRaw_rotationline 30 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.componentRaw_partnerline 37 - def
OAI.TorsionFreeZeroDivisors.MapRestrict.componentEquivline 44 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.component_cardline 65 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.mul_invariantline 70 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.perm_mulline 72 - theorem
OAI.TorsionFreeZeroDivisors.MapRestrict.genusZeroline 77Source documentation
Restriction to any invariant union of map components preserves actual Euler genus zero. The proof uses decomposition and the universal Euler upper bound on BOTH complementary pieces.
theorem genusZero (hi : Function.Involutive α) (hz : GenusZero σ α) : GenusZero σP αP := by …
- lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.cycleInclude_injectiveline 97 - def
OAI.TorsionFreeZeroDivisors.MapRestrict.internalPairline 100 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.internalPair_involutiveline 102 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.rotation_invariantline 105 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.pairing_invariantline 107 - def
OAI.TorsionFreeZeroDivisors.MapRestrict.rotationline 113 - def
OAI.TorsionFreeZeroDivisors.MapRestrict.pairingline 114 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.pairing_involutiveline 116 - def
OAI.TorsionFreeZeroDivisors.MapRestrict.vertexEquivline 119 - lemma
OAI.TorsionFreeZeroDivisors.MapRestrict.vertexEquiv_cycleline 129 - def
OAI.TorsionFreeZeroDivisors.MapRestrict.graphIsoline 133Source documentation
The restricted dart system realizes precisely the induced simple graph.
def graphIso : graph (rotation σ S) (pairing σ α hi S) (pairing_involutive σ α hi S) ≃g (graph σ α hi).induce S where …Mentions: OAI.TorsionFreeZeroDivisors.MapRestrict.rotation, OAI.TorsionFreeZeroDivisors.MapRestrict.pairing, OAI.TorsionFreeZeroDivisors.MapRestrict.pairing_involutive
- theorem
OAI.TorsionFreeZeroDivisors.MapRestrict.induced_genusZeroline 167 - def
OAI.TorsionFreeZeroDivisors.MapContract.treePairline 187 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.treePair_insideline 191 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.treePair_outsideline 192 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.treePair_invariantline 193 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.treePair_involutiveline 194 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.treePair_subpairingline 202 - def
OAI.TorsionFreeZeroDivisors.MapContract.rotationline 215 - def
OAI.TorsionFreeZeroDivisors.MapContract.pairingline 216 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.pairing_involutiveline 219 - theorem
OAI.TorsionFreeZeroDivisors.MapContract.genusZeroline 222 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.rotation_invariantline 230 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.rotation_insideline 233 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.inside_cycle_eqline 239 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.quotient_invariantline 247 - def
OAI.TorsionFreeZeroDivisors.MapContract.quotientline 253 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.quotient_cycleline 256 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.quotient_surjectiveline 257 - def
OAI.TorsionFreeZeroDivisors.MapContract.labelRawline 262 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.labelRaw_invariantline 263 - def
OAI.TorsionFreeZeroDivisors.MapContract.labelline 268 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.label_quotientline 270 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.quotient_eq_iffline 274 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.cycle_treePairline 291 - lemma
OAI.TorsionFreeZeroDivisors.MapContract.quotient_adjline 297Source documentation
Every original edge either contracts to a vertex or is an actual edge.
lemma quotient_adj {v w : Cycle σ} (he : (graph σ α hi).Adj v w) : q v=q w ∨ (graph ρ γ (pairing_involutive σ α hi B T hT)).Adj (q v) (q w) := by …Mentions: OAI.TorsionFreeZeroDivisors.MapContract.pairing_involutive
- lemma
OAI.TorsionFreeZeroDivisors.MapContract.adj_liftline 307Source documentation
No new nonloop adjacency is introduced by the literal contraction.
lemma adj_lift {v w : Cycle ρ} (he : (graph ρ γ (pairing_involutive σ α hi B T hT)).Adj v w) : ∃ x y,(graph σ α hi).Adj x y ∧ q x=v ∧ q y=w := by …Mentions: OAI.TorsionFreeZeroDivisors.MapContract.pairing_involutive
- def
OAI.TorsionFreeZeroDivisors.GraphBall.verticesline 327 - def
OAI.TorsionFreeZeroDivisors.GraphBall.rootVertexline 328 - lemma
OAI.TorsionFreeZeroDivisors.GraphBall.exists_walkline 331 - lemma
OAI.TorsionFreeZeroDivisors.GraphBall.connectedline 348 - lemma
OAI.TorsionFreeZeroDivisors.GraphBall.dist_rootline 354