Descent, Seminormalization, and Conductors of Sparse Profile Images
Abstract
We develop a descent theory for sparse factorization-profile images, asking which functions on a normalization descend to the actual image. Whole-fiber completions yield a Fourier-zero classification for homogeneous masks, with a sharp stable converse, and a Fourier-line classification for mixed aperiodic profiles in the stated marked stable ranges. For homogeneous profiles, bounded integer relations determine geometric fibers and seminormalization, while explicit semigroup models compute actual image algebras, conductors, and depth in substantial families. For singleton--complement profiles, exact one-jet conditions determine the finite-output algebra, conductor, and projective descent through the first nonnormal boundary; the local type is computed in the smooth-boundary range and at the total-zero point of the first nonnormal layer. We also prove a saturated root-of-unity specialization theorem and give separating examples showing that normalization, natural polarizations, point fibers, seminormalization, and even the source conductor need not determine the actual image.
Related
- Sparse descent subspace-Newton thresholding algorithm for sparse optimization problems
- ParaDeAl: Parallel Descent Algorithms for Sparse Statistics
- Recovering linear images of sparse signals from indirect observations
- Blind Deconvolution of Binary and Pattern Images with Pixel Intensity Constraints and Sparse Gradient Prior
- Reconstruction of Binary Linear Systems and Profile Geometry of Sparse Krylov Strata
BibTeX
@misc{li2026descent,
title = {{Descent, Seminormalization, and Conductors of Sparse Profile Images}},
author = {Yangcheng Li},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.12854},
eprint = {2609.12854},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.12854},
}
RIS
TY - UNPB
TI - Descent, Seminormalization, and Conductors of Sparse Profile Images
AU - Yangcheng Li
PY - 2026
DA - 2026/09/11
PB - arXiv
DO - 10.48550/arxiv.2609.12854
UR - https://arxiv.org/abs/2609.12854
AB - We develop a descent theory for sparse factorization-profile images, asking which functions on a normalization descend to the actual image. Whole-fiber completions yield a Fourier-zero classification for homogeneous masks, with a sharp stable converse, and a Fourier-line classification for mixed aperiodic profiles in the stated marked stable ranges. For homogeneous profiles, bounded integer relations determine geometric fibers and seminormalization, while explicit semigroup models compute actual image algebras, conductors, and depth in substantial families. For singleton--complement profiles, exact one-jet conditions determine the finite-output algebra, conductor, and projective descent through the first nonnormal boundary; the local type is computed in the smooth-boundary range and at the total-zero point of the first nonnormal layer. We also prove a saturated root-of-unity specialization theorem and give separating examples showing that normalization, natural polarizations, point fibers, seminormalization, and even the source conductor need not determine the actual image.
ER -