A symmetric bilinear form on a vector space V over a field F is a bilinear map B: V × V → F that satisfies B(u,v) = B(v,u) for all u,v ∈ V.

Principle

Symmetry imposes that the bilinear pairing does not distinguish argument order; in coordinates such a form is represented by a symmetric matrix and defines quadratic forms x ↦ B(x,x).

Demonstration

On R^n the standard dot product B(u,v) = u^T v is a symmetric bilinear form; its matrix is the identity, and B(x,x) = ||x||^2 gives the associated quadratic form.

Misapplication

Assuming every symmetric bilinear form is an inner product: a symmetric form may be degenerate or indefinite (not positive definite), so it need not induce a norm.

Consequence

A nondegenerate symmetric bilinear form gives an isomorphism V → V* and allows orthogonal decompositions; a positive-definite one endows V with Euclidean/Hilbert geometry (when complete).

Reversal

A skew-symmetric (alternating) bilinear form satisfies B(u,v) = −B(v,u) and in characteristic ≠ 2 has zeros on diagonal, leading to different invariants (e.g., symplectic structure) than symmetric forms.

Boundary

Definition depends on field characteristic: in characteristic 2 symmetry and skew-symmetry coincide for bilinear forms, so separate handling is required; over general rings module-theoretic complications arise.

Semantic Tension

Symmetric versus Hermitian forms: over complex fields Hermitian forms satisfy B(u,v)=overline{B(v,u)} and are the relevant inner-product generalization; calling a complex symmetric bilinear form an inner product is a category error.

Synthesis

A symmetric bilinear form is a two-argument linear pairing equal under exchange of arguments, represented by a symmetric matrix, generating quadratic forms and, when nondegenerate and positive, the geometric structure of inner-product spaces.