Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 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.

Many finite presentations of one tensor and the invariant contraction

Example

Let k be a field of characteristic ≠2. Work in V=W=k2 with u=(1,0), v=(0,1), u′=(2,0) and v′=(0,12). Then u⊗v=u′⊗v′ in k2⊗k2, although (u,v)≠(u′,v′). Consequently every k-bilinear form B:k2×k2→k with B(u,v)=1 gives the value 1 on every finite presentation of that tensor: if ∑lxl⊗yl=u⊗v then ∑lB(xl,yl)=1. The contraction of a bilinear form against a tensor is therefore independent of the presentation.

Facts & Assumptions

Given: A field k of characteristic ≠2, the vectors u=(1,0), v=(0,1), u′=(2,0) and v′=(0,12) in k2, and a k-bilinear form B:k2×k2→k with B(u,v)=1.

[F1]

The tensor product conventions: k2⊗k2 is the tensor product over k with its universal property, every element is a finite sum of elementary tensors, and the defining relations give c(x⊗y)=(cx)⊗y=x⊗(cy) for every c∈k (Scalars, tensor powers, the empty tensor, opposite algebras and finite sums).

[F2]

Bilinear maps over a commutative ring are additive in each variable and satisfy b(rx,y)=rb(x,y)=b(x,ry) (Balanced maps from a right module and a left module, and bilinear maps over a commutative ring).

[F3]

A balanced pairing on V×W induces a unique group homomorphism on V⊗W with the corresponding values on elementary tensors (Universal property of the tensor product for balanced maps into abelian groups).

[F4]

A prescription on elementary tensors descends to a homomorphism exactly when its underlying pairing is balanced, and then the extension is unique (A formula on elementary tensors defines a homomorphism exactly when its underlying pairing is balanced).

[F5]

The elementary tensors of two bases form a basis of the tensor product, so for the basis vectors e1=u, e2=v the tensor u⊗v=e1⊗e2 is a nonzero element of k2⊗k2 (The elementary tensors of two bases form the product basis of the tensor product).

Verification

technique · direct
1.1givenF1F5algebra

Since u′=2u and v′=12v, bilinearity of the elementary tensor [F1] gives u′⊗v′=(2u)⊗(12v)=2⋅12 (u⊗v)=u⊗v because 2⋅12=1 in k by the characteristic hypothesis; and (u,v)≠(u′,v′) because u=(1,0)≠(2,0)=u′; moreover u⊗v=e1⊗e2≠0 by [F5], so an empty presentation, whose sum is 0, can never satisfy ∑lxl⊗yl=u⊗v.

2.1step 1.1F1F2F3F4∎

The form B is k-bilinear [F2], hence balanced, so it descends to the unique group homomorphism B‾:k2⊗k2→k with B‾(x⊗y)=B(x,y) by [F3] and [F4]. It is k-linear: for c∈k and t=∑lxl⊗yl, [F1] and [F2] give B‾(ct)=∑lB(cxl,yl)=c∑lB(xl,yl)=cB‾(t). If ∑lxl⊗yl=u⊗v is any finite presentation of the tensor, linearity of B‾ and step 1.1 give ∑lB(xl,yl)=B‾(∑lxl⊗yl)=B‾(u⊗v)=B(u,v)=1, so the contraction has the same value 1 on every presentation and is independent of the presentation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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