Daugavet spaces satisfy λ(Y,X)=1+λ(W,X*) for finite-codim Y, enabling subspaces of C[0,1] with arbitrary λ≥2 where the defining infimum is not attained.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.FA 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The authors isolate additional conditions for primary factorization, develop support-reduction tools for uncountable sums, prove primariness of C[0,1]* under negation of CH, and establish a uniform primary factorization theorem for B(ℓ_p).
citing papers explorer
-
Finite-codimensional subspaces of Daugavet spaces: projection constants and minimal projections
Daugavet spaces satisfy λ(Y,X)=1+λ(W,X*) for finite-codim Y, enabling subspaces of C[0,1] with arbitrary λ≥2 where the defining infimum is not attained.
-
Primariness and the Primary Factorisation Property
The authors isolate additional conditions for primary factorization, develop support-reduction tools for uncountable sums, prove primariness of C[0,1]* under negation of CH, and establish a uniform primary factorization theorem for B(ℓ_p).