Skip to content
DraconiticResearch
Search Sources API
186,086 studies31 sourcesUpdated 51 min ago
PreprintCC BY 4.0arXiv

Similarity cancellation and primitive operator roots

Abstract

Kaplansky's second test problem for similarity asks whether A⊕ A∼ B⊕ B implies A∼ B for bounded operators on a separable infinite-dimensional Hilbert space. We answer this question in the negative, even for compact operators whose singular values satisfy any prescribed positive upper bounds tending to zero. We also show that cancellation can fail under the stronger hypothesis J2(T)∼ J2(S) considered by Marcoux, Radjavi, Troscheit, and Zhang \cite{MRTZ}. For these operators, finite amplifications and primitive roots are similar exactly at even multiplicities and even orders, respectively. In contrast, cancellation in fixed matrix size admits a uniform bound on the condition number. This extends the finite type~I results of Jiang, Ma, Shi, and Zhang \cite{JMSZ}. The bound also holds for simultaneous similarity of arbitrary families of matrices and can be chosen to tend to one as the amplified bound tends to one. We conclude that, in a finite type~I von Neumann algebra, cancellation of doubles and cancellation of primitive square roots are each equivalent to boundedness of the orders of its nonzero homogeneous summands.

Related

  1. Conflict-avoiding codes and near-primitive roots
    C. G. Karthick Babu, Pieter Moree, Sunil Kumar Pasupulati +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. Suslin's cancellation conjecture on smooth real affine varieties with few real points
    Sourjya Banerjee, Jean Fasel, Samuel Lerbet
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryGeometry & topologyarXiv
  3. Uniform small cancellation in torsion-free hyperbolic groups
    Olga Kharlampovich, Rizos Sklinos
    arXivPreprintarXiv licenceFull textAlgebra & number theoryLogic & foundationsarXiv
  4. Invariance of Grothendieck-Witt groups under subintegral extensions and cancellation of quadratic spaces
    Jebasingh R
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Generalized Cancellation of Capacitor Parasitic Inductance Using a Lattice Network and Its Application to Common-Mode Noise Reduction
    Katsuya Nomura, Shuhei Chizuwa, Takashi Masuzawa
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{aouichaoui2026similarity,
  title = {{Similarity cancellation and primitive operator roots}},
  author = {Mohamed Amine Aouichaoui},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.01298},
  eprint = {2611.01298},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.01298},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Similarity cancellation and primitive operator roots
AU  - Mohamed Amine Aouichaoui
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.01298
UR  - https://arxiv.org/abs/2611.01298
AB  - Kaplansky's second test problem for similarity asks whether A⊕ A∼ B⊕ B implies A∼ B for bounded operators on a separable infinite-dimensional Hilbert space. We answer this question in the negative, even for compact operators whose singular values satisfy any prescribed positive upper bounds tending to zero. We also show that cancellation can fail under the stronger hypothesis J_2(T)∼ J_2(S) considered by Marcoux, Radjavi, Troscheit, and Zhang \cite{MRTZ}. For these operators, finite amplifications and primitive roots are similar exactly at even multiplicities and even orders, respectively. In contrast, cancellation in fixed matrix size admits a uniform bound on the condition number. This extends the finite type~I results of Jiang, Ma, Shi, and Zhang \cite{JMSZ}. The bound also holds for simultaneous similarity of arbitrary families of matrices and can be chosen to tend to one as the amplified bound tends to one. We conclude that, in a finite type~I von Neumann algebra, cancellation of doubles and cancellation of primitive square roots are each equivalent to boundedness of the orders of its nonzero homogeneous summands.
ER  -