Petrie conjecture

(Difference between revisions)
Jump to: navigation, search
Line 4: Line 4:
Petrie restricted his attention to smooth actions of the Lie group $S^1$, the circle {{cite|Petrie1972}} (or more generally, the torus $T^k$ for $k \geq 1$ {{cite|Petrie1973}})
Petrie restricted his attention to smooth actions of the Lie group $S^1$, the circle {{cite|Petrie1972}} (or more generally, the torus $T^k$ for $k \geq 1$ {{cite|Petrie1973}})
on closed smooth manifolds $M$ which are [[Fake complex projective spaces|homotopy equivalent to $\CP^n$]].
+
on closed smooth $2n$-manifolds $M$ which are [[Fake complex projective spaces|homotopy equivalent to $\CP^n$]].
{{beginthm|Conjecture|{{cite|Petrie1972}}}}
{{beginthm|Conjecture|{{cite|Petrie1972}}}}

Revision as of 03:31, 1 December 2010

This page has not been refereed. The information given here might be incomplete or provisional.

Introduction

The Petrie conjecture was formulated in the following context: suppose that a Lie group G acts smoothly and non-trivially on a closed smooth manifold
Tex syntax error
, what constraints does this place on the topology of M in general and on the Pontrjagin classes of
Tex syntax error
in particular.

Petrie restricted his attention to smooth actions of the Lie group S^1, the circle [Petrie1972] (or more generally, the torus T^k for k \geq 1 [Petrie1973]) on closed smooth 2n-manifolds M which are homotopy equivalent to \CP^n.

Conjecture 0.1 [Petrie1972].

Suppose that
Tex syntax error
is a closed smooth 2n-manifold homotopy equivalent to \CP^n and that S^1 acts smoothly and non-trivially on
Tex syntax error
. Then the total Pontrjagin class p(M) of
Tex syntax error
agrees with that of \CP^n, i.e., for a generator x \in H^2(M; \mathbb{Z}),
\displaystyle p(M) = (1+x^2)^{n+1}.
Petrie [Petrie1973] has shown that the total Pontrjagin class of
Tex syntax error
agrees with that of \CP^n if the action of S^1 on
Tex syntax error
extends to a smooth action of T^n.

The Petrie conjecture has not been confirmed in general, but if \dim M \leq 8, the statement is true by the work of [Dejter1976] and [James1985].

According to [Hattori1978], the conjecture is also true if
Tex syntax error
admits an invarint almost complex structure with the first Chern class c_1(M) = (n+1)x. Another special cases

where the Petrie conjecture holds are described by [Wang1975], [Yoshida1976], [Iberkleid1978], [Muslin1978], [Tsukada&Washiyama1979], and

[Masuda1981]. Moreover, by the work of [Dessai2002], the Petrie conjecture holds if \dim M \leq 22 and the action of S^1 on
Tex syntax error
extends to an appropriate action of Pin(2). Similarly, the work of [Dessai&Wilking2004] confirms the Petrie conjecture under the assumption that \dim M \leq 8k-4 and the action of S^1 on
Tex syntax error
extends to a smooth action of T^k

for k \geq 1.

A symplectic version of the Petrie conjecture is discussed in the article of [Tolman2010].

References

Personal tools
Namespaces
Variants
Actions
Navigation
Interaction
Toolbox