English
Related papers

Related papers: Update: Remarks on Countable Tightness

200 papers

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

General Topology · Mathematics 2013-10-22 Marion Scheepers

There is a gap in Theorem 2.2 of the paper of Du (\cite{D_2010}). In this paper, we shall state the gap and repair it.

Functional Analysis · Mathematics 2011-02-14 Thabet Abdeljawad , Erdal Karapınar

We correct the proof of Theorem 4.1 from [C. R. Math. Acad. Sci. Soc. R. Can. \textbf{44} (2022), no. 4, 88--112].

Operator Algebras · Mathematics 2024-03-29 Chris Bruce , Charles Starling

It was pointed out to us that the proof of a crucial lemma (Lemma 5.3) in the paper is incorrect. Thus the approximation theorem (Theorem 0.1) for L^2 torsion of an amenable covering of a finite simplicial complex remains unproved. However,…

Differential Geometry · Mathematics 2007-05-23 Jozef Dodziuk , Varghese Mathai , Stuart Yates

Using approximation by continuous functions we prove the following statements to types of tightness in a space $Q_p(X, \mathbb{R})$ of all quasicontinuous real-valued functions with the topology $\tau_p$ of pointwise convergence: the…

General Topology · Mathematics 2025-03-06 Anton E. Lipin , Alexander V. Osipov

We give a new proof of a lemma by L. Shepp, that was used in connection to random coverings of a circle.

Classical Analysis and ODEs · Mathematics 2014-11-21 Tomas Persson

This note fills a gap in the article with title above [1]. We provide the proof of Equation (82) of Lemma 5 in [1] and thereby complete its power counting analysis with a more precise next-to-leading-order estimate.

High Energy Physics - Theory · Physics 2017-12-21 Joseph Ben Geloun , Vincent Rivasseau

Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An entropic proof of Chang's inequality. SIAM Journal on Discrete Mathematics, 28(1), pp.173-176.] we give a short information theoretic proof for Chang's lemma that is…

Discrete Mathematics · Computer Science 2020-05-25 Lianna Hambardzumyan , Yaqiao Li

Here we give a reformulation of a key lemma in the paper [2], "Spaces of Topological Complexity One", which is necessary due to an oversight.

Algebraic Topology · Mathematics 2019-09-11 Ramandeep Singh Arora

We prove that if $K$ is a compact space and the space $P(K\times K)$ of regular probability measures on $K\times K$ has countable tightness in its $weak^*$ topology, then $L_1(\mu)$ is separable for every $\mu\in P(K)$. It has been known…

Functional Analysis · Mathematics 2014-05-13 Grzegorz Plebanek , Damian Sobota

This is a technical report, containing all the lemma and proposition proofs in paper "Topological Constraints on Identifying Additive Link Metrics via End-to-end Paths Measurements" by Liang Ma, Ting He, Kin K. Leung, Don Towsley, and…

Networking and Internet Architecture · Computer Science 2021-01-05 Liang Ma , Ting He , Kin K. Leung , Don Towsley , Ananthram Swami

This text highlights issues present in the proof of Lemma 6.10 of the Baumgartner (1943 -- 2011) article "Almost disjoint sets, the dense set problem and the partition calculus" of 1976, and intends to present a correction at the same time…

Logic · Mathematics 2026-03-26 Júnio Luan Pereira

We present a solution of Exercise 1.2.1 of [2] which yields a short new proof of a key step in one of proofs of Brouwer's fixed point theorem, 1910. A few people asked the author about the details of the solution and they might be…

Classical Analysis and ODEs · Mathematics 2025-02-18 N. V. Krylov

Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the…

Computational Complexity · Computer Science 2012-05-17 Russell Impagliazzo , Cristopher Moore , Alexander Russell

New version of my 1998 article. The method of proof of the main results follows the original, but there are many simplifications/streamlining of arguments, especially Lemma 3.6 (new Lemma 3.7). Fixed small error in proof of lower bound for…

Number Theory · Mathematics 2013-07-16 Kevin Ford

In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.

Rings and Algebras · Mathematics 2020-02-18 Bui Xuan Hai

In this paper we get characterizations countable tightness, countable fan-tightness and countable strong fan-tightness of spaces of quasicontinuous functions with the topology of pointwise convergence from a open Whyburn $T_2$-space $X$…

General Topology · Mathematics 2024-01-29 Alexander V. Osipov

This is a technical report, containing all the theorem proofs and additional evaluations in paper "Network Capability in Localizing Node Failures via End-to-end Path Measurements" by Liang Ma, Ting He, Ananthram Swami, Don Towsley, and Kin…

Networking and Internet Architecture · Computer Science 2020-12-29 Liang Ma , Ting He , Ananthram Swami , Don Towsley , Kin K. Leung

We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.

Logic · Mathematics 2016-05-20 B. van den Berg , E. M. Briseid , P. Safarik

A uniformly continuously integrable sequence of real-valued measurable functions, defined on some probability space, is relatively compact in the $\sigma(L^1,L^\infty)$ topology. In this paper, we link such a result to weak convergence…

Functional Analysis · Mathematics 2021-08-10 Gane Samb Lo , Aladji Babacar Niang
‹ Prev 1 2 3 10 Next ›