A
self-adjoint operator A:H\to H, where H is a real
Hilbert space, is called
coercive if there exists a constant c>0 such that \langle Ax, x\rangle \ge c\|x\|^2 for all x in H. A
bilinear form a:H\times H\to \mathbb R is called
coercive if there exists a constant c>0 such that a(x, x)\ge c\|x\|^2 for all x in H. It follows from the
Riesz representation theorem that any symmetric (defined as a(x, y)=a(y, x) for all x, y in H), continuous (|a(x, y)|\le k\|x\|\,\|y\| for all x, y in H and some constant k>0) and coercive bilinear form a has the representation a(x, y)=\langle Ax, y\rangle for some self-adjoint operator A:H\to H, which then turns out to be a coercive operator. Also, given a coercive self-adjoint operator A, the bilinear form a defined as above is coercive. If A:H\to H is a coercive operator then it is a coercive mapping (in the sense of coercivity of a vector field, where one has to replace the dot product with the more general inner product). Indeed, \langle Ax, x\rangle \ge C\|x\| for big \|x\| (if \|x\| is bounded, then it readily follows); then replacing x by x\|x\|^{-2} we get that A is a coercive operator. One can also show that the converse holds true if A is self-adjoint. The definitions of coercivity for vector fields, operators, and bilinear forms are closely related and compatible. ==Norm-coercive mappings==