Table of Contents
Fetching ...

Approximately Dual and Pseudo-Dual Probabilistic Frames

Dongwei Chen, Emily J. King, Clayton Shonkwiler

TL;DR

This work analyzes dual structures for probabilistic frames through the lens of optimal transport. It establishes a hierarchy of dual concepts—dual, approximately dual, and pseudo-dual—and ties redundancy to the existence and form of these duals, proving that zero redundancy forces a unique pushforward dual while finite redundancy implies atomic, finitely supported measures. The authors show every probabilistic frame has a discrete finite approximately dual, develop convex constructions and perturbation results to generate approximate duals, and provide pushforward-type and general pseudo-dual characterizations. Overall, the paper blends frame theory with optimal transport to reveal structural insights and practical pathways for robust reconstruction from probabilistic frames.

Abstract

This paper studies properties of dual probabilistic frames -- in particular in relation to redundancy -- and introduces both approximately dual probabilistic frames and pseudo-dual probabilistic frames. We show that the canonical dual probabilistic frame is the only dual frame of pushforward type of a probabilistic frame with zero redundancy. Furthermore, we show that probabilistic frames with finite redundancy are atomic and finite. Approximately dual probabilistic frames generalize duality, with pseudo-duality being a further generalization. We introduce these concepts and prove certain structural results. In particular, every probabilistic frame has a discrete finite frame as an approximate dual.

Approximately Dual and Pseudo-Dual Probabilistic Frames

TL;DR

This work analyzes dual structures for probabilistic frames through the lens of optimal transport. It establishes a hierarchy of dual concepts—dual, approximately dual, and pseudo-dual—and ties redundancy to the existence and form of these duals, proving that zero redundancy forces a unique pushforward dual while finite redundancy implies atomic, finitely supported measures. The authors show every probabilistic frame has a discrete finite approximately dual, develop convex constructions and perturbation results to generate approximate duals, and provide pushforward-type and general pseudo-dual characterizations. Overall, the paper blends frame theory with optimal transport to reveal structural insights and practical pathways for robust reconstruction from probabilistic frames.

Abstract

This paper studies properties of dual probabilistic frames -- in particular in relation to redundancy -- and introduces both approximately dual probabilistic frames and pseudo-dual probabilistic frames. We show that the canonical dual probabilistic frame is the only dual frame of pushforward type of a probabilistic frame with zero redundancy. Furthermore, we show that probabilistic frames with finite redundancy are atomic and finite. Approximately dual probabilistic frames generalize duality, with pseudo-duality being a further generalization. We introduce these concepts and prove certain structural results. In particular, every probabilistic frame has a discrete finite frame as an approximate dual.

Paper Structure

This paper contains 8 sections, 30 theorems, 95 equations.

Key Result

Proposition 2.2

Let $\mu \in \mathcal{P}(\mathbb{R}^n)$.

Theorems & Definitions (51)

  • Definition 2.1
  • Proposition 2.2: ehler2013probabilistic, maslouhi2019probabilistic
  • Corollary 2.3
  • proof
  • Definition 2.4
  • Lemma 2.5: Gluing Lemma figalli2021invitation
  • Proposition 3.1: wickman2014optimal
  • Example 3.2
  • Lemma 3.3
  • proof
  • ...and 41 more