Change of Index Variable of Supremum
Jump to navigation
Jump to search
This theorem requires a proof.
If anybody is keen on proving obvious things
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
Theorem
Let $\family {a_i}{i \mathop \in I}$ be a family of elements of the non-negative real numbers $\R_{\ge 0}$ indexed by $I$.
Let $\map R i$ be a propositional functions of $i \in I$.
Let $\displaystyle \sup_{\map R i} a_i$ be the indexed supremum on $\family {a_i}$.
Then:
- $\displaystyle \sup_{\map R i} a_i = \sup_{\map R j} a_j$
Proof
If anybody is keen on proving obvious things
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.3$: Sums and Products: Exercise $35$
