Loogle!
Result
Found 135 declarations mentioning SimpleGraph.Iso.
- SimpleGraph.Iso π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (G : SimpleGraph V) (G' : SimpleGraph W) : Type (max u_1 u_2) - SimpleGraph.Iso.refl π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {G : SimpleGraph V} : G βg G - SimpleGraph.Iso.completeGraph π Mathlib.Combinatorics.SimpleGraph.Maps
{Ξ± : Type u_5} {Ξ² : Type u_6} (f : Ξ± β Ξ²) : SimpleGraph.completeGraph Ξ± βg SimpleGraph.completeGraph Ξ² - SimpleGraph.induceUnivIso π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} (G : SimpleGraph V) : SimpleGraph.induce Set.univ G βg G - SimpleGraph.Iso.symm π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') : G' βg G - SimpleGraph.Iso.toEmbedding π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') : G βͺg G' - SimpleGraph.Iso.toHom π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') : G βg G' - SimpleGraph.completeBipartiteGraphCongr π Mathlib.Combinatorics.SimpleGraph.Maps
{Vβ : Type u_5} {Vβ : Type u_6} {Wβ : Type u_7} {Wβ : Type u_8} (hV : Vβ β Vβ) (hW : Wβ β Wβ) : completeBipartiteGraph Vβ Wβ βg completeBipartiteGraph Vβ Wβ - SimpleGraph.overFinIso π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} (G : SimpleGraph V) [Fintype V] {n : β} (hc : Fintype.card V = n) : G βg G.overFin hc - SimpleGraph.Iso.card_eq π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') [Fintype V] [Fintype W] : Fintype.card V = Fintype.card W - SimpleGraph.Iso.comp π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {G' : SimpleGraph W} {G'' : SimpleGraph X} (f' : G' βg G'') (f : G βg G') : G βg G'' - SimpleGraph.Iso.mapEdgeSet π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') : βG.edgeSet β βG'.edgeSet - SimpleGraph.Iso.comp_refl π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') : f.comp SimpleGraph.Iso.refl = f - SimpleGraph.Iso.refl_comp π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') : SimpleGraph.Iso.refl.comp f = f - SimpleGraph.Iso.comap π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (f : V β W) (G : SimpleGraph W) : SimpleGraph.comap (βf) G βg G - SimpleGraph.Iso.map π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (f : V β W) (G : SimpleGraph V) : G βg SimpleGraph.map (βf) G - SimpleGraph.Iso.homCongr π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {X : Type u_3} {Y : Type u_4} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') {G'' : SimpleGraph X} {G''' : SimpleGraph Y} (f' : G'' βg G''') : G βg G'' β G' βg G''' - SimpleGraph.Iso.induce_refl π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} (G : SimpleGraph V) (s : Set V) : SimpleGraph.Iso.refl.induce β― = SimpleGraph.Iso.refl - SimpleGraph.Iso.mapNeighborSet π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') (v : V) : β(G.neighborSet v) β β(G'.neighborSet (f v)) - SimpleGraph.Iso.symm_toHom_comp_toHom π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') : f.symm.toHom.comp f.toHom = SimpleGraph.Hom.id - SimpleGraph.Iso.toHom_comp_symm_toHom π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') : f.toHom.comp f.symm.toHom = SimpleGraph.Hom.id - SimpleGraph.Iso.induce π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} {s : Set V} {t : Set W} (Ο : G βg G') (Οst : Set.BijOn (βΟ) s t) : SimpleGraph.induce s G βg SimpleGraph.induce t G' - SimpleGraph.Iso.map_adj_iff π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') {v w : V} : G'.Adj (f v) (f w) β G.Adj v w - SimpleGraph.Iso.map_mem_edgeSet_iff π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') {e : Sym2 V} : Sym2.map (βf) e β G'.edgeSet β e β G.edgeSet - SimpleGraph.Embedding.isoInduceRange π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βͺg G') : G βg SimpleGraph.induce (Set.range βf) G' - SimpleGraph.Iso.image_neighborSet π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} {v : V} (f : G βg G') : βf '' G.neighborSet v = G'.neighborSet (f v) - SimpleGraph.Iso.comp_assoc π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {X : Type u_3} {Y : Type u_4} {G : SimpleGraph V} {G' : SimpleGraph W} {G'' : SimpleGraph X} {G''' : SimpleGraph Y} (f : G'' βg G''') (g : G' βg G'') (h : G βg G') : f.comp (g.comp h) = (f.comp g).comp h - SimpleGraph.Iso.apply_mem_neighborSet_iff π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') {v w : V} : f w β G'.neighborSet (f v) β w β G.neighborSet v - SimpleGraph.Iso.coe_comp π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {G' : SimpleGraph W} {G'' : SimpleGraph X} (f' : G' βg G'') (f : G βg G') : β(f'.comp f) = βf' β βf - SimpleGraph.Iso.comap_apply π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (f : V β W) (G : SimpleGraph W) (v : V) : (SimpleGraph.Iso.comap f G) v = f v - SimpleGraph.Iso.map_apply π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (f : V β W) (G : SimpleGraph V) (v : V) : (SimpleGraph.Iso.map f G) v = f v - SimpleGraph.Iso.comap_symm_apply π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (f : V β W) (G : SimpleGraph W) (w : W) : (SimpleGraph.Iso.comap f G).symm w = f.symm w - SimpleGraph.Iso.map_symm_apply π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} (f : V β W) (G : SimpleGraph V) (w : W) : (SimpleGraph.Iso.map f G).symm w = f.symm w - SimpleGraph.Iso.mapEdgeSet_apply π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') (e : βG.edgeSet) : f.mapEdgeSet e = SimpleGraph.Hom.mapEdgeSet (RelIso.toRelEmbedding f).toRelHom e - SimpleGraph.Iso.mapEdgeSet_symm_apply π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') (e : βG'.edgeSet) : f.mapEdgeSet.symm e = SimpleGraph.Hom.mapEdgeSet (RelIso.toRelEmbedding f.symm).toRelHom e - SimpleGraph.Iso.coe_induce π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} {s : Set V} {t : Set W} (Ο : G βg G') (Οst : Set.BijOn (βΟ) s t) : β(Ο.induce Οst) = Set.MapsTo.restrict (βΟ) s t β― - SimpleGraph.Iso.induce_comp_induce π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {G' : SimpleGraph W} {G'' : SimpleGraph X} {s : Set V} {t : Set W} {r : Set X} (Ο : G βg G') (Οst : Set.BijOn (βΟ) s t) (Ο : G' βg G'') (Οtr : Set.BijOn (βΟ) t r) : (Ο.induce Οtr).comp (Ο.induce Οst) = (Ο.comp Ο).induce β― - SimpleGraph.Iso.mapNeighborSet_apply_coe π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') (v : V) (w : β(G.neighborSet v)) : β((f.mapNeighborSet v) w) = f βw - SimpleGraph.Iso.mapNeighborSet_symm_apply_coe π Mathlib.Combinatorics.SimpleGraph.Maps
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} (f : G βg G') (v : V) (w : β(G'.neighborSet (f v))) : β((f.mapNeighborSet v).symm w) = f.symm βw - SimpleGraph.Iso.maxDegree_eq π Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {W : Type u_2} {G' : SimpleGraph W} [Fintype V] [DecidableRel G.Adj] [Fintype W] [DecidableRel G'.Adj] (f : G βg G') : G.maxDegree = G'.maxDegree - SimpleGraph.Iso.minDegree_eq π Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {W : Type u_2} {G' : SimpleGraph W} [Fintype V] [DecidableRel G.Adj] [Fintype W] [DecidableRel G'.Adj] (f : G βg G') : G.minDegree = G'.minDegree - SimpleGraph.Iso.card_edgeFinset_eq π Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {W : Type u_2} {G' : SimpleGraph W} (f : G βg G') [Fintype βG.edgeSet] [Fintype βG'.edgeSet] : G.edgeFinset.card = G'.edgeFinset.card - SimpleGraph.Iso.degree_eq π Mathlib.Combinatorics.SimpleGraph.Finite
{V : Type u_1} {G : SimpleGraph V} {W : Type u_2} {G' : SimpleGraph W} (f : G βg G') (x : V) [Fintype β(G.neighborSet x)] [Fintype β(G'.neighborSet (f x))] : G'.degree (f x) = G.degree x - SimpleGraph.Subgraph.spanningCoeEquivCoeOfSpanning π Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} (G' : G.Subgraph) (h : G'.IsSpanning) : G'.spanningCoe βg G'.coe - SimpleGraph.Subgraph.topIso π Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} : β€.coe βg G - SimpleGraph.Subgraph.botIso π Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} : β₯.coe βg SimpleGraph.emptyGraph Empty - SimpleGraph.Subgraph.isInduced_map_iso π Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {W : Type v} {G : SimpleGraph V} {G' : SimpleGraph W} (e : G βg G') {H : G.Subgraph} : (SimpleGraph.Subgraph.map e.toHom H).IsInduced β H.IsInduced - SimpleGraph.Subgraph.map_iso_top π Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {W : Type v} {G : SimpleGraph V} {H : SimpleGraph W} (e : G βg H) : SimpleGraph.Subgraph.map e.toHom β€ = β€ - SimpleGraph.Subgraph.coeDeleteVertsIso π Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (s : Set V) : (G'.deleteVerts s).coe βg SimpleGraph.induce {v | βv β s} G'.coe - SimpleGraph.Subgraph.coeInduceIso π Mathlib.Combinatorics.SimpleGraph.Subgraph
{V : Type u} {G : SimpleGraph V} {G' : G.Subgraph} (s : Set V) (h : s β G'.verts) : (G'.induce s).coe βg SimpleGraph.induce {v | βv β s} G'.coe - SimpleGraph.Iso.isContained π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (e : G βg H) : G.IsContained H - SimpleGraph.Iso.isContained' π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (e : G βg H) : H.IsContained G - SimpleGraph.Iso.isIndContained π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (e : G βg H) : G.IsIndContained H - SimpleGraph.Iso.isIndContained' π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (e : G βg H) : H.IsIndContained G - SimpleGraph.Iso.toCopy π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : H βg G) : H.Copy G - SimpleGraph.Free.congr_left π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph X} (eβ : H βg G) : G.Free I β H.Free I - SimpleGraph.Free.congr_right π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph X} (eβ : G βg I) : H.Free I β H.Free G - SimpleGraph.IsContained.congr_left π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph X} (eβ : H βg G) : G.IsContained I β H.IsContained I - SimpleGraph.IsContained.congr_right π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph X} (eβ : G βg I) : H.IsContained I β H.IsContained G - SimpleGraph.free_congr_left π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph X} (eβ : H βg G) : H.Free I β G.Free I - SimpleGraph.free_congr_right π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph X} (eβ : G βg I) : H.Free G β H.Free I - SimpleGraph.isContained_congr_left π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph X} (eβ : H βg G) : H.IsContained I β G.IsContained I - SimpleGraph.isContained_congr_right π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {X : Type u_3} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph X} (eβ : G βg I) : H.IsContained G β H.IsContained I - SimpleGraph.isIndContained_iff_exists_iso_induce π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} : G.IsIndContained H β β s, Nonempty (G βg SimpleGraph.induce s H) - SimpleGraph.IsContained.exists_iso_subgraph π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} : H.IsContained G β β G', Nonempty (H βg G'.coe) - SimpleGraph.IsContained.of_exists_iso_subgraph π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} : (β G', Nonempty (H βg G'.coe)) β H.IsContained G - SimpleGraph.free_congr π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} {V' : Type u_4} {W' : Type u_5} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (eβ : H βg H') (eβ : G βg G') : H.Free G β H'.Free G' - SimpleGraph.isContained_congr π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} {V' : Type u_4} {W' : Type u_5} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (eβ : H βg H') (eβ : G βg G') : H.IsContained G β H'.IsContained G' - SimpleGraph.isContained_iff_exists_iso_subgraph π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} : H.IsContained G β β G', Nonempty (H βg G'.coe) - SimpleGraph.Copy.isoToSubgraph π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : H.Copy G) : H βg f.toSubgraph.coe - SimpleGraph.Copy.range_toSubgraph π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} : Set.range SimpleGraph.Copy.toSubgraph = {G' | Nonempty (H βg G'.coe)} - SimpleGraph.Copy.toSubgraph_surjOn π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} : Set.SurjOn SimpleGraph.Copy.toSubgraph Set.univ {G' | Nonempty (H βg G'.coe)} - SimpleGraph.IsIndContained.exists_iso_subgraph π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} : G.IsIndContained H β β H' _e, H'.IsInduced - SimpleGraph.IsIndContained.of_exists_iso_subgraph π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} : (β H' _e, H'.IsInduced) β G.IsIndContained H - SimpleGraph.isIndContained_iff_exists_iso_subgraph π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} : G.IsIndContained H β β H' _e, H'.IsInduced - SimpleGraph.Copy.isoSubgraphMap π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : H.Copy G) (A' : H.Subgraph) : A'.coe βg (SimpleGraph.Subgraph.map f.toHom A').coe - SimpleGraph.killCopies_def π Mathlib.Combinatorics.SimpleGraph.Copy
{V : Type u_4} {W : Type u_5} (G : SimpleGraph V) (H : SimpleGraph W) : G.killCopies H = if hH : H = β₯ then G else G.deleteEdges (β G', β (hG' : Nonempty (H βg G'.coe)), {β―.some}) - Graph.toSimpleGraphOfSimpleGraphIso π Mathlib.Combinatorics.Graph.Simple
{Ξ± : Type u_1} (G : SimpleGraph Ξ±) : (Graph.ofSimpleGraph G).toSimpleGraph βg G - SimpleGraph.Iso.connectedComponentEquiv π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') : G.ConnectedComponent β G'.ConnectedComponent - SimpleGraph.Iso.connected_iff π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {H : SimpleGraph V'} (e : G βg H) : G.Connected β H.Connected - SimpleGraph.Iso.preconnected_iff π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {H : SimpleGraph V'} (e : G βg H) : G.Preconnected β H.Preconnected - SimpleGraph.Iso.connectedComponentEquiv_symm π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') : Ο.symm.connectedComponentEquiv = Ο.connectedComponentEquiv.symm - SimpleGraph.Iso.reachable_iff π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} {Ο : G βg G'} {u v : V} : G'.Reachable (Ο u) (Ο v) β G.Reachable u v - SimpleGraph.Iso.symm_apply_reachable π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} {Ο : G βg G'} {u : V} {v : V'} : G.Reachable (Ο.symm v) u β G'.Reachable v (Ο u) - SimpleGraph.Iso.connectedComponentEquiv_trans π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {V'' : Type w} {G : SimpleGraph V} {G' : SimpleGraph V'} {G'' : SimpleGraph V''} (Ο : G βg G') (Ο' : G' βg G'') : SimpleGraph.Iso.connectedComponentEquiv (RelIso.trans Ο Ο') = Ο.connectedComponentEquiv.trans Ο'.connectedComponentEquiv - SimpleGraph.ConnectedComponent.isoEquivSupp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') (C : G.ConnectedComponent) : βC.supp β β(Ο.connectedComponentEquiv C).supp - SimpleGraph.ConnectedComponent.iso_image_comp_eq_map_iff_eq_comp π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} {Ο : G βg G'} {v : V} {C : G.ConnectedComponent} : G'.connectedComponentMk (Ο v) = SimpleGraph.ConnectedComponent.map (RelIso.toRelEmbedding Ο).toRelHom C β G.connectedComponentMk v = C - SimpleGraph.ConnectedComponent.iso_inv_image_comp_eq_iff_eq_map π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} {Ο : G βg G'} {v' : V'} {C : G.ConnectedComponent} : G.connectedComponentMk (Ο.symm v') = C β G'.connectedComponentMk v' = SimpleGraph.ConnectedComponent.map (RelIso.toRelEmbedding Ο).toRelHom C - SimpleGraph.Iso.connectedComponentEquiv_apply π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') (C : G.ConnectedComponent) : Ο.connectedComponentEquiv C = SimpleGraph.ConnectedComponent.map (RelIso.toRelEmbedding Ο).toRelHom C - SimpleGraph.Iso.connectedComponentEquiv_symm_apply π Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
{V : Type u} {V' : Type v} {G : SimpleGraph V} {G' : SimpleGraph V'} (Ο : G βg G') (C : G'.ConnectedComponent) : Ο.connectedComponentEquiv.symm C = SimpleGraph.ConnectedComponent.map (RelIso.toRelEmbedding Ο.symm).toRelHom C - SimpleGraph.chromaticNumber_congr π Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
{V : Type u} {G : SimpleGraph V} {W : Type u_4} {H : SimpleGraph W} (f : G βg H) : G.chromaticNumber = H.chromaticNumber - SimpleGraph.colorable_congr π Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
{V : Type u} {G : SimpleGraph V} {n : β} {W : Type u_4} {H : SimpleGraph W} (f : G βg H) : G.Colorable n β H.Colorable n - SimpleGraph.coloringCongr π Mathlib.Combinatorics.SimpleGraph.Coloring.Vertex
{V : Type u} {G : SimpleGraph V} {Ξ± : Type u_2} {Ξ² : Type u_3} {W : Type u_4} {H : SimpleGraph W} (f : G βg H) (g : Ξ± β Ξ²) : G.Coloring Ξ± β H.Coloring Ξ² - SimpleGraph.Iso.sumComm π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {W : Type u_5} {G : SimpleGraph V} {H : SimpleGraph W} : G βg H βg H βg G - SimpleGraph.Iso.sumCongr π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') : G βg H βg G' βg H' - SimpleGraph.Iso.sumAssoc π Mathlib.Combinatorics.SimpleGraph.Sum
{U : Type u_1} {V : Type u_3} {W : Type u_5} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph U} : G βg H βg I βg G βg (H βg I) - SimpleGraph.Iso.toEmbedding_sumCongr π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') : (f.sumCongr g).toEmbedding = f.toEmbedding.sum g.toEmbedding - SimpleGraph.Iso.toHom_sumCongr π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') : (f.sumCongr g).toHom = f.toHom.sum g.toHom - SimpleGraph.Iso.sumCongr_toEquiv π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') : (f.sumCongr g).toEquiv = f.sumCongr g.toEquiv - SimpleGraph.Iso.sumComm_comp_sumCongr π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') : SimpleGraph.Iso.sumComm.comp (f.sumCongr g) = (g.sumCongr f).comp SimpleGraph.Iso.sumComm - SimpleGraph.Iso.sumCongr_apply π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') (aβ : V β W) : (f.sumCongr g) aβ = Sum.map (βf) (βg) aβ - SimpleGraph.Iso.sumCongr_symm_apply π Mathlib.Combinatorics.SimpleGraph.Sum
{V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {G' : SimpleGraph V'} {H' : SimpleGraph W'} (f : G βg G') (g : H βg H') (aβ : V' β W') : (RelIso.symm (f.sumCongr g)) aβ = Sum.map (βf.symm) (βg.symm) aβ - SimpleGraph.Iso.sumAssoc_comp_sumCongr π Mathlib.Combinatorics.SimpleGraph.Sum
{U : Type u_1} {U' : Type u_2} {V : Type u_3} {V' : Type u_4} {W : Type u_5} {W' : Type u_6} {G : SimpleGraph V} {H : SimpleGraph W} {I : SimpleGraph U} {G' : SimpleGraph V'} {H' : SimpleGraph W'} {I' : SimpleGraph U'} (f : G βg G') (g : H βg H') (h : I βg I') : SimpleGraph.Iso.sumAssoc.comp ((f.sumCongr g).sumCongr h) = (f.sumCongr (g.sumCongr h)).comp SimpleGraph.Iso.sumAssoc - SimpleGraph.boxProdComm π Mathlib.Combinatorics.SimpleGraph.Prod
{Ξ± : Type u_1} {Ξ² : Type u_2} (G : SimpleGraph Ξ±) (H : SimpleGraph Ξ²) : G β‘ H βg H β‘ G - SimpleGraph.boxProdAssoc π Mathlib.Combinatorics.SimpleGraph.Prod
{Ξ± : Type u_1} {Ξ² : Type u_2} {Ξ³ : Type u_3} (G : SimpleGraph Ξ±) (H : SimpleGraph Ξ²) (I : SimpleGraph Ξ³) : G β‘ H β‘ I βg G β‘ (H β‘ I) - SimpleGraph.Iso.boxProdSumDistrib π Mathlib.Combinatorics.SimpleGraph.Prod
{V : Type u_4} {Wβ : Type u_8} {Wβ : Type u_9} (G : SimpleGraph V) (Hβ : SimpleGraph Wβ) (Hβ : SimpleGraph Wβ) : G β‘ (Hβ βg Hβ) βg G β‘ Hβ βg G β‘ Hβ - SimpleGraph.Iso.sumBoxProdDistrib π Mathlib.Combinatorics.SimpleGraph.Prod
{Vβ : Type u_5} {Vβ : Type u_6} {W : Type u_7} (Gβ : SimpleGraph Vβ) (Gβ : SimpleGraph Vβ) (H : SimpleGraph W) : (Gβ βg Gβ) β‘ H βg Gβ β‘ H βg Gβ β‘ H - SimpleGraph.hasseDualIso π Mathlib.Combinatorics.SimpleGraph.Hasse
{Ξ± : Type u_1} [Preorder Ξ±] : SimpleGraph.hasse Ξ±α΅α΅ βg SimpleGraph.hasse Ξ± - SimpleGraph.hasseDualIso_apply π Mathlib.Combinatorics.SimpleGraph.Hasse
{Ξ± : Type u_1} [Preorder Ξ±] (a : Ξ±α΅α΅) : SimpleGraph.hasseDualIso a = OrderDual.ofDual a - SimpleGraph.Walk.IsPath.pathGraphIsoToSubgraph π Mathlib.Combinatorics.SimpleGraph.Hasse
{V : Type u_3} [DecidableEq V] {G : SimpleGraph V} {u v : V} {w : G.Walk u v} (hw : w.IsPath) : SimpleGraph.pathGraph (w.length + 1) βg w.toSubgraph.coe - SimpleGraph.hasseDualIso_symm_apply π Mathlib.Combinatorics.SimpleGraph.Hasse
{Ξ± : Type u_1} [Preorder Ξ±] (a : Ξ±) : SimpleGraph.hasseDualIso.symm a = OrderDual.toDual a - SimpleGraph.Iso.isAcyclic_iff π Mathlib.Combinatorics.SimpleGraph.Acyclic
{V : Type u_1} {V' : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph V'} (f : G βg G') : G.IsAcyclic β G'.IsAcyclic - SimpleGraph.Iso.isTree_iff π Mathlib.Combinatorics.SimpleGraph.Acyclic
{V : Type u_1} {V' : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph V'} (f : G βg G') : G.IsTree β G'.IsTree - Matrix.IsAdjMatrix.toGraphReindexIso π Mathlib.Combinatorics.SimpleGraph.AdjMatrix
{Ξ± : Type u_1} {V : Type u_2} {W : Type u_3} (A : Matrix V V Ξ±) [MulZeroOneClass Ξ±] [Nontrivial Ξ±] (h : A.IsAdjMatrix) (f : V β W) : β―.toGraph βg h.toGraph - SimpleGraph.Iso.reindex_adjMatrix π Mathlib.Combinatorics.SimpleGraph.AdjMatrix
(Ξ± : Type u_1) {V : Type u_2} {W : Type u_3} {G : SimpleGraph V} [DecidableRel G.Adj] [Zero Ξ±] [One Ξ±] {H : SimpleGraph W} [DecidableRel H.Adj] (f : G βg H) : (Matrix.reindex βf βf) (SimpleGraph.adjMatrix Ξ± G) = SimpleGraph.adjMatrix Ξ± H - SimpleGraph.extremalNumber_congr_right π Mathlib.Combinatorics.SimpleGraph.Extremal.Basic
{n : β} {Wβ : Type u_4} {Wβ : Type u_5} {Hβ : SimpleGraph Wβ} {Hβ : SimpleGraph Wβ} (e : Hβ βg Hβ) : SimpleGraph.extremalNumber n Hβ = SimpleGraph.extremalNumber n Hβ - SimpleGraph.extremalNumber_congr π Mathlib.Combinatorics.SimpleGraph.Extremal.Basic
{nβ nβ : β} {Wβ : Type u_4} {Wβ : Type u_5} {Hβ : SimpleGraph Wβ} {Hβ : SimpleGraph Wβ} (h : nβ = nβ) (e : Hβ βg Hβ) : SimpleGraph.extremalNumber nβ Hβ = SimpleGraph.extremalNumber nβ Hβ - SimpleGraph.IsTuranMaximal.nonempty_iso_turanGraph π Mathlib.Combinatorics.SimpleGraph.Extremal.Turan
{V : Type u_1} [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] {r : β} (h : G.IsTuranMaximal r) : Nonempty (G βg SimpleGraph.turanGraph (Fintype.card V) r) - SimpleGraph.isTuranMaximal_of_iso π Mathlib.Combinatorics.SimpleGraph.Extremal.Turan
{V : Type u_1} [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] {n r : β} (f : G βg SimpleGraph.turanGraph n r) (hr : 0 < r) : G.IsTuranMaximal r - SimpleGraph.isTuranMaximal_iff_nonempty_iso_turanGraph π Mathlib.Combinatorics.SimpleGraph.Extremal.Turan
{V : Type u_1} [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] {r : β} (hr : 0 < r) : G.IsTuranMaximal r β Nonempty (G βg SimpleGraph.turanGraph (Fintype.card V) r) - SimpleGraph.IsTuranMaximal.iso π Mathlib.Combinatorics.SimpleGraph.Extremal.Turan
{V : Type u_1} [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] {r : β} {W : Type u_2} [Fintype W] {H : SimpleGraph W} [DecidableRel H.Adj] (h : G.IsTuranMaximal r) (f : G βg H) (hr : 0 < r) : H.IsTuranMaximal r - SimpleGraph.card_edgeFinset_eq_extremalNumber_top_iff_nonempty_iso_turanGraph π Mathlib.Combinatorics.SimpleGraph.Extremal.Turan
{V : Type u_1} [Fintype V] {G : SimpleGraph V} [DecidableRel G.Adj] {Ξ± : Type u_2} [Fintype Ξ±] [Nontrivial Ξ±] : β€.Free G β§ G.edgeFinset.card = SimpleGraph.extremalNumber (Fintype.card V) β€ β Nonempty (G βg SimpleGraph.turanGraph (Fintype.card V) (Fintype.card Ξ± - 1)) - SimpleGraph.completeEquipartiteGraph.completeMultipartiteGraph π Mathlib.Combinatorics.SimpleGraph.CompleteMultipartite
{r t : β} : SimpleGraph.completeEquipartiteGraph r t βg SimpleGraph.completeMultipartiteGraph (Function.const (Fin r) (Fin t)) - SimpleGraph.completeEquipartiteGraph.turanGraph π Mathlib.Combinatorics.SimpleGraph.CompleteMultipartite
{r t : β} : SimpleGraph.completeEquipartiteGraph r t βg SimpleGraph.turanGraph (r * t) r - SimpleGraph.isCompleteMultipartite_iff π Mathlib.Combinatorics.SimpleGraph.CompleteMultipartite
{Ξ± : Type u} {G : SimpleGraph Ξ±} : G.IsCompleteMultipartite β β ΞΉ V, β (_ : β (i : ΞΉ), Nonempty (V i)), Nonempty (G βg SimpleGraph.completeMultipartiteGraph V) - SimpleGraph.IsCompleteMultipartite.iso π Mathlib.Combinatorics.SimpleGraph.CompleteMultipartite
{Ξ± : Type u} {G : SimpleGraph Ξ±} (h : G.IsCompleteMultipartite) : G βg SimpleGraph.completeMultipartiteGraph fun c => { x // h.setoid c.out x } - SimpleGraph.Iso.egirth_eq π Mathlib.Combinatorics.SimpleGraph.Girth
{Ξ± : Type u_1} {Ξ² : Type u_2} {G : SimpleGraph Ξ±} {G' : SimpleGraph Ξ²} (f : G βg G') : G.egirth = G'.egirth - SimpleGraph.Iso.girth_eq π Mathlib.Combinatorics.SimpleGraph.Girth
{Ξ± : Type u_1} {Ξ² : Type u_2} {G : SimpleGraph Ξ±} {G' : SimpleGraph Ξ²} (f : G βg G') : G.girth = G'.girth - SimpleGraph.Subgraph.Iso.isMatching_map π Mathlib.Combinatorics.SimpleGraph.Matching
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph W} {M : G.Subgraph} (f : G βg G') : (SimpleGraph.Subgraph.map f.toHom M).IsMatching β M.IsMatching - SimpleGraph.Iso.lineGraph π Mathlib.Combinatorics.SimpleGraph.LineGraph
{V : Type u_1} {V' : Type u_2} {G : SimpleGraph V} {G' : SimpleGraph V'} (f : G βg G') : G.lineGraph βg G'.lineGraph - SimpleGraph.UnitDistEmbedding.iso π Mathlib.Combinatorics.SimpleGraph.UnitDistance.Basic
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} {E : Type u_3} [MetricSpace E] (U : G.UnitDistEmbedding E) (e : G βg H) : H.UnitDistEmbedding E - SimpleGraph.UnitDistEmbedding.iso_p_apply π Mathlib.Combinatorics.SimpleGraph.UnitDistance.Basic
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} {E : Type u_3} [MetricSpace E] (U : G.UnitDistEmbedding E) (e : G βg H) (aβ : W) : (U.iso e).p aβ = U.p (e.symm.toCopy.toEmbedding aβ) - SimpleGraph.vertexCoverNum_congr π Mathlib.Combinatorics.SimpleGraph.VertexCover
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : G βg H) : G.vertexCoverNum = H.vertexCoverNum - SimpleGraph.isVertexCover_image_iso π Mathlib.Combinatorics.SimpleGraph.VertexCover
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : G βg H) {c : Set V} : H.IsVertexCover (βf '' c) β G.IsVertexCover c - SimpleGraph.isVertexCover_preimage_iso π Mathlib.Combinatorics.SimpleGraph.VertexCover
{V : Type u_1} {W : Type u_2} {G : SimpleGraph V} {H : SimpleGraph W} (f : G βg H) {c : Set W} : G.IsVertexCover (βf β»ΒΉ' c) β H.IsVertexCover c
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c