Sharp Conditioning for Matrix Recovery by Finite Affine Orbits
Abstract
Let q=ph be an odd prime power, and let the affine group 𝔽qrtimes𝔽q× act through its canonical (q−1)-dimensional irreducible representation. Qualitative matrix recovery for these rank-one orbits is known. We determine sharp lower singular-value bounds for explicit real generating windows. First, we compute the exact least singular value for every nonnegative two-level window over 𝔽ph with h≥2, and identify the unique optimizer when q−1≥10. The resulting conditioning stays bounded away from zero on every fixed odd-characteristic tower and is within an explicit characteristic-dependent factor of the best possible value over all real windows. For every q=3h, h≥2, we construct a real three-level absolute-trace window (constant on the fibers of Tr𝔽q/𝔽3) whose least singular value is (q(√2−1))/(q(2−√2)−1)>1/√2. For the full class of real windows constant on the three trace classes, we reduce the least singular value to four scalar expressions and a symmetric 2×2 matrix. This yields the exact global optimum and all equality cases: the displayed trace window is uniquely optimal up to global sign and interchange of the two nonzero trace classes. Thus zero trace mean follows from optimality. The proof combines an explicit sum-of-squares identity, uniform quadratic-form certificates, and a finite-geometric block decomposition of the orbit measurement operator.
Related
- Finite Recovery by Extrapolation for the Douglas--Rachford Method on Affine Subspaces
- Conditioning Strengthens Classical Entropy and Matrix Inequalities: A Submodular Approach
- Isomorphism between the R-matrix and Drinfeld presentations of quantum affine superalgebra for type A
- Sampling with Autoregressive Clock Jitter: Infinite-Dimensional Stability Failure and Finite-Dimensional Conditioning
- Finite Non-p-Groups with 5 Automorphism Orbits
BibTeX
@misc{li2026sharp,
title = {{Sharp Conditioning for Matrix Recovery by Finite Affine Orbits}},
author = {Dongwei Li},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.09619},
eprint = {2609.09619},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.09619},
}
RIS
TY - UNPB
TI - Sharp Conditioning for Matrix Recovery by Finite Affine Orbits
AU - Dongwei Li
PY - 2026
DA - 2026/09/09
PB - arXiv
DO - 10.48550/arxiv.2609.09619
UR - https://arxiv.org/abs/2609.09619
AB - Let q=p^h be an odd prime power, and let the affine group 𝔽_qrtimes𝔽_q^× act through its canonical (q−1)-dimensional irreducible representation. Qualitative matrix recovery for these rank-one orbits is known. We determine sharp lower singular-value bounds for explicit real generating windows. First, we compute the exact least singular value for every nonnegative two-level window over 𝔽_p^h with h≥2, and identify the unique optimizer when q−1≥10. The resulting conditioning stays bounded away from zero on every fixed odd-characteristic tower and is within an explicit characteristic-dependent factor of the best possible value over all real windows. For every q=3^h, h≥2, we construct a real three-level absolute-trace window (constant on the fibers of Tr_𝔽_q/𝔽_3) whose least singular value is (q(√2−1))/(q(2−√2)−1)>1/√2. For the full class of real windows constant on the three trace classes, we reduce the least singular value to four scalar expressions and a symmetric 2×2 matrix. This yields the exact global optimum and all equality cases: the displayed trace window is uniquely optimal up to global sign and interchange of the two nonzero trace classes. Thus zero trace mean follows from optimality. The proof combines an explicit sum-of-squares identity, uniform quadratic-form certificates, and a finite-geometric block decomposition of the orbit measurement operator.
ER -