Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

A null normal admits no reflection of the displayed form

Example

Let B be a symmetric bilinear form on a real vector space V and let a∈V with a≠0 and B(a,a)=0. Then a∈ker⁡B(−,a), and there is no linear map r:V→V with r2=idV, r(a)=−a and r(v)=v for every v∈ker⁡B(−,a): since a∈ker⁡B(−,a), such an r would satisfy r(a)=a, forcing −a=a and hence 2a=0, contrary to a≠0 in a real vector space (The reals form a totally ordered field). In particular the displayed formula ra(v)=v−2B(v,a)B(a,a)a of The real Coxeter form, its radical, reflections, and form-preserving maps cannot be extended to normals with B(a,a)=0: the hypothesis B(a,a)≠0 is not merely a convenience of the division. For the two instantiations in R2 below, label the coordinates by 1,2: if x is the function on {0,1} of The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, write x1:=x(0), x2:=x(1), and let e1,e2 denote the unit vectors at 0,1, respectively (The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0). The instantiations are:

(i) Lorentzian plane B(x,y)=x1y1−x2y2 and a=e1+e2: B(a,a)=0, while ker⁡B(−,a)=R(e1+e2)∋a; here a∉rad⁡(B), since B(e1,a)=1≠0 (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).

(ii) Radical plane B(x,y)=x1y1 and a=e2: B(a,a)=0 and ker⁡B(−,a)=V, because e2 lies in the radical; in this case the only map fixing ker⁡B(−,a)=V pointwise is the identity, which does not send a to −a.

Facts & Assumptions

Given: a real vector space V, a symmetric bilinear form B on V, and a∈V with a≠0 and B(a,a)=0.

[F1]

A bilinear form on V is a function V×V→R linear in each variable separately, and it is symmetric when B(u,v)=B(v,u) for all u,v∈V; the set ker⁡B(−,a)={v∈V:B(v,a)=0} is the kernel of the linear functional v↦B(v,a) (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms, Kernel and image of a linear map, Linear map between vector spaces over the same field).

[F2]

In any vector space over a field, λv=0V forces λ=0F or v=0V; and in the totally ordered field R one has 1>0, so 2=1+1>0 and in particular 2≠0 (In any vector space 0Fv=0V, λ0V=0V, (−λ)v=−(λv), (−1F)v=−v, and λv=0V forces λ=0F or v=0V, The reals form a totally ordered field).

[F3]

The displayed reflection formula ra(v)=v−2B(v,a)B(a,a)a of the Statement is defined only for B(a,a)≠0; the symbol ra is not defined when B(a,a)=0 (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F4]

The left radical is rad⁡L(B)={u:B(u,v)=0 for every v∈V}, and when B is symmetric u lies in it exactly when the functional B(−,u) is the zero functional (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).

Verification

1.1givenF1

The hypothesis B(a,a)=0 says exactly that the value of the functional v↦B(v,a) at v=a is zero, so a∈ker⁡B(−,a).

1.2givenF1F2algebra

Suppose r:V→V were linear with r2=idV, r(a)=−a and r(v)=v for every v∈ker⁡B(−,a). Since B(a,a)=0 gives a∈ker⁡B(−,a), the fixed-kernel clause would give r(a)=a, while the normal clause gives r(a)=−a; hence −a=a, that is 2a=0. Since a≠0, [F2] forces 2=0 in R, contradicting 2≠0; therefore no such r exists, and with a null normal the three displayed requirements are already inconsistent before any question of a formula arises.

1.3givenF1F4F5algebra

Lorentzian instantiation. Take V=R2 with basis e1,e2 and B(x,y)=x1y1−x2y2, so that B(e1,e1)=1, B(e2,e2)=−1 and B(e1,e2)=0; let a=e1+e2. Bilinearity gives B(a,a)=B(e1,e1)+2B(e1,e2)+B(e2,e2)=1−1=0, and B(x,a)=x1−x2, so ker⁡B(−,a)={x:x1=x2}=R(e1+e2)∋a. Here a is not in the radical: B(e1,a)=1≠0, so B(−,a) is not the zero functional. Thus this a satisfies the general hypotheses with a nonzero functional B(−,a).

1.4givenF1F2F4F5algebra

Radical-plane instantiation. Take V=R2 with basis e1,e2 and B(x,y)=x1y1, and let a=e2. Then B(a,a)=0, and B(x,e2)=x1⋅0=0 for every x, so B(−,e2) is the zero functional and ker⁡B(−,e2)=V; in particular e2 lies in the radical. A map r fixing ker⁡B(−,e2)=V pointwise is the identity, and the identity does not send a to −a, since a≠0 forces 2a≠0 by [F2], that is a≠−a.

2.1givenF3step 1.2step 1.3step 1.4∎

Conclusion. Step 1.2 proves the general negative statement: for every a≠0 with B(a,a)=0 there is no linear r with r2=idV, r(a)=−a and r the identity on ker⁡B(−,a). Steps 1.3 and 1.4 realize the hypothesis in the two displayed planes, one with a∉rad⁡L(B) and a∈ker⁡B(−,a) of dimension 1, the other with ker⁡B(−,a)=V. Since the formula of [F3] is defined only for B(a,a)≠0, the condition B(a,a)≠0 is not a removable convenience of the division: the properties required of a reflection with normal a are unsatisfiable when B(a,a)=0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources