Alphabeta Math
Session-authored (Fable 5 assisted)
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.

12 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Dual Spaces and Bilinear Forms: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-13Open item page →

A dual basis and transpose computed for a linear map on F32

Example

Let e1,e2 be the standard basis of F32, with dual basis ε1,ε2, and let

[T]=(1201).

Then T(ε1)=ε1+2ε2, T(ε2)=ε2, and

[T]=(1021)=[T]T.

Facts & Assumptions

Given: The displayed matrix in the standard basis over F3.

[L1]

Since 3 is prime, F3=Z/3Z is a field (For every prime p, the two operations on Z/p make it a field).

[L3]

In dual bases, the matrix of T is the transpose of that of T (In dual bases, the matrix of T is the transpose of the matrix of T).

Verification

technique · exhaustive coordinate evaluation
1.1

The matrix columns give T(e1)=e1 and T(e2)=2e1+e2. Therefore T(ε1) takes values 1,2 on e1,e2, while T(ε2) takes values 0,1.

L1L2algebra
2.1

By the dual-basis expansion [L2], these four values give T(ε1)=ε1+2ε2 and T(ε2)=ε2.

step 1.1L2
3.1

The coordinate columns in step 2.1 give [T]=(1021), which independently agrees with [L3].

step 2.1L3
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The annihilator of the coordinate plane z=0 in R3 is the line spanned by the third coordinate functional

Example

For U={(x,y,0):x,yR}R3,

U=span{z},z(x,y,z)=z.

Facts & Assumptions

Given: The coordinate plane U and coordinate functionals x,y,z.

[L1]

The annihilator U consists of the functionals that vanish on every vector of U (The annihilator UV of UV and the preannihilator SV of SV).

[L2]

Verification

technique · direct coordinate computation
1.1

By [L3], a general functional is f=ax+by+cz. If fU, evaluation at (1,0,0) and (0,1,0) gives a=b=0.

L1L3algebra
1.2

Conversely every cz vanishes on (x,y,0), so [L1] gives U=span{z}.

L1algebra
2.1

As a check, dimU=2 and [L2] gives dimU=32=1, agreeing with step 1.2.

step 1.2L2L3
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

For the polynomial space F[x], the canonical map to the algebraic double dual is injective but not surjective

Example

Assume the axiom of choice. For the polynomial vector space V=F[x], the canonical map JV:VV is injective but not surjective.

Facts & Assumptions

Given: The axiom of choice and a field F.

[L1]

A polynomial over F is a coefficient sequence with finite support (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution).

[L2]

Under Choice, the canonical map is onto exactly in finite dimension and is always injective (Assuming choice, JV:VV is surjective if and only if V is finite-dimensional).

[L3]

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 vUV, some fV vanishes on U and satisfies f(v)=1).

Verification

technique · explicit double-dual witness
1.1

By [L1], the monomials 1,x,x2, form an infinite Hamel basis. Let δn extract the coefficient of xn, and put Φ=span{δn:n0}. Define ϕ(nanxn)=nan; finite support makes this a functional. Every member of Φ vanishes on all but finitely many monomials, whereas ϕ(xn)=1 for every n, so ϕΦ.

L1L3algebra
2.1

Apply the separation statement in [L3] inside V to choose LV with LΦ=0 and L(ϕ)=1. If L=JV(p), then 0=L(δn)=δn(p) for every n, so all coefficients of p vanish and p=0; this would give L=0, contradicting L(ϕ)=1.

step 1.1L3choose
3.1

Thus L is outside the image, while injectivity follows from [L2]. This explicitly realizes the finite-dimensional boundary in [L2].

step 2.1L2
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

In infinite dimension, distinct subspaces of V 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 V, an infinite Hamel basis B, and Φ=span{b:bB}V.

[L1]

The preannihilator S consists of vectors killed by every functional in S (The annihilator UV of UV and the preannihilator SV of SV).

[L2]

For an infinite Hamel basis, the span Φ of its coordinate functionals is a proper subspace of V (For an infinite Hamel basis, its dual family is linearly independent but does not span the algebraic dual).

[L3]

Assuming choice, every nonzero vector is detected by some linear functional (Assuming choice, if vUV, some fV vanishes on U and satisfies f(v)=1, with the zero subspace).

Counterexample

technique · explicit subspaces
1.1

If v0, some coordinate of its finite basis expansion is nonzero, so the corresponding bΦ does not kill v. Hence [L1] gives Φ={0}.

L1givenalgebra
1.2

By [L3], every nonzero v is detected by some member of V, so (V)={0}.

L1L3
2.1

Yet [L2] gives ΦV, while steps 1.1 and 1.2 give equal preannihilators. These are the required distinct subspaces.

step 1.1step 1.2L2
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13Open item page →

The form on R2 with matrix (0100) is neither symmetric nor alternating

Example

On R2, let B have matrix A=(0100) in the standard basis. Then B is neither symmetric nor alternating.

Facts & Assumptions

Given: The displayed matrix and standard basis e1,e2.

[L2]

Symmetry requires B(u,v)=B(v,u), while alternation requires B(v,v)=0 for every v (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms).

Verification

technique · direct evaluation
1.1

By [L1], B(e1,e2)=1 but B(e2,e1)=0, so symmetry fails by [L2].

L1L2algebra
1.2

Also B(e1+e2,e1+e2)=1, so alternation fails by [L2].

L1L2algebra
2.1

The same form therefore witnesses both failures.

step 1.1step 1.2
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-13Open item page →

q(x,y)=2x2+4xy+5y2=2(x+y)2+3y2 has inertia (2,0,0)

Example

The real quadratic form

q(x,y)=2x2+4xy+5y2

satisfies q(x,y)=2(x+y)2+3y2 and has inertia (2,0,0).

Facts & Assumptions

Given: The displayed real quadratic form, whose symmetric matrix is A=(2225).

Verification

technique · explicit congruence and expansion
1.1

Expanding gives 2(x+y)2+3y2=2x2+4xy+5y2=q(x,y). With u=x+y, v=y, old coordinates are (x,y)=(uv,v), so P=(1101) is invertible.

algebra
2.1

Direct multiplication gives PTAP=(2003). Both diagonal entries are positive, and positive rescaling changes this matrix to I2.

step 1.1algebra
3.1

By [L2], the inertia is (2,0,0), in agreement with the diagonalization promised by [L1].

step 2.1L1L2
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

A rank-two alternating form on R3 has one symplectic pair and a one-dimensional radical

Example

On R3, the form with matrix

A=(010100000)

has the symplectic pair (e1,e2), radical span{e3}, and rank 2.

Verification

technique · direct matrix inspection
1.1

The matrix has zero diagonal and is skew-symmetric, so B(v,v)=0 by direct expansion. Also B(e1,e2)=1 and B(e2,e1)=1.

L1algebra
1.2

Multiplication by A kills exactly the vectors (0,0,z), so the radical is span{e3}; the first two columns are independent, giving rank 2.

L1algebra
2.1

Thus (e1,e2) is one symplectic pair followed by the radical basis (e3), exactly the normal form of [L2].

step 1.1step 1.2L2
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

In characteristic 2, 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 F2, let B on F22 have matrix A=(0110).

[L1]

The ring F2 is a field of characteristic 2 (For every prime p, the two operations on Z/p make it a field).

[L3]

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

technique · contradiction from the displayed form
1.1

For v=(x,y), B(v,v)=xy+yx=2xy=0, so B is alternating and hence symmetric by [L1] and [L2]. Its matrix has determinant 1=1 in F2, so it is nondegenerate by [L3].

L1L2L3algebra
2.1

If (u,v) were an orthogonal basis, alternation would give B(u,u)=B(v,v)=0 and orthogonality would give B(u,v)=B(v,u)=0. The matrix in that basis would be zero, contradicting nondegeneracy.

step 1.1L3algebra
3.1

Thus this symmetric form has no orthogonal basis, and the characteristic-not-2 hypothesis in the diagonalization theorem is essential.

step 2.1
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

In characteristic 2, 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 F22, define q0(x,y)=0 and q1(x,y)=x2.

[L1]

The ring F2 is a field of characteristic 2 (For every prime p, the two operations on Z/p make it a field).

[L2]

A quadratic form has q(av)=a2q(v) and bilinear polar form bq(u,v)=q(u+v)q(u)q(v) (A quadratic form q in arbitrary characteristic and its polar form bq(u,v)=q(u+v)q(u)q(v)).

Counterexample

technique · direct computation
1.1

Both q0 and q1 have the required degree-two homogeneity. The polar form of q0 is zero, while for u=(x,y) and v=(s,t), bq1(u,v)=(x+s)2x2s2=2xs=0 by [L1]. Thus both are quadratic forms with zero polar form.

L1L2algebra
1.2

They are distinct because q0(1,0)=0 while q1(1,0)=1.

givenalgebra
2.1

Hence polarization is not injective in characteristic 2.

step 1.1step 1.2
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

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 A=diag(1,1,1).

[L1]

Positive definiteness requires vTAv>0 for every nonzero v, and the signs of a diagonal form give its inertia (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature pq of a real symmetric bilinear or quadratic form).

[L2]

The determinant is the signed Leibniz sum, which for a diagonal matrix reduces to the product of its diagonal entries (For n1, the determinant over a commutative ring by the Leibniz formula, and detA for a real matrix).

Counterexample

technique · direct computation
1.1

By [L2], detA=(1)(1)(1)=1>0.

L2algebra
1.2

But e1TAe1=1<0, so [L1] shows that A is not positive definite. Its inertia is (1,2,0).

L1algebra
2.1

Thus a positive determinant alone does not imply positive definiteness.

step 1.1step 1.2
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13Open item page →

Sylvester's criterion verifies positive definiteness for a concrete symmetric 3×3 matrix

Example

The symmetric matrix

A=(210121012)

is positive definite.

Facts & Assumptions

Given: The displayed real symmetric matrix A.

[L1]

A real symmetric matrix is positive definite exactly when all of its leading principal minors are positive (Sylvester's criterion: a real symmetric n×n matrix with n1 is positive definite if and only if all leading principal minors are positive).

Verification

technique · determinant computation with an independent square completion
1.1

The leading principal minors are Δ1=2, Δ2=det(2112)=3, and Δ3=2(41)(2)=4. All three are positive.

algebra
1.2

Independently, for (x,y,z)0, one has (xyz)A(xyz)=2(x+y2)2+32(y+2z3)2+43z2>0, because the three squared linear forms vanish simultaneously only at (0,0,0).

algebra
2.1

Hence [L1] proves that A is positive definite.

step 1.1L1
3.1

Both calculations agree, and each boundary minor k=1,2,3 has been evaluated explicitly.

step 1.1step 2.1step 1.2
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-13Open item page →

Congruence need not preserve trace or determinant: the real 1×1 matrices [1] and [4] are congruent

Statement refuted

Refuted claim: Matrix congruence preserves trace or determinant.

Facts & Assumptions

Given: The real 1×1 matrices A=[1], C=[4], and P=[2].

[L1]

Congruence has the form C=PTAP with P invertible (A basis change by P changes the matrix of a bilinear form from A to PTAP).

Counterexample

technique · direct $1\times1$ computation
1.1

Since PTAP=[2][1][2]=[4]=C and P is invertible, [L1] makes A and C congruent.

L1algebra
1.2

By [L3], trA=1, trC=4, detA=1, and detC=4. Thus neither trace nor determinant is preserved.

L3algebra
2.1

Both matrices nevertheless have rank 1 and are nondegenerate, in agreement with [L2]; the counterexample isolates exactly the two false invariance claims.

step 1.1step 1.2L2

Sources