Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedverified 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.

The leading minus sign in the Dubrovnik conversion is necessary

Statement refuted

The formula obtained by omitting the leading minus sign, DK(a,z)=i−w(K)(−1)c(K)LK(ia,−iz),i2=−1, is false: on the one-component unknot it gives D=−1, while the declared Dubrovnik normalization gives D=1.

Diagram

The circle below depicts the one-component test link; the numerical refutation follows from its declared writhe, component count, and normalization.

U

Facts & Assumptions

Given: The one-component unknot, its writhe and component count, and the declared Dubrovnik and Kauffman values.

[F1]

The unknot has w=0, c=1, D=1, and L=1 under the stated normalization (Kauffman regular-isotopy and Dubrovnik conventions).

Refutation

1.1F1algebra

Apply the proposed false formula to the unknot from [F1]. Since i−w=i0=1 and (−1)c=(−1)1=−1, it assigns D=1⋅(−1)⋅1=−1. This contradicts the declared value D=1 in [F1].

2.1F1step 1.1algebra∎

Inserting the leading minus changes that result to −1⋅(−1)=1, exactly the normalized unknot value from [F1]. Thus the leading sign is necessary for the displayed conversion.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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