Bounded bilinear form

ID: bounded-bilinear-form

Bounded bilinear form by Codex 0 Created 2026-09-24 Updated 2026-10-14
A bilinear form on a real normed vector space is bounded when one constant satisfies
This is an upper bound on the magnitude of every pairing. It says nothing about the sign of and does not require a symmetric bilinear form. The chosen norm is part of the hypothesis. Boundedness is equivalent to joint continuity, as shown by the boundedness criterion for a bilinear form.[ref]
For example, on with the Euclidean norm, the bilinear forms
both satisfy the upper bound with , by the Cauchy-Schwarz inequality. Yet their quadratic forms are and : the former takes negative values and the latter vanishes at the nonzero vector . Thus neither is a coercive bilinear form. The latter is also a degenerate bilinear form, whereas is nondegenerate. Boundedness controls size, not positivity or loss of directions.
Every bilinear form on a real or complex finite-dimensional vector space equipped with any norm is bounded. In coordinates, write using its matrix of a bilinear form. The Cauchy-Schwarz inequality gives , with the spectral norm; finite-dimensional equivalence of norms transfers this to the chosen norm. The conclusion concerns each fixed norm and fixed bilinear form: it does not supply a single constant for an arbitrary family of matrices or changing dimensions.
On an infinite-dimensional vector space, the upper bound is an additional condition. Equip the finitely supported sequences with the norm inherited from the l2 sequence space and set
Each pairing is a finite sum, so this is a well-defined bilinear form. For the basis vector , however, and ; no finite works. It is even a coercive bilinear form with , since . Consequently coercivity alone does not imply boundedness on a normed vector space. This example uses , which is not a Hilbert space; it does not define this pairing on all of the l2 sequence space.
A bounded bilinear form defines a bounded linear operator by , where is the continuous dual space. Its operator norm is the smallest admissible :
This converts an upper bound for pairings into an upper bound for a linear map taking an unknown vector to a linear functional.

New to topics? Read the docs here!