Local equivalences

This files defines equivalences between subsets of given types. An element e of LocalEquiv α β is made of two maps e.toFun and e.invFun respectively from α to β and from β to α (just like equivs), which are inverse to each other on the subsets e.source and e.target of respectively α and β.

They are designed in particular to define charts on manifolds.

The main functionality is e.trans f, which composes the two local equivalences by restricting the source and target to the maximal set where the composition makes sense.

As for equivs, we register a coercion to functions and use it in our simp normal form: we write e x and e.symm y instead of e.toFun x and e.invFun y.

Main definitions

Equiv.toLocalEquiv: associating a local equiv to an equiv, with source = target = univ LocalEquiv.symm : the inverse of a local equiv LocalEquiv.trans : the composition of two local equivs LocalEquiv.refl : the identity local equiv LocalEquiv.ofSet : the identity on a set s EqOnSource : equivalence relation describing the "right" notion of equality for local equivs (see below in implementation notes)

Implementation notes

There are at least three possible implementations of local equivalences:

• equivs on subtypes
• pairs of functions taking values in Option α and Option β, equal to none where the local equivalence is not defined
• pairs of functions defined everywhere, keeping the source and target as additional data

Each of these implementations has pros and cons.

• When dealing with subtypes, one still need to define additional API for composition and restriction of domains. Checking that one always belongs to the right subtype makes things very tedious, and leads quickly to DTT hell (as the subtype u ∩ v is not the "same" as v ∩ u, for instance).
• With option-valued functions, the composition is very neat (it is just the usual composition, and the domain is restricted automatically). These are implemented in PEquiv.lean. For manifolds, where one wants to discuss thoroughly the smoothness of the maps, this creates however a lot of overhead as one would need to extend all classes of smoothness to option-valued maps.
• The LocalEquiv version as explained above is easier to use for manifolds. The drawback is that there is extra useless data (the values of toFun and invFun outside of source and target). In particular, the equality notion between local equivs is not "the right one", i.e., coinciding source and target and equality there. Moreover, there are no local equivs in this sense between an empty type and a nonempty type. Since empty types are not that useful, and since one almost never needs to talk about equal local equivs, this is not an issue in practice. Still, we introduce an equivalence relation EqOnSource that captures this right notion of equality, and show that many properties are invariant under this equivalence relation.

Local coding conventions

If a lemma deals with the intersection of a set with either source or target of a LocalEquiv, then it should use e.source ∩ s or e.target ∩ t, not s ∩ e.source or t ∩ e.target.

Implementation of the mfld_set_tac tactic for working with the domains of partially-defined functions (LocalEquiv, LocalHomeomorph, etc).

This is in a separate file from Mathlib.Logic.Equiv.MfldSimpsAttr because attributes need a new file to become functional.

def mfld_cfg : Simps.Config

Common @[simps] configuration options used for manifold-related declarations.

Equations

• One or more equations did not get rendered due to their size.

def Tactic.MfldSetTac.mfldSetTac : Lean.ParserDescr

A very basic tactic to show that sets showing up in manifolds coincide or are included in one another.

Equations

• Tactic.MfldSetTac.mfldSetTac = Lean.ParserDescr.node `Tactic.MfldSetTac.mfldSetTac 1024 (Lean.ParserDescr.nonReservedSymbol "mfld_set_tac" false)

structure LocalEquiv (α : Type u_5) (β : Type u_6) : Type (max u_5 u_6)

• toFun : α → β

  The global function which has a local inverse. Its value outside of the source subset is irrelevant.

• invFun : β → α

  The local inverse to toFun. Its value outside of the target subset is irrelevant.

• source : Set α

  The domain of the local equivalence.

• target : Set β

  The codomain of the local equivalence.

• map_source' : ∀ ⦃x : α⦄, x ∈ s.source → ↑s x ∈ s.target

  The proposition that elements of source are mapped to elements of target.

• map_target' : ∀ ⦃x : β⦄, x ∈ s.target → LocalEquiv.invFun s x ∈ s.source

  The proposition that elements of target are mapped to elements of source.

• left_inv' : ∀ ⦃x : α⦄, x ∈ s.source → LocalEquiv.invFun s (↑s x) = x

  The proposition that invFun is a local left-inverse of toFun on source.

• right_inv' : ∀ ⦃x : β⦄, x ∈ s.target → ↑s (LocalEquiv.invFun s x) = x

  The proposition that invFun is a local right-inverse of toFun on target.

Local equivalence between subsets source and target of α and β respectively. The (global) maps toFun : α → β and invFun : β → α map source to target and conversely, and are inverse to each other there. The values of toFun outside of source and of invFun outside of target are irrelevant.

instance LocalEquiv.instInhabitedLocalEquiv {α : Type u_1} {β : Type u_2} [Inhabited α] [Inhabited β] : Inhabited (LocalEquiv α β)

Equations

• One or more equations did not get rendered due to their size.

def LocalEquiv.symm {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : LocalEquiv β α

The inverse of a local equiv

Equations

• One or more equations did not get rendered due to their size.

instance LocalEquiv.instCoeFunLocalEquivForAll {α : Type u_1} {β : Type u_2} : CoeFun (LocalEquiv α β) fun x => α → β

Equations

• LocalEquiv.instCoeFunLocalEquivForAll = { coe := LocalEquiv.toFun }

def LocalEquiv.Simps.symm_apply {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : β → α

See Note [custom simps projection]

Equations

• LocalEquiv.Simps.symm_apply e = ↑(LocalEquiv.symm e)

@[simp]

theorem LocalEquiv.coe_symm_mk {α : Type u_1} {β : Type u_2} (f : α → β) (g : β → α) (s : Set α) (t : Set β) (ml : ∀ ⦃x : α⦄, x ∈ s → f x ∈ t) (mr : ∀ ⦃x : β⦄, x ∈ t → g x ∈ s) (il : ∀ ⦃x : α⦄, x ∈ s → g (f x) = x) (ir : ∀ ⦃x : β⦄, x ∈ t → f (g x) = x) : ↑(LocalEquiv.symm { toFun := f, invFun := g, source := s, target := t, map_source' := ml, map_target' := mr, left_inv' := il, right_inv' := ir }) = g

@[simp]

theorem LocalEquiv.invFun_as_coe {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : e.invFun = ↑(LocalEquiv.symm e)

@[simp]

theorem LocalEquiv.map_source {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {x : α} (h : x ∈ e.source) : ↑e x ∈ e.target

@[simp]

theorem LocalEquiv.map_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {x : β} (h : x ∈ e.target) : ↑(LocalEquiv.symm e) x ∈ e.source

@[simp]

theorem LocalEquiv.left_inv {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {x : α} (h : x ∈ e.source) : ↑(LocalEquiv.symm e) (↑e x) = x

@[simp]

theorem LocalEquiv.right_inv {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {x : β} (h : x ∈ e.target) : ↑e (↑(LocalEquiv.symm e) x) = x

theorem LocalEquiv.eq_symm_apply {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {x : α} {y : β} (hx : x ∈ e.source) (hy : y ∈ e.target) : x = ↑(LocalEquiv.symm e) y ↔ ↑e x = y

theorem LocalEquiv.mapsTo {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : Set.MapsTo (↑e) e.source e.target

theorem LocalEquiv.symm_mapsTo {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : Set.MapsTo (↑(LocalEquiv.symm e)) e.target e.source

theorem LocalEquiv.leftInvOn {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : Set.LeftInvOn (↑(LocalEquiv.symm e)) (↑e) e.source

theorem LocalEquiv.rightInvOn {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : Set.RightInvOn (↑(LocalEquiv.symm e)) (↑e) e.target

theorem LocalEquiv.invOn {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : Set.InvOn (↑(LocalEquiv.symm e)) (↑e) e.source e.target

theorem LocalEquiv.injOn {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : Set.InjOn (↑e) e.source

theorem LocalEquiv.bijOn {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : Set.BijOn (↑e) e.source e.target

theorem LocalEquiv.surjOn {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : Set.SurjOn (↑e) e.source e.target

@[simp]

theorem Equiv.toLocalEquivOfImageEq_target {α : Type u_1} {β : Type u_2} (e : α ≃ β) (s : Set α) (t : Set β) (h : ↑e '' s = t) : (Equiv.toLocalEquivOfImageEq e s t h).target = t

@[simp]

theorem Equiv.toLocalEquivOfImageEq_symm_apply {α : Type u_1} {β : Type u_2} (e : α ≃ β) (s : Set α) (t : Set β) (h : ↑e '' s = t) : ↑(LocalEquiv.symm (Equiv.toLocalEquivOfImageEq e s t h)) = ↑e.symm

@[simp]

theorem Equiv.toLocalEquivOfImageEq_source {α : Type u_1} {β : Type u_2} (e : α ≃ β) (s : Set α) (t : Set β) (h : ↑e '' s = t) : (Equiv.toLocalEquivOfImageEq e s t h).source = s

@[simp]

theorem Equiv.toLocalEquivOfImageEq_apply {α : Type u_1} {β : Type u_2} (e : α ≃ β) (s : Set α) (t : Set β) (h : ↑e '' s = t) : ↑(Equiv.toLocalEquivOfImageEq e s t h) = ↑e

def Equiv.toLocalEquivOfImageEq {α : Type u_1} {β : Type u_2} (e : α ≃ β) (s : Set α) (t : Set β) (h : ↑e '' s = t) : LocalEquiv α β

Interpret an Equiv as a LocalEquiv by restricting it to s in the domain and to t in the codomain.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem Equiv.toLocalEquiv_symm_apply {α : Type u_1} {β : Type u_2} (e : α ≃ β) : ↑(LocalEquiv.symm (Equiv.toLocalEquiv e)) = ↑e.symm

@[simp]

theorem Equiv.toLocalEquiv_apply {α : Type u_1} {β : Type u_2} (e : α ≃ β) : ↑(Equiv.toLocalEquiv e) = ↑e

@[simp]

theorem Equiv.toLocalEquiv_target {α : Type u_1} {β : Type u_2} (e : α ≃ β) : (Equiv.toLocalEquiv e).target = Set.univ

@[simp]

theorem Equiv.toLocalEquiv_source {α : Type u_1} {β : Type u_2} (e : α ≃ β) : (Equiv.toLocalEquiv e).source = Set.univ

def Equiv.toLocalEquiv {α : Type u_1} {β : Type u_2} (e : α ≃ β) : LocalEquiv α β

Associate a LocalEquiv to an Equiv.

Equations

• Equiv.toLocalEquiv e = Equiv.toLocalEquivOfImageEq e Set.univ Set.univ (_ : ↑e '' Set.univ = Set.univ)

instance LocalEquiv.inhabitedOfEmpty {α : Type u_1} {β : Type u_2} [IsEmpty α] [IsEmpty β] : Inhabited (LocalEquiv α β)

Equations

• LocalEquiv.inhabitedOfEmpty = { default := Equiv.toLocalEquiv ((Equiv.equivEmpty α).trans (Equiv.equivEmpty β).symm) }

@[simp]

theorem LocalEquiv.copy_apply {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (f : α → β) (hf : ↑e = f) (g : β → α) (hg : ↑(LocalEquiv.symm e) = g) (s : Set α) (hs : e.source = s) (t : Set β) (ht : e.target = t) : ↑(LocalEquiv.copy e f hf g hg s hs t ht) = f

@[simp]

theorem LocalEquiv.copy_source {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (f : α → β) (hf : ↑e = f) (g : β → α) (hg : ↑(LocalEquiv.symm e) = g) (s : Set α) (hs : e.source = s) (t : Set β) (ht : e.target = t) : (LocalEquiv.copy e f hf g hg s hs t ht).source = s

@[simp]

theorem LocalEquiv.copy_symm_apply {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (f : α → β) (hf : ↑e = f) (g : β → α) (hg : ↑(LocalEquiv.symm e) = g) (s : Set α) (hs : e.source = s) (t : Set β) (ht : e.target = t) : ↑(LocalEquiv.symm (LocalEquiv.copy e f hf g hg s hs t ht)) = g

@[simp]

theorem LocalEquiv.copy_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (f : α → β) (hf : ↑e = f) (g : β → α) (hg : ↑(LocalEquiv.symm e) = g) (s : Set α) (hs : e.source = s) (t : Set β) (ht : e.target = t) : (LocalEquiv.copy e f hf g hg s hs t ht).target = t

def LocalEquiv.copy {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (f : α → β) (hf : ↑e = f) (g : β → α) (hg : ↑(LocalEquiv.symm e) = g) (s : Set α) (hs : e.source = s) (t : Set β) (ht : e.target = t) : LocalEquiv α β

Create a copy of a LocalEquiv providing better definitional equalities.

Equations

• One or more equations did not get rendered due to their size.

theorem LocalEquiv.copy_eq {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (f : α → β) (hf : ↑e = f) (g : β → α) (hg : ↑(LocalEquiv.symm e) = g) (s : Set α) (hs : e.source = s) (t : Set β) (ht : e.target = t) : LocalEquiv.copy e f hf g hg s hs t ht = e

def LocalEquiv.toEquiv {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : ↑e.source ≃ ↑e.target

Associate to a LocalEquiv an Equiv between the source and the target.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem LocalEquiv.symm_source {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : (LocalEquiv.symm e).source = e.target

@[simp]

theorem LocalEquiv.symm_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : (LocalEquiv.symm e).target = e.source

@[simp]

theorem LocalEquiv.symm_symm {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : LocalEquiv.symm (LocalEquiv.symm e) = e

theorem LocalEquiv.image_source_eq_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : ↑e '' e.source = e.target

theorem LocalEquiv.forall_mem_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {p : β → Prop} : ((y : β) → y ∈ e.target → p y) ↔ (x : α) → x ∈ e.source → p (↑e x)

theorem LocalEquiv.exists_mem_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {p : β → Prop} : (∃ y, y ∈ e.target ∧ p y) ↔ ∃ x, x ∈ e.source ∧ p (↑e x)

def LocalEquiv.IsImage {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set α) (t : Set β) : Prop

We say that t : Set β is an image of s : Set α under a local equivalence if any of the following equivalent conditions hold:

• e '' (e.source ∩ s) = e.target ∩ t;
• e.source ∩ e ⁻¹ t = e.source ∩ s;
• ∀ x ∈ e.source, e x ∈ t ↔ x ∈ s (this one is used in the definition).

Equations

• LocalEquiv.IsImage e s t = ∀ ⦃x : α⦄, x ∈ e.source → (↑e x ∈ t ↔ x ∈ s)

theorem LocalEquiv.IsImage.apply_mem_iff {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} {x : α} (h : LocalEquiv.IsImage e s t) (hx : x ∈ e.source) : ↑e x ∈ t ↔ x ∈ s

theorem LocalEquiv.IsImage.symm_apply_mem_iff {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) ⦃y : β⦄ : y ∈ e.target → (↑(LocalEquiv.symm e) y ∈ s ↔ y ∈ t)

theorem LocalEquiv.IsImage.symm {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : LocalEquiv.IsImage (LocalEquiv.symm e) t s

@[simp]

theorem LocalEquiv.IsImage.symm_iff {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} : LocalEquiv.IsImage (LocalEquiv.symm e) t s ↔ LocalEquiv.IsImage e s t

theorem LocalEquiv.IsImage.mapsTo {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : Set.MapsTo (↑e) (e.source ∩ s) (e.target ∩ t)

theorem LocalEquiv.IsImage.symm_mapsTo {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : Set.MapsTo (↑(LocalEquiv.symm e)) (e.target ∩ t) (e.source ∩ s)

@[simp]

theorem LocalEquiv.IsImage.restr_target {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : (LocalEquiv.IsImage.restr h).target = e.target ∩ t

@[simp]

theorem LocalEquiv.IsImage.restr_source {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : (LocalEquiv.IsImage.restr h).source = e.source ∩ s

@[simp]

theorem LocalEquiv.IsImage.restr_apply {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : ↑(LocalEquiv.IsImage.restr h) = ↑e

@[simp]

theorem LocalEquiv.IsImage.restr_symm_apply {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : ↑(LocalEquiv.symm (LocalEquiv.IsImage.restr h)) = ↑(LocalEquiv.symm e)

def LocalEquiv.IsImage.restr {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : LocalEquiv α β

Restrict a LocalEquiv to a pair of corresponding sets.

Equations

• One or more equations did not get rendered due to their size.

theorem LocalEquiv.IsImage.image_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : ↑e '' (e.source ∩ s) = e.target ∩ t

theorem LocalEquiv.IsImage.symm_image_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : ↑(LocalEquiv.symm e) '' (e.target ∩ t) = e.source ∩ s

theorem LocalEquiv.IsImage.iff_preimage_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} : LocalEquiv.IsImage e s t ↔ e.source ∩ ↑e ⁻¹' t = e.source ∩ s

theorem LocalEquiv.IsImage.of_preimage_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} : e.source ∩ ↑e ⁻¹' t = e.source ∩ s → LocalEquiv.IsImage e s t

Alias of the reverse direction of LocalEquiv.IsImage.iff_preimage_eq.

theorem LocalEquiv.IsImage.preimage_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} : LocalEquiv.IsImage e s t → e.source ∩ ↑e ⁻¹' t = e.source ∩ s

Alias of the forward direction of LocalEquiv.IsImage.iff_preimage_eq.

theorem LocalEquiv.IsImage.iff_symm_preimage_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} : LocalEquiv.IsImage e s t ↔ e.target ∩ ↑(LocalEquiv.symm e) ⁻¹' s = e.target ∩ t

theorem LocalEquiv.IsImage.symm_preimage_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} : LocalEquiv.IsImage e s t → e.target ∩ ↑(LocalEquiv.symm e) ⁻¹' s = e.target ∩ t

Alias of the forward direction of LocalEquiv.IsImage.iff_symm_preimage_eq.

theorem LocalEquiv.IsImage.of_symm_preimage_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} : e.target ∩ ↑(LocalEquiv.symm e) ⁻¹' s = e.target ∩ t → LocalEquiv.IsImage e s t

Alias of the reverse direction of LocalEquiv.IsImage.iff_symm_preimage_eq.

theorem LocalEquiv.IsImage.of_image_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : ↑e '' (e.source ∩ s) = e.target ∩ t) : LocalEquiv.IsImage e s t

theorem LocalEquiv.IsImage.of_symm_image_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : ↑(LocalEquiv.symm e) '' (e.target ∩ t) = e.source ∩ s) : LocalEquiv.IsImage e s t

theorem LocalEquiv.IsImage.compl {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} (h : LocalEquiv.IsImage e s t) : LocalEquiv.IsImage e sᶜ tᶜ

theorem LocalEquiv.IsImage.inter {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} {s' : Set α} {t' : Set β} (h : LocalEquiv.IsImage e s t) (h' : LocalEquiv.IsImage e s' t') : LocalEquiv.IsImage e (s ∩ s') (t ∩ t')

theorem LocalEquiv.IsImage.union {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} {s' : Set α} {t' : Set β} (h : LocalEquiv.IsImage e s t) (h' : LocalEquiv.IsImage e s' t') : LocalEquiv.IsImage e (s ∪ s') (t ∪ t')

theorem LocalEquiv.IsImage.diff {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} {s' : Set α} {t' : Set β} (h : LocalEquiv.IsImage e s t) (h' : LocalEquiv.IsImage e s' t') : LocalEquiv.IsImage e (s \ s') (t \ t')

theorem LocalEquiv.IsImage.leftInvOn_piecewise {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} {e' : LocalEquiv α β} [(i : α) → Decidable (i ∈ s)] [(i : β) → Decidable (i ∈ t)] (h : LocalEquiv.IsImage e s t) (h' : LocalEquiv.IsImage e' s t) : Set.LeftInvOn (Set.piecewise t ↑(LocalEquiv.symm e) ↑(LocalEquiv.symm e')) (Set.piecewise s ↑e ↑e') (Set.ite s e.source e'.source)

theorem LocalEquiv.IsImage.inter_eq_of_inter_eq_of_eqOn {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} {e' : LocalEquiv α β} (h : LocalEquiv.IsImage e s t) (h' : LocalEquiv.IsImage e' s t) (hs : e.source ∩ s = e'.source ∩ s) (heq : Set.EqOn (↑e) (↑e') (e.source ∩ s)) : e.target ∩ t = e'.target ∩ t

theorem LocalEquiv.IsImage.symm_eq_on_of_inter_eq_of_eqOn {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} {t : Set β} {e' : LocalEquiv α β} (h : LocalEquiv.IsImage e s t) (hs : e.source ∩ s = e'.source ∩ s) (heq : Set.EqOn (↑e) (↑e') (e.source ∩ s)) : Set.EqOn (↑(LocalEquiv.symm e)) (↑(LocalEquiv.symm e')) (e.target ∩ t)

theorem LocalEquiv.isImage_source_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : LocalEquiv.IsImage e e.source e.target

theorem LocalEquiv.isImage_source_target_of_disjoint {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) : LocalEquiv.IsImage e e'.source e'.target

theorem LocalEquiv.image_source_inter_eq' {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set α) : ↑e '' (e.source ∩ s) = e.target ∩ ↑(LocalEquiv.symm e) ⁻¹' s

theorem LocalEquiv.image_source_inter_eq {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set α) : ↑e '' (e.source ∩ s) = e.target ∩ ↑(LocalEquiv.symm e) ⁻¹' (e.source ∩ s)

theorem LocalEquiv.image_eq_target_inter_inv_preimage {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {s : Set α} (h : s ⊆ e.source) : ↑e '' s = e.target ∩ ↑(LocalEquiv.symm e) ⁻¹' s

theorem LocalEquiv.symm_image_eq_source_inter_preimage {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {s : Set β} (h : s ⊆ e.target) : ↑(LocalEquiv.symm e) '' s = e.source ∩ ↑e ⁻¹' s

theorem LocalEquiv.symm_image_target_inter_eq {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set β) : ↑(LocalEquiv.symm e) '' (e.target ∩ s) = e.source ∩ ↑e ⁻¹' (e.target ∩ s)

theorem LocalEquiv.symm_image_target_inter_eq' {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set β) : ↑(LocalEquiv.symm e) '' (e.target ∩ s) = e.source ∩ ↑e ⁻¹' s

theorem LocalEquiv.source_inter_preimage_inv_preimage {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set α) : e.source ∩ ↑e ⁻¹' (↑(LocalEquiv.symm e) ⁻¹' s) = e.source ∩ s

theorem LocalEquiv.source_inter_preimage_target_inter {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set β) : e.source ∩ ↑e ⁻¹' (e.target ∩ s) = e.source ∩ ↑e ⁻¹' s

theorem LocalEquiv.target_inter_inv_preimage_preimage {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set β) : e.target ∩ ↑(LocalEquiv.symm e) ⁻¹' (↑e ⁻¹' s) = e.target ∩ s

theorem LocalEquiv.symm_image_image_of_subset_source {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {s : Set α} (h : s ⊆ e.source) : ↑(LocalEquiv.symm e) '' (↑e '' s) = s

theorem LocalEquiv.image_symm_image_of_subset_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) {s : Set β} (h : s ⊆ e.target) : ↑e '' (↑(LocalEquiv.symm e) '' s) = s

theorem LocalEquiv.source_subset_preimage_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : e.source ⊆ ↑e ⁻¹' e.target

theorem LocalEquiv.symm_image_target_eq_source {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : ↑(LocalEquiv.symm e) '' e.target = e.source

theorem LocalEquiv.target_subset_preimage_source {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : e.target ⊆ ↑(LocalEquiv.symm e) ⁻¹' e.source

theorem LocalEquiv.ext {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {e' : LocalEquiv α β} (h : ∀ (x : α), ↑e x = ↑e' x) (hsymm : ∀ (x : β), ↑(LocalEquiv.symm e) x = ↑(LocalEquiv.symm e') x) (hs : e.source = e'.source) : e = e'

Two local equivs that have the same source, same toFun and same invFun, coincide.

def LocalEquiv.restr {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set α) : LocalEquiv α β

Restricting a local equivalence to e.source ∩ s

Equations

• LocalEquiv.restr e s = LocalEquiv.IsImage.restr (_ : LocalEquiv.IsImage e s (↑(LocalEquiv.symm e) ⁻¹' s))

@[simp]

theorem LocalEquiv.restr_coe {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set α) : ↑(LocalEquiv.restr e s) = ↑e

@[simp]

theorem LocalEquiv.restr_coe_symm {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set α) : ↑(LocalEquiv.symm (LocalEquiv.restr e s)) = ↑(LocalEquiv.symm e)

@[simp]

theorem LocalEquiv.restr_source {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set α) : (LocalEquiv.restr e s).source = e.source ∩ s

@[simp]

theorem LocalEquiv.restr_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set α) : (LocalEquiv.restr e s).target = e.target ∩ ↑(LocalEquiv.symm e) ⁻¹' s

theorem LocalEquiv.restr_eq_of_source_subset {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {s : Set α} (h : e.source ⊆ s) : LocalEquiv.restr e s = e

@[simp]

theorem LocalEquiv.restr_univ {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} : LocalEquiv.restr e Set.univ = e

def LocalEquiv.refl (α : Type u_5) : LocalEquiv α α

The identity local equiv

Equations

• LocalEquiv.refl α = Equiv.toLocalEquiv (Equiv.refl α)

@[simp]

theorem LocalEquiv.refl_source {α : Type u_1} : (LocalEquiv.refl α).source = Set.univ

@[simp]

theorem LocalEquiv.refl_target {α : Type u_1} : (LocalEquiv.refl α).target = Set.univ

@[simp]

theorem LocalEquiv.refl_coe {α : Type u_1} : ↑(LocalEquiv.refl α) = id

@[simp]

theorem LocalEquiv.refl_symm {α : Type u_1} : LocalEquiv.symm (LocalEquiv.refl α) = LocalEquiv.refl α

theorem LocalEquiv.refl_restr_source {α : Type u_1} (s : Set α) : (LocalEquiv.restr (LocalEquiv.refl α) s).source = s

theorem LocalEquiv.refl_restr_target {α : Type u_1} (s : Set α) : (LocalEquiv.restr (LocalEquiv.refl α) s).target = s

def LocalEquiv.ofSet {α : Type u_1} (s : Set α) : LocalEquiv α α

The identity local equiv on a set s

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem LocalEquiv.ofSet_source {α : Type u_1} (s : Set α) : (LocalEquiv.ofSet s).source = s

@[simp]

theorem LocalEquiv.ofSet_target {α : Type u_1} (s : Set α) : (LocalEquiv.ofSet s).target = s

@[simp]

theorem LocalEquiv.ofSet_coe {α : Type u_1} (s : Set α) : ↑(LocalEquiv.ofSet s) = id

@[simp]

theorem LocalEquiv.ofSet_symm {α : Type u_1} (s : Set α) : LocalEquiv.symm (LocalEquiv.ofSet s) = LocalEquiv.ofSet s

@[simp]

theorem LocalEquiv.trans'_source {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) (h : e.target = e'.source) : (LocalEquiv.trans' e e' h).source = e.source

@[simp]

theorem LocalEquiv.trans'_apply {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) (h : e.target = e'.source) : ∀ (a : α), ↑(LocalEquiv.trans' e e' h) a = (↑e' ∘ ↑e) a

@[simp]

theorem LocalEquiv.trans'_symm_apply {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) (h : e.target = e'.source) : ∀ (a : γ), ↑(LocalEquiv.symm (LocalEquiv.trans' e e' h)) a = (↑(LocalEquiv.symm e) ∘ ↑(LocalEquiv.symm e')) a

@[simp]

theorem LocalEquiv.trans'_target {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) (h : e.target = e'.source) : (LocalEquiv.trans' e e' h).target = e'.target

def LocalEquiv.trans' {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) (h : e.target = e'.source) : LocalEquiv α γ

Composing two local equivs if the target of the first coincides with the source of the second.

Equations

• One or more equations did not get rendered due to their size.

def LocalEquiv.trans {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : LocalEquiv α γ

Composing two local equivs, by restricting to the maximal domain where their composition is well defined.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem LocalEquiv.coe_trans {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : ↑(LocalEquiv.trans e e') = ↑e' ∘ ↑e

@[simp]

theorem LocalEquiv.coe_trans_symm {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : ↑(LocalEquiv.symm (LocalEquiv.trans e e')) = ↑(LocalEquiv.symm e) ∘ ↑(LocalEquiv.symm e')

theorem LocalEquiv.trans_apply {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) {x : α} : ↑(LocalEquiv.trans e e') x = ↑e' (↑e x)

theorem LocalEquiv.trans_symm_eq_symm_trans_symm {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : LocalEquiv.symm (LocalEquiv.trans e e') = LocalEquiv.trans (LocalEquiv.symm e') (LocalEquiv.symm e)

@[simp]

theorem LocalEquiv.trans_source {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : (LocalEquiv.trans e e').source = e.source ∩ ↑e ⁻¹' e'.source

theorem LocalEquiv.trans_source' {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : (LocalEquiv.trans e e').source = e.source ∩ ↑e ⁻¹' (e.target ∩ e'.source)

theorem LocalEquiv.trans_source'' {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : (LocalEquiv.trans e e').source = ↑(LocalEquiv.symm e) '' (e.target ∩ e'.source)

theorem LocalEquiv.image_trans_source {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : ↑e '' (LocalEquiv.trans e e').source = e.target ∩ e'.source

@[simp]

theorem LocalEquiv.trans_target {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : (LocalEquiv.trans e e').target = e'.target ∩ ↑(LocalEquiv.symm e') ⁻¹' e.target

theorem LocalEquiv.trans_target' {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : (LocalEquiv.trans e e').target = e'.target ∩ ↑(LocalEquiv.symm e') ⁻¹' (e'.source ∩ e.target)

theorem LocalEquiv.trans_target'' {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : (LocalEquiv.trans e e').target = ↑e' '' (e'.source ∩ e.target)

theorem LocalEquiv.inv_image_trans_target {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) : ↑(LocalEquiv.symm e') '' (LocalEquiv.trans e e').target = e'.source ∩ e.target

theorem LocalEquiv.trans_assoc {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e : LocalEquiv α β) (e' : LocalEquiv β γ) (e'' : LocalEquiv γ δ) : LocalEquiv.trans (LocalEquiv.trans e e') e'' = LocalEquiv.trans e (LocalEquiv.trans e' e'')

@[simp]

theorem LocalEquiv.trans_refl {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : LocalEquiv.trans e (LocalEquiv.refl β) = e

@[simp]

theorem LocalEquiv.refl_trans {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : LocalEquiv.trans (LocalEquiv.refl α) e = e

theorem LocalEquiv.trans_ofSet {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set β) : LocalEquiv.trans e (LocalEquiv.ofSet s) = LocalEquiv.restr e (↑e ⁻¹' s)

theorem LocalEquiv.trans_refl_restr {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set β) : LocalEquiv.trans e (LocalEquiv.restr (LocalEquiv.refl β) s) = LocalEquiv.restr e (↑e ⁻¹' s)

theorem LocalEquiv.trans_refl_restr' {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (s : Set β) : LocalEquiv.trans e (LocalEquiv.restr (LocalEquiv.refl β) s) = LocalEquiv.restr e (e.source ∩ ↑e ⁻¹' s)

theorem LocalEquiv.restr_trans {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : LocalEquiv β γ) (s : Set α) : LocalEquiv.trans (LocalEquiv.restr e s) e' = LocalEquiv.restr (LocalEquiv.trans e e') s

theorem LocalEquiv.mem_symm_trans_source {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) {e' : LocalEquiv α γ} {x : α} (he : x ∈ e.source) (he' : x ∈ e'.source) : ↑e x ∈ (LocalEquiv.trans (LocalEquiv.symm e) e').source

A lemma commonly useful when e and e' are charts of a manifold.

@[simp]

theorem LocalEquiv.transEquiv_symm_apply {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : β ≃ γ) : ∀ (a : γ), ↑(LocalEquiv.symm (LocalEquiv.transEquiv e e')) a = ↑(LocalEquiv.symm e) (↑e'.symm a)

@[simp]

theorem LocalEquiv.transEquiv_source {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : β ≃ γ) : (LocalEquiv.transEquiv e e').source = e.source

@[simp]

theorem LocalEquiv.transEquiv_target {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : β ≃ γ) : (LocalEquiv.transEquiv e e').target = ↑e'.symm ⁻¹' e.target

@[simp]

theorem LocalEquiv.transEquiv_apply {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : β ≃ γ) : ∀ (a : α), ↑(LocalEquiv.transEquiv e e') a = ↑e' (↑e a)

def LocalEquiv.transEquiv {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : β ≃ γ) : LocalEquiv α γ

Postcompose a local equivalence with an equivalence. We modify the source and target to have better definitional behavior.

Equations

• One or more equations did not get rendered due to their size.

theorem LocalEquiv.transEquiv_eq_trans {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : LocalEquiv α β) (e' : β ≃ γ) : LocalEquiv.transEquiv e e' = LocalEquiv.trans e (Equiv.toLocalEquiv e')

@[simp]

theorem Equiv.transLocalEquiv_source {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e' : LocalEquiv β γ) (e : α ≃ β) : (Equiv.transLocalEquiv e' e).source = ↑e ⁻¹' e'.source

@[simp]

theorem Equiv.transLocalEquiv_target {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e' : LocalEquiv β γ) (e : α ≃ β) : (Equiv.transLocalEquiv e' e).target = e'.target

@[simp]

theorem Equiv.transLocalEquiv_symm_apply {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e' : LocalEquiv β γ) (e : α ≃ β) : ∀ (a : γ), ↑(LocalEquiv.symm (Equiv.transLocalEquiv e' e)) a = ↑e.symm (↑(LocalEquiv.symm e') a)

@[simp]

theorem Equiv.transLocalEquiv_apply {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e' : LocalEquiv β γ) (e : α ≃ β) : ∀ (a : α), ↑(Equiv.transLocalEquiv e' e) a = ↑e' (↑e a)

def Equiv.transLocalEquiv {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e' : LocalEquiv β γ) (e : α ≃ β) : LocalEquiv α γ

Precompose a local equivalence with an equivalence. We modify the source and target to have better definitional behavior.

Equations

• One or more equations did not get rendered due to their size.

theorem Equiv.transLocalEquiv_eq_trans {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e' : LocalEquiv β γ) (e : α ≃ β) : Equiv.transLocalEquiv e' e = LocalEquiv.trans (Equiv.toLocalEquiv e) e'

def LocalEquiv.EqOnSource {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) : Prop

EqOnSource e e' means that e and e' have the same source, and coincide there. Then e and e' should really be considered the same local equiv.

Equations

• LocalEquiv.EqOnSource e e' = (e.source = e'.source ∧ Set.EqOn (↑e) (↑e') e.source)

instance LocalEquiv.eqOnSourceSetoid {α : Type u_1} {β : Type u_2} : Setoid (LocalEquiv α β)

EqOnSource is an equivalence relation. This instance provides the ≈ notation between two LocalEquivs.

Equations

• LocalEquiv.eqOnSourceSetoid = { r := LocalEquiv.EqOnSource, iseqv := (_ : Equivalence LocalEquiv.EqOnSource) }

theorem LocalEquiv.eqOnSource_refl {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : e ≈ e

theorem LocalEquiv.EqOnSource.source_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {e' : LocalEquiv α β} (h : e ≈ e') : e.source = e'.source

Two equivalent local equivs have the same source

theorem LocalEquiv.EqOnSource.eqOn {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {e' : LocalEquiv α β} (h : e ≈ e') : Set.EqOn (↑e) (↑e') e.source

Two equivalent local equivs coincide on the source

theorem LocalEquiv.EqOnSource.target_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {e' : LocalEquiv α β} (h : e ≈ e') : e.target = e'.target

Two equivalent local equivs have the same target

theorem LocalEquiv.EqOnSource.symm' {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {e' : LocalEquiv α β} (h : e ≈ e') : LocalEquiv.symm e ≈ LocalEquiv.symm e'

If two local equivs are equivalent, so are their inverses.

theorem LocalEquiv.EqOnSource.symm_eqOn {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {e' : LocalEquiv α β} (h : e ≈ e') : Set.EqOn (↑(LocalEquiv.symm e)) (↑(LocalEquiv.symm e')) e.target

Two equivalent local equivs have coinciding inverses on the target

theorem LocalEquiv.EqOnSource.trans' {α : Type u_1} {β : Type u_2} {γ : Type u_3} {e : LocalEquiv α β} {e' : LocalEquiv α β} {f : LocalEquiv β γ} {f' : LocalEquiv β γ} (he : e ≈ e') (hf : f ≈ f') : LocalEquiv.trans e f ≈ LocalEquiv.trans e' f'

Composition of local equivs respects equivalence

theorem LocalEquiv.EqOnSource.restr {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {e' : LocalEquiv α β} (he : e ≈ e') (s : Set α) : LocalEquiv.restr e s ≈ LocalEquiv.restr e' s

Restriction of local equivs respects equivalence

theorem LocalEquiv.EqOnSource.source_inter_preimage_eq {α : Type u_1} {β : Type u_2} {e : LocalEquiv α β} {e' : LocalEquiv α β} (he : e ≈ e') (s : Set β) : e.source ∩ ↑e ⁻¹' s = e'.source ∩ ↑e' ⁻¹' s

Preimages are respected by equivalence

theorem LocalEquiv.trans_self_symm {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : LocalEquiv.trans e (LocalEquiv.symm e) ≈ LocalEquiv.ofSet e.source

Composition of a local equiv and its inverse is equivalent to the restriction of the identity to the source

theorem LocalEquiv.trans_symm_self {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) : LocalEquiv.trans (LocalEquiv.symm e) e ≈ LocalEquiv.ofSet e.target

Composition of the inverse of a local equiv and this local equiv is equivalent to the restriction of the identity to the target

theorem LocalEquiv.eq_of_eq_on_source_univ {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (h : e ≈ e') (s : e.source = Set.univ) (t : e.target = Set.univ) : e = e'

Two equivalent local equivs are equal when the source and target are univ

def LocalEquiv.prod {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e : LocalEquiv α β) (e' : LocalEquiv γ δ) : LocalEquiv (α × γ) (β × δ)

The product of two local equivs, as a local equiv on the product.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem LocalEquiv.prod_source {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e : LocalEquiv α β) (e' : LocalEquiv γ δ) : (LocalEquiv.prod e e').source = e.source ×ˢ e'.source

@[simp]

theorem LocalEquiv.prod_target {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e : LocalEquiv α β) (e' : LocalEquiv γ δ) : (LocalEquiv.prod e e').target = e.target ×ˢ e'.target

@[simp]

theorem LocalEquiv.prod_coe {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e : LocalEquiv α β) (e' : LocalEquiv γ δ) : ↑(LocalEquiv.prod e e') = fun p => (↑e p.fst, ↑e' p.snd)

theorem LocalEquiv.prod_coe_symm {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e : LocalEquiv α β) (e' : LocalEquiv γ δ) : ↑(LocalEquiv.symm (LocalEquiv.prod e e')) = fun p => (↑(LocalEquiv.symm e) p.fst, ↑(LocalEquiv.symm e') p.snd)

@[simp]

theorem LocalEquiv.prod_symm {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} (e : LocalEquiv α β) (e' : LocalEquiv γ δ) : LocalEquiv.symm (LocalEquiv.prod e e') = LocalEquiv.prod (LocalEquiv.symm e) (LocalEquiv.symm e')

@[simp]

theorem LocalEquiv.refl_prod_refl {α : Type u_1} {β : Type u_2} : LocalEquiv.prod (LocalEquiv.refl α) (LocalEquiv.refl β) = LocalEquiv.refl (α × β)

@[simp]

theorem LocalEquiv.prod_trans {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} {η : Type u_5} {ε : Type u_6} (e : LocalEquiv α β) (f : LocalEquiv β γ) (e' : LocalEquiv δ η) (f' : LocalEquiv η ε) : LocalEquiv.trans (LocalEquiv.prod e e') (LocalEquiv.prod f f') = LocalEquiv.prod (LocalEquiv.trans e f) (LocalEquiv.trans e' f')

@[simp]

theorem LocalEquiv.piecewise_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (s : Set α) (t : Set β) [(x : α) → Decidable (x ∈ s)] [(y : β) → Decidable (y ∈ t)] (H : LocalEquiv.IsImage e s t) (H' : LocalEquiv.IsImage e' s t) : (LocalEquiv.piecewise e e' s t H H').target = Set.ite t e.target e'.target

@[simp]

theorem LocalEquiv.piecewise_source {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (s : Set α) (t : Set β) [(x : α) → Decidable (x ∈ s)] [(y : β) → Decidable (y ∈ t)] (H : LocalEquiv.IsImage e s t) (H' : LocalEquiv.IsImage e' s t) : (LocalEquiv.piecewise e e' s t H H').source = Set.ite s e.source e'.source

@[simp]

theorem LocalEquiv.piecewise_apply {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (s : Set α) (t : Set β) [(x : α) → Decidable (x ∈ s)] [(y : β) → Decidable (y ∈ t)] (H : LocalEquiv.IsImage e s t) (H' : LocalEquiv.IsImage e' s t) : ↑(LocalEquiv.piecewise e e' s t H H') = Set.piecewise s ↑e ↑e'

@[simp]

theorem LocalEquiv.piecewise_symm_apply {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (s : Set α) (t : Set β) [(x : α) → Decidable (x ∈ s)] [(y : β) → Decidable (y ∈ t)] (H : LocalEquiv.IsImage e s t) (H' : LocalEquiv.IsImage e' s t) : ↑(LocalEquiv.symm (LocalEquiv.piecewise e e' s t H H')) = Set.piecewise t ↑(LocalEquiv.symm e) ↑(LocalEquiv.symm e')

def LocalEquiv.piecewise {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (s : Set α) (t : Set β) [(x : α) → Decidable (x ∈ s)] [(y : β) → Decidable (y ∈ t)] (H : LocalEquiv.IsImage e s t) (H' : LocalEquiv.IsImage e' s t) : LocalEquiv α β

Combine two LocalEquivs using Set.piecewise. The source of the new LocalEquiv is s.ite e.source e'.source = e.source ∩ s ∪ e'.source \ s, and similarly for target. The function sends e.source ∩ s to e.target ∩ t using e and e'.source \ s to e'.target \ t using e', and similarly for the inverse function. The definition assumes e.isImage s t and e'.isImage s t.

Equations

• One or more equations did not get rendered due to their size.

theorem LocalEquiv.symm_piecewise {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) {s : Set α} {t : Set β} [(x : α) → Decidable (x ∈ s)] [(y : β) → Decidable (y ∈ t)] (H : LocalEquiv.IsImage e s t) (H' : LocalEquiv.IsImage e' s t) : LocalEquiv.symm (LocalEquiv.piecewise e e' s t H H') = LocalEquiv.piecewise (LocalEquiv.symm e) (LocalEquiv.symm e') t s (_ : LocalEquiv.IsImage (LocalEquiv.symm e) t s) (_ : LocalEquiv.IsImage (LocalEquiv.symm e') t s)

@[simp]

theorem LocalEquiv.disjointUnion_source {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) [(x : α) → Decidable (x ∈ e.source)] [(y : β) → Decidable (y ∈ e.target)] : (LocalEquiv.disjointUnion e e' hs ht).source = e.source ∪ e'.source

@[simp]

theorem LocalEquiv.disjointUnion_apply {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) [(x : α) → Decidable (x ∈ e.source)] [(y : β) → Decidable (y ∈ e.target)] : ↑(LocalEquiv.disjointUnion e e' hs ht) = Set.piecewise e.source ↑e ↑e'

@[simp]

theorem LocalEquiv.disjointUnion_symm_apply {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) [(x : α) → Decidable (x ∈ e.source)] [(y : β) → Decidable (y ∈ e.target)] : ↑(LocalEquiv.symm (LocalEquiv.disjointUnion e e' hs ht)) = Set.piecewise e.target ↑(LocalEquiv.symm e) ↑(LocalEquiv.symm e')

@[simp]

theorem LocalEquiv.disjointUnion_target {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) [(x : α) → Decidable (x ∈ e.source)] [(y : β) → Decidable (y ∈ e.target)] : (LocalEquiv.disjointUnion e e' hs ht).target = e.target ∪ e'.target

def LocalEquiv.disjointUnion {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) [(x : α) → Decidable (x ∈ e.source)] [(y : β) → Decidable (y ∈ e.target)] : LocalEquiv α β

Combine two LocalEquivs with disjoint sources and disjoint targets. We reuse LocalEquiv.piecewise, then override source and target to ensure better definitional equalities.

Equations

• One or more equations did not get rendered due to their size.

theorem LocalEquiv.disjointUnion_eq_piecewise {α : Type u_1} {β : Type u_2} (e : LocalEquiv α β) (e' : LocalEquiv α β) (hs : Disjoint e.source e'.source) (ht : Disjoint e.target e'.target) [(x : α) → Decidable (x ∈ e.source)] [(y : β) → Decidable (y ∈ e.target)] : LocalEquiv.disjointUnion e e' hs ht = LocalEquiv.piecewise e e' e.source e.target (_ : LocalEquiv.IsImage e e.source e.target) (_ : LocalEquiv.IsImage e' e.source e.target)

@[simp]

theorem LocalEquiv.pi_source {ι : Type u_5} {αi : ι → Type u_6} {βi : ι → Type u_7} (ei : (i : ι) → LocalEquiv (αi i) (βi i)) : (LocalEquiv.pi ei).source = Set.pi Set.univ fun i => (ei i).source

@[simp]

theorem LocalEquiv.pi_target {ι : Type u_5} {αi : ι → Type u_6} {βi : ι → Type u_7} (ei : (i : ι) → LocalEquiv (αi i) (βi i)) : (LocalEquiv.pi ei).target = Set.pi Set.univ fun i => (ei i).target

@[simp]

theorem LocalEquiv.pi_apply {ι : Type u_5} {αi : ι → Type u_6} {βi : ι → Type u_7} (ei : (i : ι) → LocalEquiv (αi i) (βi i)) : ↑(LocalEquiv.pi ei) = fun f i => ↑(ei i) (f i)

def LocalEquiv.pi {ι : Type u_5} {αi : ι → Type u_6} {βi : ι → Type u_7} (ei : (i : ι) → LocalEquiv (αi i) (βi i)) : LocalEquiv ((i : ι) → αi i) ((i : ι) → βi i)

The product of a family of local equivs, as a local equiv on the pi type.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem LocalEquiv.pi_symm {ι : Type u_5} {αi : ι → Type u_6} {βi : ι → Type u_7} (ei : (i : ι) → LocalEquiv (αi i) (βi i)) : LocalEquiv.symm (LocalEquiv.pi ei) = LocalEquiv.pi fun i => LocalEquiv.symm (ei i)

theorem LocalEquiv.pi_symm_apply {ι : Type u_5} {αi : ι → Type u_6} {βi : ι → Type u_7} (ei : (i : ι) → LocalEquiv (αi i) (βi i)) : ↑(LocalEquiv.symm (LocalEquiv.pi ei)) = fun f i => ↑(LocalEquiv.symm (ei i)) (f i)

@[simp]

theorem LocalEquiv.pi_refl {ι : Type u_5} {αi : ι → Type u_6} : (LocalEquiv.pi fun i => LocalEquiv.refl (αi i)) = LocalEquiv.refl ((i : ι) → αi i)

@[simp]

theorem LocalEquiv.pi_trans {ι : Type u_5} {αi : ι → Type u_6} {βi : ι → Type u_7} {γi : ι → Type u_8} (ei : (i : ι) → LocalEquiv (αi i) (βi i)) (ei' : (i : ι) → LocalEquiv (βi i) (γi i)) : LocalEquiv.trans (LocalEquiv.pi ei) (LocalEquiv.pi ei') = LocalEquiv.pi fun i => LocalEquiv.trans (ei i) (ei' i)

@[simp]

theorem Set.BijOn.toLocalEquiv_source {α : Type u_1} {β : Type u_2} [Nonempty α] (f : α → β) (s : Set α) (t : Set β) (hf : Set.BijOn f s t) : (Set.BijOn.toLocalEquiv f s t hf).source = s

@[simp]

theorem Set.BijOn.toLocalEquiv_apply {α : Type u_1} {β : Type u_2} [Nonempty α] (f : α → β) (s : Set α) (t : Set β) (hf : Set.BijOn f s t) : ↑(Set.BijOn.toLocalEquiv f s t hf) = f

@[simp]

theorem Set.BijOn.toLocalEquiv_symm_apply {α : Type u_1} {β : Type u_2} [Nonempty α] (f : α → β) (s : Set α) (t : Set β) (hf : Set.BijOn f s t) : ↑(LocalEquiv.symm (Set.BijOn.toLocalEquiv f s t hf)) = Function.invFunOn f s

@[simp]

theorem Set.BijOn.toLocalEquiv_target {α : Type u_1} {β : Type u_2} [Nonempty α] (f : α → β) (s : Set α) (t : Set β) (hf : Set.BijOn f s t) : (Set.BijOn.toLocalEquiv f s t hf).target = t

noncomputable def Set.BijOn.toLocalEquiv {α : Type u_1} {β : Type u_2} [Nonempty α] (f : α → β) (s : Set α) (t : Set β) (hf : Set.BijOn f s t) : LocalEquiv α β

A bijection between two sets s : Set α and t : Set β provides a local equivalence between α and β.

Equations

• One or more equations did not get rendered due to their size.

noncomputable def Set.InjOn.toLocalEquiv {α : Type u_1} {β : Type u_2} [Nonempty α] (f : α → β) (s : Set α) (hf : Set.InjOn f s) : LocalEquiv α β

A map injective on a subset of its domain provides a local equivalence.

Equations

• Set.InjOn.toLocalEquiv f s hf = Set.BijOn.toLocalEquiv f s (f '' s) (_ : Set.BijOn f s (f '' s))

@[simp]

theorem Equiv.refl_toLocalEquiv {α : Type u_1} : Equiv.toLocalEquiv (Equiv.refl α) = LocalEquiv.refl α

@[simp]

theorem Equiv.symm_toLocalEquiv {α : Type u_1} {β : Type u_2} (e : α ≃ β) : Equiv.toLocalEquiv e.symm = LocalEquiv.symm (Equiv.toLocalEquiv e)

@[simp]

theorem Equiv.trans_toLocalEquiv {α : Type u_1} {β : Type u_2} {γ : Type u_3} (e : α ≃ β) (e' : β ≃ γ) : Equiv.toLocalEquiv (e.trans e') = LocalEquiv.trans (Equiv.toLocalEquiv e) (Equiv.toLocalEquiv e')