Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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 metabolic Seifert matrix has Fox–Milnor factorization

Statement

Let g be a nonnegative integer, let L be a free abelian group of rank 2g, and let V:L×L→Z be a bilinear form whose matrix in an integral basis satisfies det⁡(V−VT)=±1. Let M⊆L be a direct summand of rank g such that V(x,y)=0 for every x,y∈M. Write dV(t)=det⁡(V−tVT), using the empty determinant 1 when g=0. Then there is a polynomial f(t)∈Z[t] such that

dV(t)=tgf(t)f(t−1).

In the Laurent polynomial ring, define p≐q to mean p=±tkq for some integer k. Thus dV(t)≐f(t)f(t−1).

Facts & Assumptions

Given: A finite-rank integral bilinear form (L,V) with the stated unimodular skew part, and a rank-g direct summand M on which V vanishes.

[A1]

The stated hypotheses are the entire input: L≅Z2g, det⁡(V−VT)=±1, M is a direct summand of rank g, and V∣M×M=0.

Proof

1.1A1givenchooseconstruct

If g=0, then L=M=0, so the empty determinant and f=1 give the formula. Suppose g>0. Write L=M⊕N and choose integral bases of the two rank-g summands. In the combined basis, V=(0BCD) with B,C,D∈Mg(Z), because V vanishes on M×M.

2.1A1step 1.1algebra

A basis change P∈GL⁡2g(Z) replaces V−tVT by PT(V−tVT)P and leaves its determinant unchanged, since (det⁡P)2=1. Hence it suffices to calculate in the basis of step 1.1.

3.1A1step 2.1algebra

Put f(t)=det⁡(B−tCT). In V−tVT the upper-left g×g block is zero, the upper-right block is B−tCT, and the lower-left block is C−tBT. Swapping its two row blocks contributes (−1)g2=(−1)g and produces a block-triangular matrix, so dV(t)=(−1)gdet⁡(B−tCT)det⁡(C−tBT). Also tgf(t−1)=det⁡(tB−CT)=(−1)gdet⁡(C−tBT), by factoring −1 from each row and transposing. Therefore dV(t)=tgf(t)f(t−1). The assumption on V−VT gives dV(1)=±1, so the displayed determinant is nonzero.

4.1step 1.1step 3.1algebra∎

Since tg is a unit in Z[t±1], the exact identity in step 3.1 implies dV(t)≐f(t)f(t−1). This proves the factorization, including the rank-zero case of step 1.1.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources