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.
Explicit integral Seifert matrices with arbitrarily small signature bumps
Statement
For every and every open interval containing , there is an explicit integral matrix with such that the finite Hermitian matrix has signature at and signature zero for all . Its signature takes only the values on and is invariant under . Moreover, its signature equals throughout an open interval containing . No choice principle, classification of Seifert forms, realization by a knot, or infinite-dimensional spectral theorem is assumed.
Facts & Assumptions
Given: The real parameter and containing open interval .
All matrices below are finite. For a finite Hermitian matrix, signature is its number of positive eigenvalues minus its number of negative eigenvalues, counted with multiplicity. Equivalently these are the positive and negative inertia indices of its Hermitian form. Invertible congruence preserves these indices by sending definite subspaces bijectively to definite subspaces; a block-diagonal sum adds them.
Proof
The finite inertia calculations used below require no spectral theorem for an infinite-dimensional space. A nonzero Hermitian form on has a vector with nonzero real value: if its diagonal values on the coordinate vectors all vanish, a nonzero off-diagonal entry is detected by a sum or . Split off the line of such a vector by subtracting its orthogonal projection, and repeat in the orthogonal complement. Finite induction gives a diagonal form with positive, negative and zero entries. If there are positive entries, the positive coordinate subspace has dimension , and any subspace of dimension greater than meets the span of the nonpositive coordinates, so cannot be positive definite. Thus is the maximal positive dimension; the same argument gives the maximal negative dimension. Congruence preserves these maxima by an invertible change of coordinates, and the diagonal description proves additivity under block sum and sign reversal under negation. For a Hermitian matrix, its real eigenvalues are ; their product is its determinant. Hence the trace/determinant tests used below follow explicitly. Every splitting is within a fixed finite-dimensional space.
For integers and , put , , and . Both diagonal blocks are integral and symmetric, so has determinant one. Also is positive definite: its real quadratic form is , and the same expression with absolute squares works over . Its determinant is and its trace is positive. All these assertions follow directly from the displayed matrices.
For write and , so . The Hermitian matrix of is . Subtracting the appropriate multiple of the lower block from the upper block, and the conjugate multiple of its column, is an invertible block congruence to . Its second block contributes signature two. Put . Since and is positive definite, . Direct determinant expansion, using and , gives The polynomial has exactly one positive root For its determinant is positive and its trace negative, so its two real eigenvalues are negative. At it has one negative and one zero eigenvalue. For its determinant is negative, so it has one positive and one negative eigenvalue. The signature of is consequently in those three cases, respectively. At the Hermitian matrix is zero and its signature is zero.
The positive thresholds are dense in . Indeed fix and set for positive integers . For all sufficiently large , ; put . Then Here and , which prove the bound. For any desired positive tolerance a sufficiently large integer makes its right side smaller than that tolerance. Given any target in , take to be one minus half the target; the explicit floor formula then supplies thresholds arbitrarily close to it. This is a sequence defined by a formula, without selecting any infinite family of witnesses.
The function is continuous and strictly increasing from to on : its derivative is in the interior. Choose two real angles in and small disjoint open intervals around them whose closures are contained respectively in and . Their images are nonempty intervals in . Step 3.1 supplies a pair with threshold in the first image and a pair with threshold in the second. If desired these finite witnesses can be specified by enumerating integer pairs by increasing and then increasing and taking the first pair whose explicit threshold is in the relevant interval. Thus the corresponding unique crossing angles satisfy and lie in .
Define . Each skew block has determinant one, also after negation, so . Its Hermitian signature is the difference of the two signatures in step 2.1. Since the thresholds are ordered, it is zero below , one at , two on , one at and zero above . It is also zero at zero. This proves all claims on , including nonzero value at and vanishing off . Finally is real, so ; conjugation preserves the real eigenvalues and their multiplicities, proving symmetry. The only constructions were finite matrices, explicit integer formulas and two individual integer witnesses. Thus no choice or realization theorem has been used.
Remarks
This is the matrix prerequisite for a knot signature bump. Passing to an actual knot requires a proved finite geometric realization with compatible positive-push convention; that conclusion is not part of this lemma.
Used by
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Cha and Livingston, Knot signature functions are independent (standard reference, not scraped)
- Cha, Structure of the string link concordance group and Hirzebruch-type invariants (standard reference, not scraped)