Timeline for Riemann rearrangement theorem for $L^1$ functions
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 29, 2021 at 22:42 | vote | accept | Nate River | ||
| Apr 29, 2021 at 21:29 | comment | added | Eric | Thanks for clarifying - neat solution! | |
| Apr 29, 2021 at 19:43 | comment | added | mlk | @Eric Since the positive process takes precedence, $\lambda$ will get close to $0$ after a while, so there will be positive additions even in the interval touched by the negative process. In fact, most of the additions will happen there. And I never claimed or used that $f-f_k$ is monotonic, only that $f$ is and only as a quick way to estimate $\sup_{[\epsilon,1]} f$. | |
| Apr 29, 2021 at 12:52 | comment | added | Eric | $f-f_k$ doesn’t stay monotonic. Your negative processes are all subsets of a neighborhood of 0 while your positive additions are subsets of a neighborhood of 1, so I don’t understand how repeated negatives enable a positive. Are you resorting on each new value? If so, that seems to break your assumptions in the latter part of the proof. | |
| Apr 29, 2021 at 7:10 | history | answered | mlk | CC BY-SA 4.0 |