# Approximate and discrete Euclidean vector bundles

arXiv: https://arxiv.org/abs/2104.07563 · HTML: https://mlsanity.com/paper/2104.07563/

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Apr 2021.

## Built on by (most cited first, 7 of 7)

- [Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs](https://mlsanity.com/paper/2202.04579/) (2022)
- [Bundle Networks: Fiber Bundles, Local Trivializations, and a Generative Approach to Exploring Many-to-one Maps](https://mlsanity.com/paper/2110.06983/) (2021)
- [FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector Bundles](https://mlsanity.com/paper/2206.06513/) (2022)
- [Fiber Bundle Morphisms as a Framework for Modeling Many-to-Many Maps](https://mlsanity.com/paper/2203.08189/) (2022)
- [O(k)-Equivariant Dimensionality Reduction on Stiefel Manifolds](https://mlsanity.com/paper/2309.10775/) (2023)
- [Windowed Fourier Analysis for Signal Processing on Graph Bundles](https://mlsanity.com/paper/2302.05592/) (2023)
- [Learning Tangent Bundles and Characteristic Classes with Autoencoder Atlases](https://mlsanity.com/paper/2602.22873/) (2026)

## Abstract (arXiv)

We introduce varepsilon-approximate versions of the notion of Euclidean vector bundle for varepsilon ≥ 0, which recover the classical notion of Euclidean vector bundle when varepsilon = 0. In particular, we study vCech cochains with coefficients in the orthogonal group that satisfy an approximate cocycle condition. We show that varepsilon-approximate vector bundles can be used to represent classical vector bundles when varepsilon > 0 is sufficiently small. We also introduce distances between approximate vector bundles and use them to prove that sufficiently similar approximate vector bundles represent the same classical vector bundle. This gives a way of specifying vector bundles over finite simplicial complexes using a finite amount of data, and also allows for some tolerance to noise when working with vector bundles in an applied setting. As an example, we prove a reconstruction theorem for vector bundles from finite samples. We give algorithms for the effective computation of low-dimensional characteristic classes of vector bundles directly from discrete and approximate representations and illustrate the usage of these algorithms with computational examples.
