The tetrahedral property and a new Gromov–Hausdorff compactness theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

A new proof of the compactness theorem for propositional logic

The compactness theorem for propositional logic states that a demumerable set of propositional formulas is satisfiable if every finite subset is satisfiable. Though there are many different proofs, the underlying combinatorial basis of most of them seems to be Kόnig's lemma on infinite trees (see Smullyan [2], Thomson [3]). We base our proof on a different combinatorial lemma due to R. Rado [1]...

متن کامل

Strong Compactness and a Partition Property

We show that if Part(κ, λ) holds for every λ ≥ κ, then κ is strongly compact. Let κ be a regular infinite cardinal, and let λ ≥ κ be a cardinal. Pκ(λ) denotes the set of all subsets of λ of size less than κ. Part(κ, λ) means that for every F : Pκ(λ) × Pκ(λ) → 2, there is a cofinal subset A of (Pκ(λ),⊆) such that F is constant on the set {(a, b) ∈ A × A : a ⊂ b}. This definition is due to Jech [...

متن کامل

A Finite-Compactness Notion, and Property Testing

We investigate properties Π of graphs G of size N such that possession of Π by all f(N)-node subgraphs implies possession of Π by some g(N)-node subgraph. Bounds are given on f(N) and g(N) for bipartiteness. This is compared to a situation in property testing, where edge-induced subgraphs are involved and different, intuitively “better,” bounds are obtained. Bounds are discussed for other prope...

متن کامل

The Abstract Compactness Theorem revisited

The Abstract Compactness Theorem of Makowsky and Shelah for model theoretic logics is shown to be an immediate consequence of a general characterization of topological spaces having [ ; ]-compact products, when applied to spaces of structures endowed with the natural topology induced by the de…nable classes of a logic L. In this context, the notion of an ultra…lter U being related to L correspo...

متن کامل

A Compactness Theorem for the Yamabe Problem

In this paper, we prove compactness for the full set of solutions to the Yamabe Problem if n ≤ 24. After proving sharp pointwise estimates at a blowup point, we prove the Weyl Vanishing Theorem in those dimensions, and reduce the compactness question to showing positivity of a quadratic form. We also show that this quadratic form has negative eigenvalues if n ≥ 25.

متن کامل

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


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

ژورنال

عنوان ژورنال: Comptes Rendus Mathematique

سال: 2013

ISSN: 1631-073X

DOI: 10.1016/j.crma.2013.02.011