Timeline for Subadditivity of the square root for matrices
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
Jan 23, 2015 at 21:06 | comment | added | Suvrit | @GottfriedHelms: Yes, for commuting matrices, the question will boil down to $|a^r - b^r| \le |a-b|^r$ for $a,b \ge 0$. | |
Jan 23, 2015 at 18:00 | comment | added | Gottfried Helms | Could the OP's statement be true for commuting matrices? (I guess so) | |
Jan 19, 2015 at 20:42 | vote | accept | Mateusz Wasilewski | ||
Jan 17, 2015 at 14:45 | comment | added | Suvrit | @MateuszWasilewski: Lower bounds on $\sigma_n$ are just too useful to be easily had :-) --- even the majorization result that I cited was quite nontrivial and took a few years of effort to get proved! | |
Jan 17, 2015 at 14:21 | comment | added | Mateusz Wasilewski | Suvrit, thank you for this counterexample. Unfortunately, this weak majorization would not be useful for the application that I have in mind. | |
Jan 17, 2015 at 13:10 | history | edited | Suvrit | CC BY-SA 3.0 |
added explicit example and more detailed citation to result that holds.
|
Jan 16, 2015 at 22:39 | history | answered | Suvrit | CC BY-SA 3.0 |