Derivation of the L∞ limit (from scratch). Let M=maxi∣xi∣. Factor it out:
∥x∥p=(∑i∣xi∣p)1/p=M(∑i(M∣xi∣)p)1/p.
Every ratio M∣xi∣≤1. Say k coordinates equal the max (ratio =1), the rest are <1.
As p→∞, terms with ratio <1 vanish, so the sum →k. Then
∥x∥p→M⋅k1/p→M⋅1=M,
since k1/p→1 for any fixed k. Hence ∥x∥∞=maxi∣xi∣. ∎
Imagine you're at home and your friend lives 3 blocks east and 4 blocks north.
If you walk on streets you go 3 + 4 = 7 blocks. That's the L1 distance.
If you could fly in a straight line it's 5 blocks (the diagonal). That's L2.
If you only care about the longest single stretch, that's 4 (the north part). That's L∞.
Same two friends, three answers — because "how far" depends on how you're allowed to move.
L1's unit ball is a diamond with corners on the axes, so optimal solutions land on axes → coordinates become exactly 0; L2's ball is smooth (a circle) with no corners.
General inequality among norms of the same vector?
∥x∥∞≤∥x∥2≤∥x∥1; larger p gives a smaller-or-equal norm.
Why is L0 not a true norm?
It counts nonzeros but violates homogeneity: ∥2x∥0=∥x∥0=2∥x∥0.
Derive ∥x∥∞=maxi∣xi∣.
Factor M=max∣xi∣: ∥x∥p=M(∑(∣xi∣/M)p)1/p; ratios <1 vanish as p→∞, leaving M⋅k1/p→M.
Dekho, norm ka matlab simple hai: "yeh vector kitna bada hai?" Lekin "bada" ka matlab
depend karta hai ki aap distance kaise naapte ho. L1 (Manhattan) matlab city ke blocks mein
chalke jaana — saare coordinates ke absolute values add kar do. L2 (Euclidean) matlab seedha
diagonal udd ke jaana — Pythagoras wala x12+x22. L∞ matlab sirf sabse bada single
coordinate uthao, baaki ignore. Example (3,−4): L1 = 7, L2 = 5, L∞ = 4. Notice karo — jitna bada
p, utni chhoti norm.
General formula ek hi hai: ∥x∥p=(∑∣xi∣p)1/p, aur p→∞ karne se woh max ban
jaata hai (note mein full derivation hai). Yaad rakho — power lagao, sum karo, root lagao; root isliye
taaki units theek rahein.
ML mein yeh kyun important hai? Lasso = L1, Ridge = L2. L1 ka unit ball ek diamond hota hai
jiske corners axes pe baithe hote hain — isliye solution axis pe land karta hai aur kuch weights
bilkul zero ho jaate hain (sparsity!). L2 ka ball smooth circle hai, koi corner nahi, isliye
weights chhote hote hain par exactly zero nahi. k-NN mein bhi aap decide karte ho Manhattan ya
Euclidean distance — woh bhi yahi norm choice hai.
Ek common galti: L0 ko "norm" mat samjho — woh sirf non-zero count karta hai aur homogeneity todta
hai, isliye woh pseudo-norm hai. Aur p<1 pe triangle inequality fail ho jaati hai, toh valid norm
ke liye hamesha p≥1 chahiye.