The Seidel Morphism of Cartesian Products

نویسنده

  • RÉMI LECLERCQ
چکیده

We prove that the Seidel morphism of (M × M , ω ⊕ ω) is naturally related to the Seidel morphisms of (M,ω) and (M , ω), when these manifolds are monotone. We deduce a condition for loops of Hamiltonian diffeomorphisms of the product to be homotopically non trivial. This result was inspired by and extends results obtained by Pedroza [P]. All the symplectic manifolds we consider in this note are closed. A symplectic manifold (M,ω) is strongly semi-positive if (at least) one of the following conditions holds (c1 denotes the first Chern class c1(TM,ω)): (a) there exists λ ≥ 0, such that for all A ∈ π2(M), ω(A) = λc1(A), (b) c1 vanishes on π2(M), (c) the minimal Chern number N (c1(π2(M)) = NZ) satisfies N ≥ n− 1. Under this assumption, Seidel introduced [S] a group morphism: qM : π̃1(Ham(M,ω)) −→ QH∗(M,ω) , where QH∗(M,ω) × denotes the group of invertible elements of QH∗(M,ω), the quantum homology of (M,ω). We recall that the identity of the groupQH∗(M,ω) × is the fundamental class of M , which is denoted [M ]. As usual, Ham(M,ω) denotes the group of Hamiltonian diffeomorphisms of (M,ω) and π̃1(Ham(M,ω)) is a covering of π1(Ham(M,ω)) which will be defined below. The inclusions of Ham(M,ω) and Ham(M , ω) in Ham(M × M , ω ⊕ ω) induce a map between the respective fundamental groups: ([g], [g]) 7→ [g, g], where [g, g] stands for [(g, g)], the homotopy class of the loop (g, g). The extension of this map to the coverings π̃1 is straightforward. We denote it by i : π̃1(Ham(M,ω))× π̃1(Ham(M , ω)) −→ π̃1(Ham(M ×M , ω ⊕ ω)). We also denote by κQ : QH∗(M,ω)⊗QH∗(M , ω) −→ QH∗(M ×M , ω ⊕ ω) the inclusion given by Künneth formula and the compatibility of the Novikov rings with the cartesian product (see §1 for definitions). Let (M,ω) and (M , ω) be strongly semi-positive symplectic manifolds and let φ ∈ π̃1(Ham(M,ω)) and φ ∈ π̃1(Ham(M , ω)). When (M ×M , ω⊕ω) is strongly semi-positive (this is not necessarily the case, see discussion in Remark 8), one can, on one hand, compute the images of φ and φ via the respective Seidel’s morphisms and then see the result as an element in QH∗(M ×M , ω ⊕ ω) via κQ. On the other hand, one can compute the image of i(φ, φ), via the Seidel morphism of the product. 2000 Mathematics Subject Classification. Primary 57R17; Secondary 57R58 57S05.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Seidel Signless Laplacian Energy of Graphs

Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...

متن کامل

Cartesian closed subcategories of topological fuzzes

A category $mathbf{C}$ is called Cartesian closed  provided that it has finite products and for each$mathbf{C}$-object $A$ the functor $(Atimes -): Ara A$ has a right adjoint. It is well known that the category $mathbf{TopFuzz}$  of all topological fuzzes is both complete  and cocomplete, but it is not Cartesian closed. In this paper, we introduce some Cartesian closed subcategories of this cat...

متن کامل

An existence theorem concerning strong shape of Cartesian products

The paper is devoted to the question is the Cartesian product X × P of a compact Hausdorff space X and a polyhedron P a product in the strong shape category SSh of topological spaces. The question consists of two parts. The existence part, which asks whether, for a topological space Z, for a strong shape morphism F : Z → X and a homotopy class of mappings [g] : Z → P , there exists a strong sha...

متن کامل

Different-Distance Sets in a Graph

A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...

متن کامل

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009