统计学习精要 (Elements of Statistical Learning ) 习题 2.1

统计学习精要（Elements of Statistical Learning） 习题2.1

问题：
Suppose that each of K classes has an associated target $t_k$, which is a vector of all zeroes, except a one in the k-th position. Show that classifying the largest element of $\hat{y}$ amounts to choosing the closest target, $\min_k \|t_k − \hat{y}\|$ if the elements of $\hat{y}$ sum to one.

假设我们有一个K分类问题，每个类表示为向量$t_k$。$t_k$中除了第k个位置的元素为1外，其余元素均为0。证明如果