Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Parity violation makes singular-value action basis dependent

Statement

A false extension of the odd singular-value formula that assigns a nonzero coefficient to zero-singular-vector pairs depends on arbitrary basis choices. Take A=0:C→C and the scalar function f(x)=1. Pair the right zero vector v=1 with either left zero vector u=1 or u=−1. The resulting rank-one sums are respectively I and −I, despite the same zero map A.

Facts & Assumptions

Given: The zero linear map A:C→C, the scalar value f(0)=1, and the rank-one map convention of Dirac Notation Conversion.

[F1]

Odd and even singular-value transforms: an odd singular-value transform sums only over positive singular pairs, while an even right transform uses f(0) times the canonical projection onto ker⁡A.

[F2]

Dirac Notation Conversion: ∣u⟩⟨v∣ maps x to ⟨x,v⟩rootu.

Proof

1.1givenF2algebra

For A=0, the entire domain and codomain are zero-singular spaces; both u=1 and u=−1 are unit left-kernel vectors, and v=1 is a unit right-kernel vector. With the first pairing, ∣1⟩⟨1∣ sends x to x, so the false zero-pair sum with coefficient f(0)=1 is I.

2.1F1F2step 1.1algebra∎

With the second equally valid left singular basis, ∣−1⟩⟨1∣ sends x to −x, so the same false rule gives −I. Since I≠−I on C, this rule is not basis independent. The valid odd definition avoids the defect because odd polynomials have f(0)=0 and the sum contains only positive singular values; the valid even definition adds f(0)Πker⁡A=I, which is canonical and unchanged by the choice of kernel basis.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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