惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Martin Fowler
Martin Fowler
WordPress大学
WordPress大学
月光博客
月光博客
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
大猫的无限游戏
大猫的无限游戏
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
博客园 - 聂微东
Apple Machine Learning Research
Apple Machine Learning Research
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
雷峰网
雷峰网
小众软件
小众软件
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 叶小钗
美团技术团队
宝玉的分享
宝玉的分享
Hugging Face - Blog
Hugging Face - Blog
阮一峰的网络日志
阮一峰的网络日志
A
About on SuperTechFans
Jina AI
Jina AI
D
Docker
Last Week in AI
Last Week in AI
MongoDB | Blog
MongoDB | Blog
Stack Overflow Blog
Stack Overflow Blog
Microsoft Azure Blog
Microsoft Azure Blog

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Norming Approximate Orthogonality in Normed Linear Spaces
[Submitted on 17 Jun 2026] · 2026-06-18 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We introduce and study the notion of \emph{norming approximate orthogonality}, a two-parameter generalization of Birkhoff--James orthogonality in normed linear spaces. For $\delta, \varepsilon \in [0,1)$ with $\varepsilon < (1-\delta)^2$, we say $x \nperp y$ in $X$ if there exists $f \in X^*$ with $|f(x)| \geq (1-\delta)\|f\|\|x\|$ and $|f(y)| \leq \frac{\varepsilon}{1-\delta}\|f\|\|y\|$, simultaneously relaxing both the norming condition on $x$ and the vanishing condition on $y$. It is proved that \[ x\nperp y \iff \|x+\lambda y\|\geq (1-\delta)\|x\|-\frac{\varepsilon}{1-\delta}\|\lambda y\|~\qquad \forall ~\text{scalars}~\lambda. \] This framework interpolates between two notions of approximate orthogonality in normed linear spaces due to Chmieliński and Dragomir, and recovers three existing notions of orthogonality in extreme cases: exact Birkhoff--James orthogonality at $\delta = \varepsilon = 0$, the approximate orthogonality of Chmieliński at $\delta = 0$, and the approximate orthogonality of Dragomir at $\varepsilon = 0$. A two-parameter proximity result generalizing Chmlieński's characterization of $\perp_B^\varepsilon$ is established. The forward and converse implications are governed by the distinct thresholds $\frac{\varepsilon}{(1-\delta)^2}$ and $\frac{\varepsilon}{1-\delta}$, which collapse to $\varepsilon$ of Chmieliński precisely when $\delta=0$, and the strictness of this gap is confirmed by counterexamples in $\ell_\infty^2$. A dual formulation of norming approximate orthogonality is established with a complete equivalence in the reflexive case. We apply our results to (vector-valued) continuous function spaces, which extends some earlier results and recovers few operator theoretical results with alternative proofs using measure theoretic techniques.

Submission history

From: Saikat Roy [view email]
[v1] Wed, 17 Jun 2026 06:11:08 UTC (17 KB)