Search
All Simple Functions can be Written in Standard Form
Last updated
Nov 1, 2022
# Statement
Let ϕ:X→Cn be a Simple Function
Simple Function
Definition
Let ϕ:X→Cn be a for some X and n∈N. Then ϕ is...
11/7/2022
. Let F=ϕ(X) (which is a Finite Set). Let Ai=ϕ−1(ai)⊂X:ai∈F. Then Ai Partition
Partition
Definition
Let X be a . A S⊂P(X) of X is a collection of subsets of...
11/7/2022
s X and we can write
ϕ=i=1∑∣F∣ai1Ai
# Proof
To establish that Ai partitions X, we show that
- the collection is Mutually Disjoint
Mutually Disjoint
Definition
Let {Ai}i∈I be a collectio of s indexe by I. We say {Ai}i∈I is if...
11/7/2022
. - the union
Set Union
Definition 1
Let A, B be s. Then A∪B:={x:x∈A∨x∈B}.
Proof...
11/7/2022
of the collection is X.
This is all we need to show since Ai⊂P(X) by construction. To see (1) observe that for i,j∈[∣F∣] s.t. i=j we have that
Ai∩Aj=ϕ−1(ai)∩ϕ−1(aj)=ϕ−1(ai∩aj)=ϕ−1(∅)=∅
TODO
# Other Outlinks
# Encounters
- Caliu - Deep Learning Architectures - Appendix, unknown page
- Folland - Real Analysis - Ch 2, unknown page