Ω SU ( n ) does not Split in 2 Suspensions , for n ≥ 3

نویسندگان

  • MARK MAHOWALD
  • WILLIAM RICHTER
چکیده

Solving a conjecture of Hopkins and Mahowald, the second author [Ri] showed that Mitchell’s [Mi3] filtration {Fn,k}k=1 of ΩSU(n) splits stably, analogous to the Snaith [Sn2] splitting of BU . Crabb and Mitchell [C-M] then gave similar splittings of ΩU(n)/O(n) and ΩU(2n)/Sp(n). The first filtration Fn,1 is the inclusion CPn−1 ⊂ ΩSU(n), which was actually known to split off by the work of James [Ja], which was refined by Miller [Mi2]. James split ΣCPn−1 off SU(n), with a map J : SU(n) −→ ΩΣ ( ΣCPn−1 ) , whose loop Ω (J) : ΩSU(n) −→ ΩN+1ΣN+1CPn−1 splits CPn−1 stably off ΩSU(n). Cohen and Peterson [C-P], using Dyer-Lashof operations, showed that N > 2 for any such map J. However there is no Dyer-Lashof obstruction to factoring Ω (J) through Ω2Σ2CPn−1. That is, the image of Ω (J) consists only of monomials in H∗ ( CPn−1;Z/2 ) . The question arose: does there exist a map ρ : ΩSU(n) −→ Ω2Σ2CPn−1 which splits off CPn−1 stably? The existence of such a map ρ would have implied the stable splitting of ΩSU(n), provided the Mitchell-Segal [Mi3, Se1] group completion model ∐ k Fn,k ⊂ ΩU(n) has a C2-structure (cf. May [Ma3]). Following Snaith [Sn2], the k splitting map could have been constructed as the composite

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

ثبت نام

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

منابع مشابه

A new upper bound for the chromatic number of a graph

Let G be a graph of order n with clique number ω(G), chromatic number χ(G) and independence number α(G). We show that χ(G) ≤ n+ω+1−α 2 . Moreover, χ(G) ≤ n+ω−α 2 , if either ω + α = n + 1 and G is not a split graph or α+ω = n−1 and G contains no induced Kω+3−C5.

متن کامل

Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages

In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...

متن کامل

A Simpler Short Extenders Forcing - gap 3 Moti Gitik

Assume GCH. Let κ = ⋃ n<ω κn, 〈κn | n < ω〉 increasing, each κn is κ n – strong witnessed by (κn, κ +n+3 n ) – extender En. We would like to force 2 = κ preserving all the cardinals and without adding new bounded subsets to κ. It was done first in [2, Sec.3]. Here we present a different method of doing this. The advantage of the present construction is that the preparation forcing is split compl...

متن کامل

Small Subsets of the Reals and Tree Forcing Notions

We discuss the question of which properties of smallness in the sense of measure and category (e.g. being a universally null, perfectly meager or strongly null set) imply the properties of smallness related to some tree forcing notions (e.g. the properties of being Laver-null or Miller-null). 1. Notation and terminology Most of the notation used in this paper is standard. The symbol ω denotes t...

متن کامل

The Sum Graph of Non-essential Submodules

Throughout this paper, R will denote a commutative ring with identity and M is a unitary R- module and Z will denote the ring of integers. We introduce the graph Ω(M) of module M with the set of vertices contain all nontrivial non-essential submodules of M. We investigate the interplay between graph-theoretic properties of Ω(M) and algebraic properties of M. Also, we assign the values of natura...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 1997