Union of Functions Theorem/Corollary
Jump to navigation
Jump to search
Theorem
Let $X$ be a set.
Let $\sequence {X_i: i \in \N}$ be an exhausting sequence of sets on $X$.
For each $i \in \N$, let $g_i: X_i \to Y$ be a mapping such that:
- $g_{i + 1} \restriction X_i = g_i$
where $g_{i + 1} \restriction X_i$ denotes the restriction of $g_{i + 1}$ to $g_i$.
For each $i \in \N$, let $g_i : X_i \to Y$ be invertible.
Then $\ds \bigcup \set {g_i: i \in \N}$ is invertible and:
- $\ds \paren {\bigcup \set {g_i: i \in \N} }^{-1} = \bigcup \set {g_i^{-1}: i \in \N}$
Proof
This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |