Is this lower bound proof for the comparison-based sorting problem correct?

Here is a lower bound proof for the comparison-based sorting problem:

• Any comparison-based sorting algorithm can be considered to work by putting elements into their final positions one by one (Take the last time one element is put into its final position.).
• To put the element $e$ which is the $i$-th one being put into its final position, the algorithms should know the relative ordering between $e$ and the first $n-1$ elements that are already put into their final positions. This costs at least $\Omega(\lg i)$ comparisons.
• Therefore, the total number of comparisons is at least $$\sum_{i=1}^{n-1} \lg i = \Omega(n \lg n).$$

Is this a reasonable proof? (I am quite confused about the second step.) If so, how to formalize it more rigorously?

• Doesn't seem rigorous at all. Essentially, you're saying that binary selection sort requires $\Omega(n\log n)$ comparisons, so every comparison-based sorting algorithm must. Mar 29, 2018 at 18:53
• By the way, I assume you mean "the first $i-1$ elements" in bullet 2. Mar 29, 2018 at 18:53

No, I don't think it's a reasonable proof. This makes claims without justification. For instance, the second bullet says that the only way to put an element into its final position is (the algorithm must know something..). How do you know that is correct? How would you prove that? What does it even mean for an algorithm to know something? Why does knowing that cost at least $\Omega(\lg i)$ comparisons? All of that seems a bit unclear to me, so I don't find it a persuasive proof.