betaFeedback

WorksMathematics

The geometry and classification of positive frames

Abstract

We investigate the geometric and operator-theoretic structure of positive frames and their duals in finite-dimensional real Hilbert spaces, with particular emphasis on positive linear dependence, redundancy, and convex geometry. Building on the classical theory of positive spanning sets, we characterize equivalence classes of positive frames through the kernels of their synthesis operators and obtain parametrizations in terms of the relative interior of a standard simplex and suitable subsets of Grassmannians. We establish that every redundant frame admits a positive dual, regardless of whether the original frame is positive, and provide an explicit construction through a rank-one perturbation of the canonical dual. Furthermore, we investigate the affine and topological structure of positive dual frames, proving their relative openness in the space of all duals and the absence of extreme points. We characterize dual frames satisfying prescribed positive relations and derive criteria for the existence of positive-basis duals. We also examine semi-positive frames and their boundary behavior, together with connections between positive spanning, balancedness, and finite group representations. Finally, we study the convex geometry of nonnegative relation spaces and establish a directional characterization of positive-spanning robustness under arbitrary vector erasures. These results provide a unified geometric framework for understanding positive frames, their dual systems, and the role of redundancy in constrained reconstruction.

Introduction

Redundancy is one of the fundamental features that distinguishes frames from bases. While a basis provides a unique linear representation of each vector, a frame allows multiple representations and, consequently, considerable freedom in the choice of reconstruction operators. This flexibility becomes particularly significant when additional geometric constraints are imposed on the frame vectors or their duals. Among such constraints, positive spanning occupies a distinguished position: it requires that every vector in the underlying space be generated using only nonnegative coefficients. The purpose of this paper is to investigate how this classical geometric property interacts with the algebraic and operator-theoretic structure of finite frames, with particular emphasis on equivalence, duality, redundancy, and robustness.

The theory of positive spanning sets has a long history, originating in the study of positive linear dependence. In his foundational work, Davis [6] developed fundamental properties of positive spanning families and positive bases, including geometric characterizations and cardinality restrictions for minimal positive spanning systems. These ideas subsequently appeared in the geometric study of convex polytopes and Gale diagrams [10]. Positive spanning sets have also become important in derivative-free optimization, where they provide collections of search directions capable of detecting descent without explicit derivative information; see [7, 8]. Dynamical sampling provides another important connection to frame theory through operator-generated systems; see [11] for a comprehensive survey and [4] for recent constructions of positive frames with optimal redundancy under erasures. Related geometric configurations arise in redundant control systems, where suitable collections of control directions are needed to generate prescribed forces and motions; see, for example, [9, 12, 13, 14]. These developments demonstrate the usefulness of positive spanning in several different settings. However, their principal emphasis is on positive dependence, minimality, geometric configurations, or applications, rather than on the structure of dual frames and the operator-theoretic consequences of positivity.

In finite-dimensional frame theory, every spanning family is a frame, but not every frame is positively spanning. Moreover, positivity introduces a requirement that differs fundamentally from ordinary linear spanning. A family F={fi}i=1NF = \{f_i\}_{i=1}^{N} in an nn-dimensional real Hilbert space Hn\mathcal{H}_n is called a positive frame if

span⁡+(F)={∑i=1Ncifi:ci≥0}=Hn.\operatorname{span}_{+}(F) = \left\{ \sum_{i=1}^{N} c_i f_i : c_i \ge0 \right\} = \mathcal{H}_n.

The nonnegativity in this definition concerns the coefficients in a representation, not the coordinates of the frame vectors themselves. It is also important to distinguish positive spanning from reconstruction by a fixed linear coefficient map. Although a positive frame allows each vector to be expressed using nonnegative coefficients, those coefficients may depend nonlinearly on the vector. In contrast, a dual frame supplies a prescribed linear reconstruction formula. Understanding the relationship between these two forms of representation is one of the motivations for the present work.

The classical geometric theory provides a natural starting point. For a finite spanning family, positive spanning is equivalent to the existence of a strictly positive linear dependence among its vectors, or, equivalently, to the origin lying in the interior of their convex hull. In the language of frame operators, this condition becomes

F is positive⟺ker⁡TF∗∩R++N≠∅.F \text{ is positive} \quad\Longleftrightarrow\quad\ker T_F^* \cap\mathbb{R}_{++}^{N} \ne\varnothing.

where TF∗T_F^* denotes the synthesis operator. Although this equivalence follows from classical positive-spanning theory, its operator formulation suggests a broader perspective: the geometry of a positive frame can be investigated through its space of linear relations. In particular, it raises the question of how much of the structure of a positive frame is determined by its synthesis kernel.

Our first objective is therefore to study positive frames under invertible linear equivalence. Since two ordered frames are equivalent precisely when their synthesis operators have the same kernel, the classification problem can be reformulated in terms of subspaces of RN\mathbb{R}^{N} that intersect the strictly positive orthant. We establish a parametrization of equivalence classes of positive frames through these relation spaces. For frames with excess one, the parameter space reduces to the relative interior of a standard simplex, with each point representing a unique normalized strictly positive dependence. For arbitrary excess, we obtain a quotient description in terms of linearly independent strictly positive relations, together with an equivalent Grassmannian formulation. We also examine the role of orthogonal projections in constructing positive frames. These results provide a geometric classification that depends on the relation space rather than on the frame operator alone.

A more substantial question concerns duality. Given a frame FF, one may ask whether its reconstruction freedom can be used to select a dual frame that positively spans the ambient space. This is not the same as asking whether FF itself is positive: the original frame and its duals can have very different positive-spanning properties. We prove that a finite frame admits a positive dual if and only if it is redundant. Thus the existence of a positive dual is governed entirely by the excess of the original frame. Our proof is constructive. Starting from the canonical dual, we use a strictly positive vector outside the analysis range to produce a rank-one perturbation satisfying both the reconstruction identity and a prescribed strictly positive linear relation. This gives an explicit mechanism for introducing positivity into a dual system, even when the original frame is not positively spanning.

Beyond existence, we investigate the geometry of the family D+(F)\mathcal{D}_{+}(F) of all positive duals of a fixed frame. We establish its relative openness within the affine space of dual frames and examine the perturbations that preserve positivity and reconstruction simultaneously. In particular, we show that D+(F)\mathcal{D}_{+}(F) has no extreme points: every positive dual can be expressed as the midpoint of two distinct positive duals. We also study dual frames satisfying prescribed positive relations and the more restrictive problem of obtaining a dual that is a positive basis. The latter leads to conditions involving complements of the analysis range and prescribed coordinate sign patterns. Together, these results describe how positive spanning restricts, but does not eliminate, the freedom available in dual-frame reconstruction.

The geometry becomes more delicate when strict positivity is relaxed. Motivated by this distinction, we consider semi-positive frames, which admit nontrivial nonnegative linear relations with at least one vanishing coefficient. We investigate their approximation by positive frames and the corresponding boundary behavior of positive duals. This provides a connection between strictly positive relations and degenerate nonnegative dependencies, and clarifies how positivity may be lost under limiting processes. The resulting picture is useful for understanding the topology of families of positive frames and their dual systems.

We further examine positive frames arising from finite group representations. Group-generated families possess additional symmetry, and their linear relations reflect the structure of the underlying representation. We investigate the relationship between balancedness, linear connectedness, and positive spanning, using the averaging operator associated with a finite group. In particular, the presence or absence of invariant vectors provides information about balanced orbit families and their positivity. This places the geometric theory of positive frames in a structured setting where algebraic symmetry can be used to identify positive dependencies.

Finally, we study positive dependence from the viewpoint of convex geometry and robustness. Minimal positive dependencies and the extreme points of the polytope of normalized nonnegative relations provide information about the internal structure of positive frames. We also consider the effect of deleting frame vectors. Unlike ordinary spanning, positive spanning requires every nonzero direction to have a strictly positive inner product with at least one frame vector. This leads to the directional quantity

d+(F)=min⁡∥x∥=1#{i:⟨x,fi⟩>0}.d_{+}(F)=\min_{\lVert x\rVert=1}\#\{i:\langle x,f_i\rangle>0\}.

We show that a positive frame remains positively spanning after the deletion of any ss vectors if and only if d+(F)≥s+1d_{+}(F)\ge s+1. We also investigate related questions of exactness, cardinality, and approximation by positive Parseval frames. These results connect the combinatorial structure of positive dependencies with the stability of positive spanning under perturbations and erasures.

The paper is organized as follows. Section 2 recalls the necessary background on finite frames, positive spanning sets, and convex geometry. Section 3 develops geometric characterizations of positive frames, their equivalence classes through synthesis kernels, simplex and Grassmannian parametrizations, and the structure of positive bases. Section 4 investigates positive dual frames, including their existence, construction, and geometric properties. Section 5 examines the convex geometry of positive duals, their boundary behavior, and the approximation of semi-positive frames. Section 6 studies positive frames generated by finite group representations, with particular emphasis on balancedness and linear connectedness. Section 7 explores the convex geometry of nonnegative relations, positive-spanning robustness under erasures, exactness, cardinality bounds, and positive Parseval approximation. Finally, Section 8 presents concluding remarks and directions for future research.

Preliminaries

Throughout this paper, Hn\mathcal{H}_n denotes an nn-dimensional real Hilbert space, where n≥1n\ge1. All vector spaces and operators are considered over R\mathbb{R}. We work with finite indexed families F={fi}i=1N⊂HnF=\{f_i\}_{i=1}^{N}\subset\mathcal{H}_n, where repetitions and zero vectors are permitted unless otherwise specified. We recall the basic notions of finite frame theory, positive spanning, and convex geometry that will be used throughout the paper.

Finite frames and duality

A family F={fi}i=1NF=\{f_i\}_{i=1}^{N} is called a frame for Hn\mathcal{H}_n if there exist constants 0<A≤B<∞0<A\le B<\infty such that

A∥x∥2≤∑i=1N∣⟨x,fi⟩∣2≤B∥x∥2,x∈Hn.A\lVert x\rVert^2\le\sum_{i=1}^{N}\lvert\langle x,f_i\rangle\rvert^2\le B\lVert x\rVert^2,\qquad x\in\mathcal{H}_n.

In finite dimensions, this is equivalent to span⁡(F)=Hn\operatorname{span}(F)=\mathcal{H}_n. The analysis operator TF:Hn→RNT_F:\mathcal{H}_n\to\mathbb{R}^{N} and the synthesis operator TF∗:RN→HnT_F^{*}:\mathbb{R}^{N}\to\mathcal{H}_n are defined by

TFx=∑i=1N⟨x,fi⟩ei,TF∗c=∑i=1Ncifi,T_Fx=\sum_{i=1}^{N}\langle x,f_i\rangle e_i,\qquad T_F^{*}c=\sum_{i=1}^{N}c_if_i,

where {ei}i=1N\{e_i\}_{i=1}^{N} is the standard orthonormal basis of RN\mathbb{R}^{N} and c=(ci)i=1Nc=(c_i)_{i=1}^{N}. The associated frame operator is SF=TF∗TFS_F=T_F^{*}T_F, which is positive, self-adjoint, and invertible.

A frame is called tight if SF=AIHnS_F=AI_{\mathcal{H}_n} for some A>0A>0, and Parseval if SF=IHnS_F=I_{\mathcal{H}_n}. The canonical dual of FF is F~={SF−1fi}i=1N\widetilde{F}=\{S_F^{-1}f_i\}_{i=1}^{N}.

A frame G={gi}i=1NG=\{g_i\}_{i=1}^{N} is called a dual frame of FF if

x=∑i=1N⟨x,fi⟩gi,x∈Hn,(1)x=\sum_{i=1}^{N}\langle x,f_i\rangle g_i,\qquad x\in\mathcal{H}_n, \tag*{(1)}

or equivalently, TG∗TF=IHnT_G^*T_F=I_{\mathcal{H}_n}. We denote by D(F)\mathcal{D}(F) the collection of all dual frames of FF.

Recall that every dual frame of FF has the representation

gi=SF−1fi+hi,1≤i≤N,g_i=S_F^{-1}f_i+h_i,\qquad1\leq i\leq N,

where H={hi}i=1NH=\{h_i\}_{i=1}^N satisfies TH∗TF=0T_H^*T_F=0. Consequently,

D(F)={F~+H:TH∗TF=0}.\mathcal{D}(F)=\left\{\widetilde{F}+H:T_H^*T_F=0\right\}.

Thus D(F)\mathcal{D}(F) is an affine subspace of HnN\mathcal{H}_n^N. The relation space of FF is KF=ker⁡TF∗K_F=\ker T_F^*. Since TF∗T_F^* is surjective, the rank-nullity theorem gives

dim⁡KF=N−n,KF=(Ran⁡TF)⊥.\dim K_F=N-n,\qquad K_F=(\operatorname{Ran}T_F)^\perp.

The integer N−nN-n is called the excess of FF. In particular, FF is redundant if and only if KF≠{0}K_F\ne\{0\}.

We shall frequently use the orthogonal projection onto Ran⁡TF\operatorname{Ran}T_F, given by

PF=TFSF−1TF∗.P_F=T_FS_F^{-1}T_F^*.

Consequently, IRN−PFI_{\mathbb{R}^N}-P_F is the orthogonal projection onto KFK_F. These identities provide a convenient connection between the reconstruction operators and the linear relations among frame vectors.

Positive spanning sets and positive bases

For a finite family F={fi}i=1N⊂HnF=\{f_i\}_{i=1}^N\subset\mathcal{H}_n, its positive span is defined by

span⁡+(F)={∑i=1Ncifi:ci≥0}.\operatorname{span}_{+}(F)=\left\{\sum_{i=1}^N c_i f_i:c_i\geq0\right\}.

A frame FF is called a positive frame if span⁡+(F)=Hn\operatorname{span}_{+}(F)=\mathcal{H}_n. A dual frame GG of FF is called a positive dual frame if GG is itself a positive frame. We write

D+(F)={G∈D(F):span⁡+(G)=Hn}.\mathcal{D}_{+}(F)=\{G\in\mathcal{D}(F):\operatorname{span}_{+}(G)=\mathcal{H}_n\}.

A family FF is said to admit a nonnegative relation if there exist coefficients ci≥0c_i\geq0, not all zero, such that ∑i=1Ncifi=0\sum_{i=1}^N c_i f_i=0. If every coefficient is strictly positive, the relation is called a strictly positive relation. For convenience, we write

R≥0N={c∈RN:ci≥0},R++N={c∈RN:ci>0}.\mathbb{R}_{\geq0}^N=\{c\in\mathbb{R}^N:c_i\geq0\},\qquad \mathbb{R}_{++}^N=\{c\in\mathbb{R}^N:c_i>0\}.

Thus nonnegative and strictly positive relations correspond, respectively, to nonzero vectors in KF∩R≥0NK_F\cap\mathbb{R}_{\geq0}^N and vectors in KF∩R++NK_F\cap\mathbb{R}_{++}^N.

The theory of positive linear dependence was developed systematically by Davis [6]. We recall a classical result that will be used in our analysis. A positive frame FF is called a positive basis if no proper subfamily of FF positively spans Hn\mathcal{H}_n. Thus a positive basis is a minimal positive spanning family, which need not be a basis in the usual linear-algebraic sense. The following cardinality restriction is another classical result of Davis.

Theorem 2.1 (Davis [6]). Let F={fi}i=1NF=\{f_i\}_{i=1}^N be a positive basis for Hn\mathcal{H}_n. Then

n+1≤N≤2n.n+1\leq N\leq2n.

Positive bases consisting of n+1n+1 and 2n2n vectors are called minimal positive bases and maximal positive bases, respectively. These configurations also arise in derivative-free optimization, where positive spanning sets are used to construct suitable search directions; see [7, 8, 20]. The following standard examples illustrate the distinction between positive frames and positive bases.

References

  1. [4]A. Aldroubi, C. Cabrelli, I. Krishtal, and U. Molter, Dynamical sampling: a survey, La Matematica 5(2) (2026), Article 37. https://doi.org/10.1007/s44007-026-00215-y.
  2. [6]C. Davis, Theory of positive linear dependence, Amer. J. Math. 76(4) (1954), 733–746. https://doi.org/10.2307/2372648.
  3. [7]A. R. Conn, K. Scheinberg, and L. N. Vicente, Introduction to Derivative-Free Optimization, MPS-SIAM Series on Optimization, SIAM, Philadelphia, 2009. https://doi.org/10.1137/1.9780898718768.
  4. [8]C. Audet and W. Hare, Derivative-Free and Blackbox Optimization, Springer Series in Operations Research and Financial Engineering, Springer, Cham, 2017. https://doi.org/10.1007/978-3-319-68913-5.
  5. [9]B. S. Crawford, Configuration design and efficient operation of redundant multijet systems, in AIAA Guidance, Control, and Flight Mechanics Conference, Princeton, New Jersey, 1969, AIAA Paper No. 69-845.
  6. [10]D. A. Marcus, Gale diagrams of convex polytopes and positive spanning sets of vectors, Discrete Appl. Math. 9(1) (1984), 47–67. https://doi.org/10.1016/0166-218X(84)90090-8.
  7. [11]A. Aldroubi, C. Cabrelli, I. Krishtal, and U. Molter, “Dynamical sampling: A survey,” La Matematica, 5 (2026), Article 37. https://doi.org/10.1007/s44007-026-00215-y.
  8. [12]B. S. Crawford, Operation and Design of Multi-Jet Spacecraft Control Systems, Sc.D. thesis, Massachusetts Institute of Technology, 1968, MIT Instrumentation Laboratory Report T-509.
  9. [13]R. Sánchez Peña, R. J. Alonso, and P. A. Anigstein, Robust optimal solution to the attitude/force control problem, IEEE Trans. Aerosp. Electron. Syst. 36(3) (2000), 784–792. https://doi.org/10.1109/7.869496.
  10. [14]J. I. Giribet, R. Sánchez-Peña, and A. Ghersin, Analysis and design of a tilted rotor hexacopter for fault tolerance, IEEE Trans. Aerosp. Electron. Syst. 52(4) (2016), 1555–1567. https://doi.org/10.1109/TAES.2016.140885.
  11. [20]T. G. Kolda, R. M. Lewis, and V. Torczon, Optimization by direct search: New perspectives on some classical and modern methods, SIAM Review, 45(3) (2003), 385–482. https://doi.org/10.1137/S0036144502428889
  12. [21]S. Pehlivan, D. Han, and R. Mohapatra, Linearly connected sequences and spectrally optimal dual frames for erasures, J. Funct. Anal. 265 (2013), no. 11, 2855–2876.DOI

Paper details

vlnc:W_nt3s9naa
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents