Geometric signals
Abstract.
In signal processing, a signal is a function. Conceptually, replacing a function by its graph, and extending this approach to a more abstract setting, we define a signal as a submanifold of a Riemannian manifold (with corners) that satisfies additional conditions. In particular, it is a relative cobordism between two manifolds with boundaries. We define energy as the integral of the distance function to the first of these boundary manifolds. Composition of signals is composition of cobordisms. A ”time variable” can appear explicitly if it is explictly given (for example, if the manifold is of the form ). Otherwise, there is no designated ”time dimension”, although the cobordism may implicitly indicate the presence of dynamics. We interpret a local deformation of the metric as noise. The assumptions on allow to define a map that we call a Fourier transform. We prove inequalities that illustrate the properties of energy of signals in this setting.
Keywords: energy, information, Fourier transform, Riemannian manifold
1. Introduction
This paper is about a geometric generalization of the concept of signal. The goal is to build an abstract mathematical model of transmitting information via geometric objects which are, informally speaking, higher dimensional analogues of sound waveforms. We are not taking the most obvious path to defining a signal as an -valued function on an open subset of manifold. Instead, we are taking a more intuitive approach with cobordisms. This would allow to treat quite general geometric objects as information.
In practical applications, signal processing involves sampling, analog to digital conversion, quantization, and mathematical techniques that are needed because of the hardware used to receive and analyze the signal. We will concentrate our attention on the geometric concept of signal, rather than being concerned with digitizing such a signal or further processing the resulting data.
For background discussion, let’s consider the word ”dot”. It can be transmitted as a finite sequence of three images, of the letters ”D”, ”O”, ’T”, respectively. Each of the three images can be converted into digital data (e.g. by drawing the letters on the grid paper via shading appropriate squares and entering in the corresponding matrix for each shaded square, for every blank square Fig. 1).

Alternatively, the three letters can be represented by the binary representations of the numbers 4, 15, 20 (their positions in the English alphabet). Or, instead, one can send the word ”dot” as an audio file ( a recording of a person saying this word), or the wave soundform of this recording (which can be subdivided into three parts, each for one of the three letters of the word Fig. 2).

The mathematical aspects of these processes depend on the choice of sampling, quantization, encoding, transmission, other procedures related to speech processing, as well as the linguistics aspects such as the language and the alphabet (if the written language is based on an alphabet). For details see [1], [5].
Instead of doing all that, we can concentrate only on the geometric aspects and consider the immersed submanifolds of (with the standard Riemannian metric) that correspond to the data on Fig. 1, 2. This is the general point of view in this paper. In order to account, intuitively, for a ”process” or ”evolution” taking place, without explicitly defining a time variable, we use cobordisms.
There is a vast amount of literature on applications of Riemannian geometry and its generalizations to signal processing, information theory, and computer science. It would be an impossible task to give a survey of this suject and to assign proper credit to all contributors. Here is an attempt to give a glimpse of this area. Work by Belkin and Niyogi, and co-authors, including [7], [8], [9], presents an intriguing vision. Broadly, one could view their approach as smoothing out the discrete data (or continuously approximating the discrete data). Typically the data sets are large and the data is put into a smooth manifold. Since every smooth manifold has a Riemannian metric, the analytic tools of Riemannian geometry are readily available. Similar reasoning supports the appearance of submanifolds in machine learning (see e.g. Ch. 6 [3]), with linear and nonlinear methods in dimensionality reduction. This also echoes the general philosophy of topological data analysis, most naively described as applying topological methods to discrete data mapped into a metric space. A particular kind of Riemannian manifolds is used in information geometry (see e.g. the discussion and references in Nielsen’s survey [17]). In Menon’s work [15] there are some interesting points about submanifolds, as well as regularity and numerical methods. In particular, he states that an embedding is an information transfer.
Most generally, geometric aspects are often intrinsic to the numerical analysis, including effectiveness, accuracy, errors, in papers devoted to applications in a variety of areas, including, for instance, image processing, neural networks, or analysis of electromagnetic data (see [4], [10], [16], [19] as some specific citations).
In mathematics, the interplay between geometry (e.g. manifolds) and analysis (e.g. functions on this manifold) is often pursued via proving theorems that determine to what extent one determines the other (e.g. reconstruction theorems in noncommutative geometry, that allow to ”rebuild” a manifold from its algebra of functions etc.; or no-go theorems, that say what can not happen on a manifold). An example of such work, with results that show how a manifold structure determines behaviour of certain functions on this manifold, is [2].
In the present paper, we depart from this perspective. For example, instead of a function , we can consider its graph which is a subset of the -plane. Generalizing this, we can consider an arbitrary curve in , or an arbitrary subset of the plane and consider this subset to be ”data” or ’information” or ”signal”. There is no longer a need for it to be a graph of a function and there is no need to keep track of the global geometry of . Everything that we need to know about this curve should be localized on . The setting in this paper involves cobordisms. In a follow up paper [6] we use a more general definition, instead. We essentially view arbitrary geometric objects as signal/information and it also potentially allows for flexibility that, intuitively, should be needed to quantify local events that occur in neural networks.
Acknowldegements. The valuable comments and suggestions from the reviewers are appreciated by the author.
2. Cobordisms as signals
Let be an integer. Let and be closed -dimensional oriented manifolds such that and is a -dimensional (oriented) cobordism, i.e. is a compact -dimensional oriented manifold with the boundary

Let and be closed -dimensional oriented manifolds and let is a -dimensional (oriented) cobordism. In general, all boundaries will be assumed to be nonempty where appropriate, and when we talk about a cobordism, as above, it will be assumed that , and are nonempty and .
Let be a -dimensional cobordism between manifolds with nonempty boundaries (or, a relative cobordism) in the sense of [11], i.e. is a -dimensional cobordism, , , , and
Assume, moreover, that
and , are -dimensional cobordisms. is a manifold with corners [13]. Figure 4 shows an example where , the boundary of consists of two points and the boundary of consists of two points.

Example 2.1.
For applications, a simplest typical example would be , is a compact smooth surface with the boundary which is the disjoint union of circles (), is a disjoint union of circles, is a disjoint union of circles, , . In Figure 3, . In Figure 5, and . Such could model a neuron or a part of a neural network. To take into account the electromagnetic field, one could consider submanifolds of .

Let be a Riemannian manifold such that (a subset of which is an embedded submanifold via the inclusion map). We will write for equipped with the Riemannian metric induced by . Unless explicitly stated otherwise, we will also assume that the Riemannian metric on every submanifold of is the one induced by . In Figure 4, . Figure 6 shows a relative cobordism with as in Example 2.1, , , , and .

Denote by the volume form of and by the Riemannian distance with respect to . Define
by . Since is compact, is well defined and continuous on . Similarly, define
by .
Remark 2.2.
Denote . Define
-
•
the energy of the signal
(1) -
•
the Fourier transform of the signal as the map of cobordisms of manifolds with boundary
induced by the identity map
-
•
the energy of the Fourier transform of the signal
-
•
a noise where is an open set and is a Riemannian metric on such that on . Then
-
•
a filter a signal , such that , , , , and .
-
•
composition of two signals , such that and is the signal
where
We assume .
Remark 2.3.
If there is no ambiguity about the metric and the metric is presumed to be the one induced by , then we will sometimes omit from notation and write , similarly for volume, diameter etc.
Remark 2.4.
In signal processing, a discrete signal is represented by a finite sequence of real numbers . These come (via sampling) from the sound waveform and should be understood as the numbers that represent the air pressure at time . The signal is characterized by its energy
and magnitude . The energy of a continuous one-dimensional signal is
(2) |
The concept of energy in Riemannian geometry is different and the value of energy for a curve in is not the same integral as the integral (2) typically used in signal processing. One can modify the signal so that (2) becomes the Riemannian energy for the modified signal. It is possible to write a similar argument that explains how our definition of energy (1) relates to the other definitions, at least in a very simple low dimensional setting. We will discuss this in detail in upcoming work [6], where we will also consider the meaning of Fourier transform and noise (which is sometimes defined as the Fourier tranform of autocorrelation).
Remark 2.5.
To give an example of noise (noise as a local distortion of the metric, as stated in the list of definitions above), one can consider a small ball in and either a conformal deformation of the metric supported on or a local diffeomorphism that is the identity map on , and the metric .
Recall (see e.g. section 3.2 [14]) that the (boundary) injectivity radius of is defined as follows. Let be the normal bundle of (in ), trivialized by the inward unit normal vector field . Identify with via this trivialization. For , denote by the geodesic such that and . Let . The boundary exponential map
is defined on the subset of that consists of pairs with . The number is defined as the supremum of such that is a diffeomorphism onto its image. The boundary injectivity radius of is defined similarly.
Theorem 2.6.
Let be a signal.
Then
Let be noise, where
for some and . Let and let .
Then there is a smooth function such that
(3) |
(4) |
and as
where
Let be noise as in and let be a filter such that , , , . Then
Remark 2.7.
In Theorem 2.6 the function , in a sense, modulates the noisy signal, from to . In , filters out the noise.
Theorem 2.8.
Let be the composition of signals and . Then
(5) |
(6) |
3. Proofs
Proof of Theorem 2.6.
By the mean value theorem, there is such that
and there is such that
Since and are compact, there are and such that and . Let . Then
(7) |
There is a neighborhood of in and a diffeomorphism
defined by the normal exponential map. Let
Let be an open cover of by manifold charts and let be a smooth partition of unity subordinate to . Then
(8) |
where , . Denote by the coordinates in the -th chart. Using the Fubini theorem, we get that (8) equals
By the mean value theorem, there is such that
(9) |
Then
where is the measure on induced by the Riemannian metric. Hence
Then, with (7), we get
Repeating the argument for , we get:
This completes the proof of .
Proof of . Let be a smooth partition of unity subordinate to the open cover
Then the function defined by
The Maclaurin series for
yields the desired statement.
Proof of .
Since , , and , both inequalities follow. ∎
Proof of Theorem 2.8.
4. Conclusions
In signal processing, a signal is a function (typically, a function of time). See e.g. [18], Chapter zero. In this paper, we define a signal to be a submanifold of Riemannian manifold, with extra conditions: it is a (relative) cobordism between two manifolds with boundary, and , and moreover, is also a cobordism between two other manifolds with boundaries, and . We give examples. In particular, instead of a function of time, we would now consider its graph. This definition allows to define a self-map of , which we call a Fourier transform. We define energy, which is a positive real number that characterizes a strength of the signal. Our definition is different from the standard Riemannian geometry definition and from the standard signal processing definition. We compare the three in the follow up paper [6]. We say that noise is a local deformation of the metric, which makes sense since everything is bounded. We say that a modified signal filters out the noise if it is not affected by the noise. Composition of signals is composition of cobordisms. We prove energy inequalities. These inequalities give an idea about the behaviour of energy. This paper was intended as a step towards a geometric framework in the discussion of signals. We discuss applications in [6].
References
- [1] J. Allebach, K. Chandrasekar. Digital Signal Processing in a Nutshell. 2nd ed. E-book, volumes 1, 2.
- [2] N. Alluhaibi, T. Barron. On vector-valued automorphic forms on bounded symmetric domains. Annals of Global Analysis and Geometry 55 (2019), issue 3, 417-441.
- [3] E. Alpaydin. Introduction to Machine Learning. 3rd ed. Cambridge, Massachusetts, The MIT Press, 2014.
- [4] K. Arai. Image Restoration based on Maximum Entropy Method with Parameter Estimation by Means of Annealing Method. International Journal of Advanced Computer Science and Applications 2020 11(8), paper 33.
- [5] Tom Bäckström, Okko Räsänen, Abraham Zewoudie, Pablo Pérez Zarazaga, Liisa Koivusalo, Sneha Das, Esteban Gómez Mellado, Mariem Bouafif Mansali, Daniel Ramos, Sudarsana Kadiri and Paavo Alku, Introduction to Speech Processing, 2nd Edition, 2022. https://speechprocessingbook.aalto.fi
- [6] T. Barron, S. Kelly, C. Poulton. Signals as submanifolds, and configurations of points. In preparation.
- [7] M. Belkin, P. Niyogi. Laplacian Eigenmaps for Dimensionality Reduction and Data Representation. Neural Computation (2003) 15 (6), 1373-1396.
- [8] M. Belkin, P. Niyogi. Towards a theoretical foundation for Laplacian-based manifold methods. J. Comput. System Sci. 74 (2008), no. 8, 1289-1308.
- [9] M. Belkin, P. Niyogi, V. Sindhwani. Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res. 7 (2006), 2399-2434.
- [10] V. Christodoulou, Y. Bi, G. Wilkie. A Fuzzy Shape-Based Anomaly Detection and Its Application to Electromagnetic Data. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, vol. 11 (2018), no. 9, pp. 3366-3379.
- [11] M. Borodzik, A. Némethi, A. Ranicki. Morse theory for manifolds with boundary. Algebr. Geom. Topol.16 (2016), no. 2, 971-1023.
- [12] R. Foote. Regularity of the distance function. Proc. Amer. Math. Soc. 92 (1984), no.1, 153-155.
- [13] G. Laures. On cobordism of manifolds with corners. Trans. Amer. Math. Soc. 352 (2000), no. 12, 5667-5688.
- [14] H. Liu. A compactness theorem for hyperkähler 4-manifolds with boundary. Duke Math. J. 173 (2024), no. 6, 1177-1225.
- [15] G. Menon. Information theory and the embedding problem for Riemannian manifolds. In Geometric science of information, Lecture Notes in Comput. Sci., 12829, pp. 605-612; Springer, Cham, 2021.
- [16] E. Merdivan, A. Vafeaidis, D. Kalatzis, S. Hanke, J. Kropf, K. Votis, D. Giakoumis, D. Tzovaras, L. Chen, R. Hamzaoui, M. Geist. Image-Based Text Classification using 2D Convolutional Neural Networks. 2019 IEEE SmartWorld, Ubiquitous Intelligence and Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI), Leicester, UK, 2019, pp. 144-149.
- [17] F. Nielsen. An elementary introduction to information geometry. Entropy 22 (2020), no.10, Paper 1100.
- [18] R. Priemer. Introductory signal processing. World Scientific Publ.,1991.
- [19] M. Yuan, W. Wang, X. Luo, C. Ge, L. Li, J. Kurths, W. Zhao. Synchronization of a Class of Memristive Stochastic Bidirectional Associative Memory Neural Networks with Mixed Time-Varying Delays via Sampled-Data Control. Math. Problems Eng. (2018), article ID 9126183.