Coercivity vs boundedness of operator The definition of coercivity and boundedness of a linear operator $L$ between two $B$ spaces looks similar: $\lVert Lx\lVert\geq M_1\lVert x\rVert$ and $\lVert Lx\rVert\leq M_2\lVert x\rVert$ for some constants $M_1$ and $M_2$. Thus in order to show the existence of a PDE $Lu=f$ one needs to show that it is coercive. However if my operator $L$ happen to be bounded and $M_2 \leq M_1$?
What is the intuition behind those two concepts because they are based on computation of the same quantities and comparing the two?

With boundedness everything is clear, because it is well known that linear operator $L$ is continuous iff $L$ is bounded. With continuity of $L$ you can solve the equation with sequential approximations. Moreover, you can apply the whole theory developed for continuous functions and, in particular, for continuous linear operators. Since continuity is very natural condition when solving differential equations, we require $L$ to be bounded.
As for the coercivity, note that it, in particular, implies injectivity. Injectivity guarantees us uniqueness of the solution $u$ of the equation $Lu=f$. But when you are solving such an equation, it is desirable that solution depends on right hand side $f$ continuously. Well, this property depends on $L$, and it is sufficient to require coercivity of $L$. Speaking functional-analytically bounded coercive operator perform linear homeomorphism between domain and its range. Hence there is a "nice" correspondence between initial data $f$ and solution $u$.
