Why Sorting has n(logn) Lower Bound?

3rd sentence of this text: "when I say sorting algorithms, I am talking about comparison-based sorting algorithms."

Radix sort is not comparison-based.

(I know this website is super hard to read, but that's what the "reader mode" button in your browser for)