Primariness and the Primary Factorisation Property
Abstract
We study the relation between primariness of Banach spaces and the stronger operator-theoretic notions of the primary factorisation property (PFP) and the uniform primary factorisation property (UPFP). We revisit several classical primariness arguments and isolate the additional information needed to factor the identity through arbitrary operators. In the separable setting, this recovers quantitative factorisation versions of the Casazza--Kottman--Lin method for spaces with symmetric bases and treats the exceptional cases of 1 and ∞. We then develop support-reduction and free-selection tools for uncountable direct sums, allowing one to transfer primariness and the PFP/UPFP from countable building blocks to non-separable p-, c0- and more general symmetric sums. As applications, we obtain, among others, the primariness of C[0,1]* under the negation of the Continuum Hypothesis and UPFP results for uncountable sums of ordinal C(α)-spaces. Finally, using the finite-block representation of B(p), we prove a uniform primary factorisation theorem for the Banach space B(p), 1<p<∞, and end with open problems concerning the gap between primariness and factorisation.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.