How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Dual Spaces and Bilinear Forms: Examples and Counterexamples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A dual basis and transpose computed for a linear map on
Example
Let be the standard basis of , with dual basis , and let
Then , , and
Facts & Assumptions
Given: The displayed matrix in the standard basis over .
Since is prime, is a field (For every prime , the two operations on make it a field).
The coordinate functionals form the dual basis (The dual family of a finite basis is a basis of the dual space, with the same dimension).
In dual bases, the matrix of is the transpose of that of (In dual bases, the matrix of is the transpose of the matrix of ).
Verification
The matrix columns give and . Therefore takes values on , while takes values .
By the dual-basis expansion [L2], these four values give and .
The coordinate columns in step 2.1 give , which independently agrees with [L3].
The annihilator of the coordinate plane in is the line spanned by the third coordinate functional
Example
For ,
Facts & Assumptions
Given: The coordinate plane and coordinate functionals .
The annihilator consists of the functionals that vanish on every vector of (The annihilator of and the preannihilator of ).
In finite dimension, (Assuming choice, ; in finite dimension, ).
The three standard coordinate vectors form a basis of (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
Verification
By [L3], a general functional is . If , evaluation at and gives .
Conversely every vanishes on , so [L1] gives .
As a check, and [L2] gives , agreeing with step 1.2.
For the polynomial space , the canonical map to the algebraic double dual is injective but not surjective
Example
Assume the axiom of choice. For the polynomial vector space , the canonical map is injective but not surjective.
Facts & Assumptions
Given: The axiom of choice and a field .
A polynomial over is a coefficient sequence with finite support (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution).
Under Choice, the canonical map is onto exactly in finite dimension and is always injective (Assuming choice, is surjective if and only if is finite-dimensional).
The coordinate functionals of an infinite Hamel basis span a proper subspace of the dual (For an infinite Hamel basis, its dual family is linearly independent but does not span the algebraic dual), and a vector outside a subspace can be separated from it by a functional (Assuming choice, if , some vanishes on and satisfies ).
Verification
By [L1], the monomials form an infinite Hamel basis. Let extract the coefficient of , and put . Define ; finite support makes this a functional. Every member of vanishes on all but finitely many monomials, whereas for every , so .
Apply the separation statement in [L3] inside to choose with and . If , then for every , so all coefficients of vanish and ; this would give , contradicting .
Thus is outside the image, while injectivity follows from [L2]. This explicitly realizes the finite-dimensional boundary in [L2].
In infinite dimension, distinct subspaces of can have the same preannihilator
Statement refuted
Refuted claim: Distinct subspaces of an algebraic dual always have distinct preannihilators.
Facts & Assumptions
Given: The axiom of choice, an infinite-dimensional vector space , an infinite Hamel basis , and .
The preannihilator consists of vectors killed by every functional in (The annihilator of and the preannihilator of ).
For an infinite Hamel basis, the span of its coordinate functionals is a proper subspace of (For an infinite Hamel basis, its dual family is linearly independent but does not span the algebraic dual).
Assuming choice, every nonzero vector is detected by some linear functional (Assuming choice, if , some vanishes on and satisfies , with the zero subspace).
Counterexample
If , some coordinate of its finite basis expansion is nonzero, so the corresponding does not kill . Hence [L1] gives .
By [L3], every nonzero is detected by some member of , so .
Yet [L2] gives , while steps 1.1 and 1.2 give equal preannihilators. These are the required distinct subspaces.
The form on with matrix is neither symmetric nor alternating
Example
On , let have matrix in the standard basis. Then is neither symmetric nor alternating.
Facts & Assumptions
Given: The displayed matrix and standard basis .
A matrix represents the form by (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).
Symmetry requires , while alternation requires for every (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms).
Verification
By [L1], but , so symmetry fails by [L2].
Also , so alternation fails by [L2].
The same form therefore witnesses both failures.
has inertia
Example
The real quadratic form
satisfies and has inertia .
Facts & Assumptions
Given: The displayed real quadratic form, whose symmetric matrix is .
Quadratic forms over characteristic not admit diagonal coordinates (Over a field of characteristic not , every quadratic form has diagonal coordinates ).
The counts of positive, negative, and zero diagonal entries give the unique inertia (Sylvester's law of inertia: every real symmetric form is congruent to , and is unique).
Verification
Expanding gives . With , , old coordinates are , so is invertible.
Direct multiplication gives . Both diagonal entries are positive, and positive rescaling changes this matrix to .
By [L2], the inertia is , in agreement with the diagonalization promised by [L1].
A rank-two alternating form on has one symplectic pair and a one-dimensional radical
Example
On , the form with matrix
has the symplectic pair , radical , and rank .
Facts & Assumptions
Given: The displayed matrix in the standard basis.
The standard coordinate vectors form a basis of (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ).
An alternating form has a basis of symplectic pairs followed by a radical basis, with two rank units per pair (Every alternating form on a finite-dimensional space has a basis of symplectic pairs followed by a basis of its radical; in particular its rank is even).
Verification
The matrix has zero diagonal and is skew-symmetric, so by direct expansion. Also and .
Multiplication by kills exactly the vectors , so the radical is ; the first two columns are independent, giving rank .
Thus is one symplectic pair followed by the radical basis , exactly the normal form of [L2].
In characteristic , a symmetric bilinear form need not have an orthogonal basis
Statement refuted
Refuted claim: Every symmetric bilinear form over every field has an orthogonal basis.
Facts & Assumptions
Given: Over , let on have matrix .
The ring is a field of characteristic (For every prime , the two operations on make it a field).
In characteristic , alternating forms are symmetric (Alternating forms are skew-symmetric; the converse holds when , while in characteristic alternating forms are symmetric).
A finite-dimensional bilinear form is nondegenerate exactly when its representing matrix is invertible (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).
Counterexample
For , , so is alternating and hence symmetric by [L1] and [L2]. Its matrix has determinant in , so it is nondegenerate by [L3].
If were an orthogonal basis, alternation would give and orthogonality would give . The matrix in that basis would be zero, contradicting nondegeneracy.
Thus this symmetric form has no orthogonal basis, and the characteristic-not- hypothesis in the diagonalization theorem is essential.
In characteristic , distinct quadratic forms can have the same polar form
Statement refuted
Refuted claim: A quadratic form is determined by its polar form in every characteristic.
Facts & Assumptions
Given: On , define and .
The ring is a field of characteristic (For every prime , the two operations on make it a field).
A quadratic form has and bilinear polar form (A quadratic form in arbitrary characteristic and its polar form ).
Counterexample
Both and have the required degree-two homogeneity. The polar form of is zero, while for and , by [L1]. Thus both are quadratic forms with zero polar form.
They are distinct because while .
Hence polarization is not injective in characteristic .
Positive determinant does not imply positive definiteness
Statement refuted
Refuted claim: Every real symmetric matrix with positive determinant is positive definite.
Facts & Assumptions
Given: The real diagonal matrix .
Positive definiteness requires for every nonzero , and the signs of a diagonal form give its inertia (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
The determinant is the signed Leibniz sum, which for a diagonal matrix reduces to the product of its diagonal entries (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
Counterexample
By [L2], .
But , so [L1] shows that is not positive definite. Its inertia is .
Thus a positive determinant alone does not imply positive definiteness.
Sylvester's criterion verifies positive definiteness for a concrete symmetric matrix
Example
The symmetric matrix
is positive definite.
Facts & Assumptions
Given: The displayed real symmetric matrix .
A real symmetric matrix is positive definite exactly when all of its leading principal minors are positive (Sylvester's criterion: a real symmetric matrix with is positive definite if and only if all leading principal minors are positive).
Verification
The leading principal minors are , , and . All three are positive.
Independently, for , one has , because the three squared linear forms vanish simultaneously only at .
Hence [L1] proves that is positive definite.
Both calculations agree, and each boundary minor has been evaluated explicitly.
Congruence need not preserve trace or determinant: the real matrices and are congruent
Statement refuted
Refuted claim: Matrix congruence preserves trace or determinant.
Facts & Assumptions
Given: The real matrices , , and .
Congruence has the form with invertible (A basis change by changes the matrix of a bilinear form from to ).
Congruence does preserve rank and nondegeneracy (Congruent matrices have the same rank; hence rank and nondegeneracy of a bilinear form are basis-independent).
Trace is the sum of diagonal entries (The trace as the sum of the diagonal entries), and determinant is the signed Leibniz sum (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
Counterexample
Since and is invertible, [L1] makes and congruent.
By [L3], , , , and . Thus neither trace nor determinant is preserved.
Both matrices nevertheless have rank and are nondegenerate, in agreement with [L2]; the counterexample isolates exactly the two false invariance claims.
Sources
Standard references
Recommended treatments; not extraction sources.