Skip to Content
  • Feature Paper
  • Article
  • Open Access

9 February 2026

10 Pages

A Formula for the Euler Characteristic of the Fiber Product of Morse Functions

Department of Mathematical Sciences, Faculty of Science, University of the Ryukyus, Nishihara-Cho, Okinawa 903-0213, Japan

Abstract

Let η : X → R be a Morse function on a connected closed manifold X. We denote by C ( η ) the fiber product of two copies of η . For Morse functions f : M → R and g : N → R , we define the function f ∗ g : M × N → R by ( f ∗ g ) ( p , q ) : = f ( p ) · g ( q ) . The purpose of this paper is twofold: Firstly, we study the sufficient condition for which χ ( C ( f ∗ g ) ) = χ ( C ( f ) ) · χ ( C ( g ) ) holds, where χ denotes the Euler characteristic. Secondly, for the case that f is the well-known Morse function on C P n , we determine χ ( C ( f ∗ f ) ) .

1. Introduction

1.1. Motivation

We consider the following question: Let
ρ : S n → R
be the height function defined by
ρ ( x 1 , … , x n + 1 ) = x n + 1 .
Assume that two particles u and v on S n move satisfying the condition ρ ( u ) = ρ ( v ) . Let C ( ρ ) be the space that is formed by all possible positions of u and v. What is the topology of C ( ρ ) ?
The answer is that there is a homeomorphism
C ( ρ ) ≈ S ( S n − 1 × S n − 1 ) ,
where S denotes the suspension.

1.2. The Essence of Morse Theory

We try to generalize the space C ( ρ ) in Section 1.1 for the case that the function is a Morse function. For the convenience of some readers, we recall the essence of Morse theory (see, for example, [1,2]). Let
η : X → R
be a smooth function on a connected closed manifold X. The following apply:
  • We say that a point u ∈ X is a critical point of η if d η u is the zero map.
  • We say that a critical point u is non-degenerate if the Hessian matrix of η at u is non-singular with respect to some coordinate system at u.
  • We say that Equation (3) is a Morse function if every critical point of η is non-degenerate.
  • The underlying idea of Morse theory is to study the topology of X by analyzing the Morse function η . The theory allows one to find CW structures and handle decompositions on X.

1.3. A Generalization of C ( ρ ) in Section 1.1

As in Equation (3), let η : X → R be a Morse function on a connected closed manifold X. We denote by C ( η ) the fiber product of two copies of η . More precisely, we set
C ( η ) : = { ( u , v ) ∈ X × X | η ( u ) = η ( v ) } .
About C ( η ) , the following results (i) and (ii) are already known:
(i) In [3], we proved a formula that describes χ ( C ( η ) ) in terms of the information on the critical points and their indices of η (see Lemma 2 for more details). Here throughout this paper, for a finite CW-complex K, let χ ( K ) denote the Euler characteristic of K.
(ii) Using the formula in (i), we determined χ ( C ( η ) ) when η is the well-known Morse function on the unitary group ([3]), and when η is the well-known Morse function on the Grassmannians ([4]).

1.4. Product of Morse Functions

Let f : M → R and g : N → R be Morse functions, where M and N are connected closed manifolds. We define the map
f ∗ g : M × N → R
by
( f ∗ g ) ( p , q ) = f ( p ) · g ( q ) , ∀ ( p , q ) ∈ M × N .
Remark 1. (i) It is to be noted that the notation f ∗ g is unrelated to the convolution in analysis.
(ii) It is well-known that if min f > 0 and min g > 0 , then f ∗ g is a Morse function (see Lemma 1 for more details).
(iii) It is clear that there is a homeomorphism
C ( f ∗ g ) ≈ C ( g ∗ f ) .

1.5. A Famous Example of f ∗ f

We recall a famous example of f ∗ f below. We define f : S 1 → R by f ( e i θ ) = 2 + cos θ . Then f ∗ f is given by
( f ∗ f ) ( e i θ 1 , e i θ 2 ) = ( 2 + cos θ 1 ) ( 2 + cos θ 2 ) .
Note that Equation (4) is the well-known Morse function on the torus such that the critical values of the two index-one critical points are the same (see, for example, (Ref. [1] p. 72, Exercise 2.4 and its answer in p. 205).)

1.6. A Question

From Section 1.4, we can construct a new Morse function f ∗ g from known Morse functions f and g. Assume that the following equation holds:
χ ( C ( f ∗ g ) ) = χ ( C ( f ) ) · χ ( C ( g ) )
Then we can compute χ ( C ( f ∗ g ) ) from χ ( C ( f ) ) and χ ( C ( g ) ) . But the following example shows that Equation (5) does not hold in general.
Example 1.
For i = 1 or 2, we define ζ i : S 1 → R as follows:
ζ 1 ( x 1 , x 2 ) = x 1 + 2 and ζ 2 ( x 1 , x 2 ) = 2 x 1 + 3 .
It is easy to see that
χ ( C ( ζ 1 ∗ ζ 1 ) ) = χ ( C ( ζ 2 ∗ ζ 2 ) ) = 6 but χ ( C ( ζ 1 ∗ ζ 2 ) ) = 4
(see also Example 3). The difference in Equation (7) is due to the fact that the critical values of the two index-one critical points of ζ i ∗ ζ i are the same, but that of ζ 1 ∗ ζ 2 are different.

1.7. Purpose

From Example 1, we naturally encounter the following Questions 1 and 2: Let f and g be as in Section 1.4.
  • Question 1. Does there exist a sufficient condition for which Equation (5) holds?
  • Question 2. Let f and g be the well-known Morse functions which do not satisfy the sufficient condition in Question 1. Then, what are the both sides of Equation (5)?
The purpose of this paper is to study Questions 1 and 2.

1.8. The Organization of This Paper

This paper is organized as follows. In Section 2 we recall auxiliary lemmas. In Section 3 we state our main results. In Section 4 we prove the main results. In Section 5 we state further numerical results.

2. Auxiliary Lemmas

Definition 1.
Let η be a Morse function as in Equation (3).
(i) We denote by V ( η ) the set of critical values of η.
(ii) If u is a critical point of η, then we denote the index of η at u by μ η ( u ) .
Lemma 1.
Let f : M → R and g : N → R be Morse functions, where M and N are connected closed manifolds. We assume that
min f > 0 and min g > 0 .
Then the following results hold:
(i) A point ( p , q ) ∈ M × N is a critical point of f ∗ g if and only if p is a critical point of f and q is a critical point of g.
(ii) Let ( p , q ) be a critical point of f ∗ g . Then
μ f ∗ g ( p , q ) = μ f ( p ) + μ g ( q ) .
Proof. 
The lemma is well-known (see, (Ref. [1], p. 72, Exercise 2.3 and its answer in p. 204)). □
Lemma 2
([3] Theorem A). Let η be a Morse function as in Equation (3). For ξ ∈ V ( η ) , let k be the number of the critical points contained in η − 1 ( ξ ) . We write the critical points contained in η − 1 ( ξ ) by u i for 1 ≤ i ≤ k .
We write μ η ( u i ) by λ i and we define the integer Ω ( η , ξ ) by
Ω ( η , ξ ) : = ∑ i = 1 k ( − 1 ) λ i .
Then we have
χ ( C ( η ) ) = ( − 1 ) dim X ∑ ξ ∈ V ( η ) ( Ω ( η , ξ ) ) 2 .
Example 3.
(i) Let ρ : S n → R be the Morse function in Equation (1). Then
χ ( C ( ρ ) ) = ( − 1 ) n · 2 .
Note that Equation (9) is in agreement with Equation (2).
(ii) For F = R , C or H , let η : F P n → R be the well-known Morse function (see Equation (12)). Then
χ ( C ( η ) ) = ( − 1 ) d n · ( n + 1 ) ,
where d : = dim R F .

3. Statement of the Main Results

Assumption 1.
Hereafter, we always assume that f and g satisfy Equation (8).
Firstly, modifying Lemma 2, we give a formula to compute χ ( C ( f ∗ g ) ) .
Theorem 1.
For ξ ∈ V ( f ∗ g ) , let k be the number of the critical points contained in ( f ∗ g ) − 1 ( ξ ) . We write the critical points contained in ( f ∗ g ) − 1 ( ξ ) by ( p i , q i ) for 1 ≤ i ≤ k .
We write μ f ∗ g ( p i , q i ) by λ i and we define the integer Ω ( f ∗ g , ξ ) by
Ω ( f ∗ g , ξ ) : = ∑ i = 1 k ( − 1 ) λ i .
Then we have
χ ( C ( f ∗ g ) ) = ( − 1 ) dim ( M × N ) ∑ ξ ∈ V ( f ∗ g ) ( Ω ( f ∗ g , ξ ) ) 2 .
Remark 2.
Theorem 1 is useful. In fact, using Lemma 1, we can determine ( p i , q i ) and λ i from the information on the critical points of f and g.
Example 3.
We define the Morse functions F k and G k : S k → R by
F k ( x 1 , … , x k + 1 ) = x 1 + 2 and G k ( x 1 , … , x k + 1 ) = 2 x 1 + 3 .
(Note that F 1 and G 1 equal to ζ 1 and ζ 2 which are defined in Equation (6).) Then we have
χ ( C ( F m ∗ F n ) ) = 6 , if m + n is even , − 2 , if m + n is odd ,
and
χ ( C ( F m ∗ G n ) ) = ( − 1 ) m + n · 4 .
Proof of Example 3.
 Note that V ( F m ∗ F n ) = { 1 , 3 , 9 } . The indices of the critical points in ( F m ∗ F n ) − 1 ( 3 ) are m and n. Hence
Ω ( F m ∗ F n , 3 ) = ( − 1 ) m + ( − 1 ) n .
Now Equation (10) follows from Theorem 1.
On the other hand, the critical values of the critical points of F m ∗ G n are mutually distinct. Hence Equation (11) follows. □
Secondly, in order to give an answer to Question 1 in Section 1, we introduce the following:
Assumption 2.
We define the map
P : V ( f ) × V ( g ) → R
by P ( a , b ) = a b . Then we assume that P is injective.
Now the following Theorem 2 is an answer to Question 1:
Theorem 2.
Let f : M → R and g : N → R be Morse functions which satisfy Assumptions 1 and 2. Then Equation (5) holds.
Example 4.
We give an example for which Assumption 2 holds. We regard C P n = S 2 n + 1 / S 1 . We define f n : C P n → R by
f n ( [ z 0 , z 1 , … , z n ] ) : = ∑ i = 0 n ( i + 1 ) | z i | 2 .
On the other hand, we fix a positive transcendental number α. (For example, we can set α = e or π.) We define g n : C P n → R by
g n ( [ z 0 , z 1 , … , z n ] ) : = ∑ i = 0 n α i | z i | 2 .
By [2], f n and g n are Morse functions. Moreover, f n and g n satisfy Assumption 2: In fact, note that
V ( f n ) = { 1 , 2 , … , n + 1 } and V ( g n ) = { 1 , α , … , α n } .
Since α is a transcendental number, Assumption 2 is in fact satisfied.
Thirdly, we consider Question 2. The following Theorems 3 and 4 are our results:
Definition 2.
Let n be a positive integer.
(i) We set
δ ( n ) : = ϕ 11 ϕ 12 ϕ 21 ϕ 22 ( |       the following conditions ( a ) and ( b ) hold .
Here
(a) 
For 1 ≤ i , j ≤ 2 , ϕ i j is an integer such that 1 ≤ ϕ i j ≤ n + 1 .
(b) 
ϕ 11 ϕ 22 = ϕ 12 ϕ 21 .
(ii) We set Δ ( n ) : = | δ ( n ) | , where | | denotes the cardinality.
Theorem 3.
For f n in Equation (12), we have
χ ( C ( f n ∗ f n ) ) = Δ ( n ) .
Remark 3. (i) The values of Δ ( n ) for small n are given in [5]. Using the result, we obtain the following Table 1 about χ ( C ( f n ∗ f n ) ) for n ≤ 10 .
Table 1. χ ( C ( f n ∗ f n ) ) for n ≤ 10 .
We have from Example 2 (ii) that χ ( C ( f n ) ) = n + 1 . Hence Table 1 shows that Equation (5) does not hold when f = g = f n for n ≥ 1 .
(ii) We set
J ( n ) : = χ ( C ( f n ∗ f n ) ) − 12 π 2 n 2 log n .
Then using the result in [6] (see also [5]), we obtain
lim n → ∞ J ( n ) n 2 = − 0.51131 … .
Remark 4.
The R P n -version of Table 1 will be given in Table 2. But the results are not so simple.
Theorem 4.
For f n in Equation (12), we have
χ ( C ( f 1 ∗ f n ) ) = 3 n + 3 , if n is odd , 3 n + 2 , if n is even .
Remark 5.
The right-hand side of Equation (14) is introduced in [7] as the sequence of integers which are congruent to 0 or 2 mod 6.

4. Proofs of the Main Results

Proof of Theorem 1.
 If we consider f ∗ g for η in Lemma 2, then Theorem 1 follows. □
Proof of Theorem 2.
 Let ξ ∈ V ( f ∗ g ) . Recall that in Theorem 2, we assume the truth of Assumption 2. Then there exists uniquely ( a , b ) ∈ V ( f ) × V ( g ) such that a b = ξ .
We shall prove that
Ω ( f ∗ g , ξ ) = Ω ( f , a ) · Ω ( g , b ) .
In fact, we write the critical points in f − 1 ( a ) by p i for 1 ≤ i ≤ ℓ . Similarly, we write the critical points in g − 1 ( b ) by q j for 1 ≤ j ≤ m . Then Lemma 1 tells us that the critical points in ( f ∗ g ) − 1 ( ξ ) are given by ( p i , q j ) for 1 ≤ i ≤ ℓ and 1 ≤ j ≤ m .
We set α i : = μ f ( p i ) and β j : = μ g ( q j ) . Then
Ω ( f ∗ g , ξ ) = ∑ 1 ≤ i ≤ ℓ 1 ≤ j ≤ m ( − 1 ) α i + β j = ∑ i = 1 ℓ ( − 1 ) α i · ∑ j = 1 m ( − 1 ) β j = Ω ( f , a ) · Ω ( g , b ) .
Hence Equation (15) holds.
Now we complete the proof of Theorem 2. Combining Theorem 1 and Equation (15), we have
χ ( C ( f ∗ g ) ) = ( − 1 ) dim ( M × N ) ∑ ξ ∈ V ( f ∗ g ) ( Ω ( f ∗ g , ξ ) ) 2 = ( − 1 ) dim M ∑ a ∈ V ( f ) ( Ω ( f , a ) ) 2 · ( − 1 ) dim N ∑ b ∈ V ( g ) ( Ω ( g , b ) ) 2 = χ ( C ( f ) ) · χ ( C ( g ) ) .
Hence Equation (5) holds. □
Proof of Theorem 3.
 Note that
min V ( f n ∗ f n ) = 1 and max V ( f n ∗ f n ) = ( n + 1 ) 2 .
For ξ ∈ V ( f n ∗ f n ) , we set
Γ ξ : = { ( a , b ) ∈ Z × Z | 1 ≤ a , b ≤ n + 1 and a b = ξ } .
Since the critical values of the critical points of f n are mutually distinct, we have
| Γ ξ | = Ω ( f n ∗ f n , ξ ) .
On the other hand, we set
δ ( n , ξ ) : = ϕ 11 ϕ 12 ϕ 21 ϕ 22 ∈ δ ( n ) ( |       ϕ 11 ϕ 22 = ϕ 12 ϕ 21 = ξ ,
where δ ( n ) is defined in Equation (13).
We claim that there is a bijection
R : Γ ξ × Γ ξ → δ ( n , ξ ) .
In fact, if we define R by
R ( ( a 1 , b 1 ) , ( a 2 , b 2 ) ) = a 1 a 2 b 2 b 1 ,
then R is a bijection. Hence Equation (17) holds.
Combining Equations (16) and (17), we have
( Ω ( f n ∗ f n , ξ ) ) 2 = | δ ( n , ξ ) | .
Then combining Theorem 1 and Equation (18), we have
χ ( C ( f n ∗ f n ) ) = ∑ ξ = 1 ( n + 1 ) 2 ( Ω ( f n ∗ f n , ξ ) ) 2 = ∑ ξ = 1 ( n + 1 ) 2 | δ ( n , ξ ) | = | δ ( n ) | = Δ ( n ) .
This completes the proof of Theorem 3. □
Proof of Theorem 4.
 We set
I n : = { 1 , 2 , 3 , … , n + 1 } and J n : = { 2 , 4 , 6 , … , 2 ( n + 1 ) } .
It is clear that
V ( f 1 ∗ f n ) = I n ∪ J n .
Let ξ be an element of Equation (19). Then
Ω ( f 1 ∗ f n , ξ ) = 2 , if ξ ∈ I n ∩ J n , 1 , if ξ ∉ I n ∩ J n .
(i) The case that n = 2 m + 1 .
Since I n ∩ J n = { 2 , 4 , 6 , … , 2 m + 2 } , we have from Theorem 1 that
χ ( C ( f 1 ∗ f n ) ) = 4 · ( m + 1 ) + 2 m + 2 = 3 n + 3 .
(ii) The case that n = 2 m .
Since I n ∩ J n = { 2 , 4 , 6 , … , 2 m } , we have from Theorem 1 that
χ ( C ( f 1 ∗ f n ) ) = 4 m + 2 m + 2 = 3 n + 2 .       □

5. Further Numerical Results

Proposition 1.
Similarly to Equation (12), we define h n : R P n → R by
h n ( [ x 0 , x 1 , … , x n ] ) : = ∑ i = 0 n ( i + 1 ) x i 2 .
Then the following Table 2 holds:
Table 2. χ ( C ( h n ∗ h n ) ) for n ≤ 10 .
Proof. 
Using Theorem 1, we can prove Proposition 1 easily. □
Remark 6.
We explain why Table 1 and Table 2 are different for n = 3 . There are three critical points in ( f 3 ∗ f 3 ) − 1 ( 4 ) and ( h 3 ∗ h 3 ) − 1 ( 4 ) . The critical points correspond to the expressions of 4 as a product of two positive integers: 1 × 4 , 2 × 2 and 4 × 1 . The indices of these critical points are 3 d , 2 d and 3 d , where
d : = 2 , for the case f 3 ∗ f 3 , 1 , for the case h 3 ∗ h 3 .
This implies that
Ω ( f 3 ∗ f 3 , 4 ) = 3 and Ω ( h 3 ∗ h 3 , 4 ) = − 1 .
This is the reason why the tables are different for n = 3 .
Proposition 2.
For n ≥ 1 , let T ( n ) be the connected sum of n copies of ( S 1 ) 2 . Let k n : T ( n ) → R be the usual height function. More precisely, k n has 2 n + 2 critical points such that the critical values of any two critical points are distinct. Then the following Table 3 holds:
Table 3. χ ( C ( k n ∗ k n ) ) for n ≤ 10 .
Proof. 
Using Theorem 1, we can also prove Proposition 2 easily. □

6. Conclusions

Let f : M → R and g : N → R be Morse functions. We define the function f + g : M × N → R by
( f + g ) ( p , q ) : = f ( p ) + g ( q ) , ∀ ( p , q ) ∈ M × N .
Then f + g is also a Morse function. We can use f + g when we prove the Künneth formula using the Morse homology (see, for example, [8]).
It may be interesting to study how the results in this paper are changed when we consider f + g instead of f ∗ g . This is our further task.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the author.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Matsumoto, Y. An Introduction to Morse Theory; Translations of Mathematical Monographs; American Mathematical Society: Providence, RI, USA, 2002; Volume 208. [Google Scholar]
  2. Milnor, J. Morse Theory; Annals of Mathematics Studies; Princeton University Press: Princeton, NJ, USA, 1963; Volume 51. [Google Scholar]
  3. Kamiyama, Y. The Euler characteristic of the fiber product of Morse functions. Bull. Korean Math. Soc. 2025, 62, 71–80. [Google Scholar] [CrossRef]
  4. Kamiyama, Y. The Euler characteristic of the fiber product of Morse functions on Grassmannians. Int. J. Math. Math. Sci. 2025, 2025, 8418617. [Google Scholar] [CrossRef] [Scilit]
  5. On-Line Encyclopedia of Integer Sequences. Sequence #A134506. Available online: https://oeis.org/A134506 (accessed on 27 January 2026).
  6. Ayyad, A.; Cochrane, T.; Zheng, Z. The congruence x1x2=x3x4(mod p), the equation x1x2=x3x4, and mean values of character sums. J. Number Theory 1996, 59, 398–413. [Google Scholar] [CrossRef] [Scilit]
  7. On-Line Encyclopedia of Integer Sequences. Sequence #A047238. Available online: https://oeis.org/A047238 (accessed on 27 January 2026).
  8. Audin, M.; Damian, M. Morse Theory and Floer Homology; Universitext; Erné, R., Translator; EDP Sciences: Les Ulis, France; Springer: London, UK, 2014. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.