Currently displaying 1 – 9 of 9

Showing per page

Order by Relevance | Title | Year of publication

Structural aspects of truncated archimedean vector lattices: good sequences, simple elements

Richard N. Ball — 2021

Commentationes Mathematicae Universitatis Carolinae

The truncation operation facilitates the articulation and analysis of several aspects of the structure of archimedean vector lattices; we investigate two such aspects in this article. We refer to archimedean vector lattices equipped with a truncation as truncs. In the first part of the article we review the basic definitions, state the (pointed) Yosida representation theorem for truncs, and then prove a representation theorem which subsumes and extends the (pointfree) Madden representation theorem....

C- and C*-quotients in pointfree topology

We generalize a major portion of the classical theory of C- and C*-embedded subspaces to pointfree topology, where the corresponding notions are frame C- and C*-quotients. The central results characterize these quotients and generalize Urysohn's Extension Theorem, among others. The proofs require calculations in CL, the archimedean f-ring of frame maps from the topology of the reals into the frame L. We give a number of applications of the central results.

Flow compactifications of nondiscrete monoids, idempotents and Hindman’s theorem

Richard N. BallJames N. Hagler — 2003

Czechoslovak Mathematical Journal

We describe the extension of the multiplication on a not-necessarily-discrete topological monoid to its flow compactification. We offer two applications. The first is a nondiscrete version of Hindman’s Theorem, and the second is a characterization of the projective minimal and elementary flows in terms of idempotents of the flow compactification of the monoid.

Network character and tightness of the compact-open topology

Richard N. BallAnthony W. Hager — 2006

Commentationes Mathematicae Universitatis Carolinae

For Tychonoff X and α an infinite cardinal, let α def X : = the minimum number of α  cozero-sets of the Čech-Stone compactification which intersect to X (generalizing -defect), and let rt X : = min α max ( α , α def X ) . Give C ( X ) the compact-open topology. It is shown that τ C ( X ) n χ C ( X ) rt X = max ( L ( X ) , L ( X ) def X ) , where: τ is tightness; n χ is the network character; L ( X ) is the Lindel"of number. For example, it follows that, for X Čech-complete, τ C ( X ) = L ( X ) . The (apparently new) cardinal functions n χ C and rt are compared with several others.

Frame monomorphisms and a feature of the l -group of Baire functions on a topological space

Richard N. BallAnthony W. Hager — 2013

Commentationes Mathematicae Universitatis Carolinae

“The kernel functor” W k LFrm from the category W of archimedean lattice-ordered groups with distinguished weak unit onto LFrm, of Lindelöf completely regular frames, preserves and reflects monics. In W , monics are one-to-one, but not necessarily so in LFrm. An embedding ϕ W for which k ϕ is one-to-one is termed kernel-injective, or KI; these are the topic of this paper. The situation is contrasted with kernel-surjective and -preserving (KS and KP). The W -objects every embedding of which is KI are characterized;...

Monomorphisms in spaces with Lindelöf filters

Richard N. BallAnthony W. Hager — 2007

Czechoslovak Mathematical Journal

𝐒𝐩𝐅𝐢 is the category of spaces with filters: an object is a pair ( X , ) , X a compact Hausdorff space and a filter of dense open subsets of X . A morphism f ( Y , 𝒢 ) ( X , ) is a continuous function f Y X for which f - 1 ( F ) 𝒢 whenever F . This category arises naturally from considerations in ordered algebra, e.g., Boolean algebra, lattice-ordered groups and rings, and from considerations in general topology, e.g., the theory of the absolute and other covers, locales, and frames, though we shall specifically address only...

Combinatorial trees in Priestley spaces

Richard N. BallAleš PultrJiří Sichler — 2005

Commentationes Mathematicae Universitatis Carolinae

We show that prohibiting a combinatorial tree in the Priestley duals determines an axiomatizable class of distributive lattices. On the other hand, prohibiting n -crowns with n 3 does not. Given what is known about the diamond, this is another strong indication that this fact characterizes combinatorial trees. We also discuss varieties of 2-Heyting algebras in this context.

Page 1

Download Results (CSV)