It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 2.3K
- Chat 500
- Study Groups 19
- Petri Nets 9
- Epidemiology 4
- Leaf Modeling 1
- Review Sections 9
- MIT 2020: Programming with Categories 51
- MIT 2020: Lectures 20
- MIT 2020: Exercises 25
- MIT 2019: Applied Category Theory 339
- MIT 2019: Lectures 79
- MIT 2019: Exercises 149
- MIT 2019: Chat 50
- UCR ACT Seminar 4
- General 68
- Azimuth Code Project 110
- Statistical methods 4
- Drafts 2
- Math Syntax Demos 15
- Wiki - Latest Changes 3
- Strategy 113
- Azimuth Project 1.1K
- - Spam 1
- News and Information 147
- Azimuth Blog 149
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 713

Options

For some time I have been interested in closure operators in partially ordered sets whose elements are viewed as regions in some abstract space, something like point-free topology.

One interesting question is: Suppose that \( a \) is an element of a partially ordered set. Are there conditions that ensure there exists a collection \(E \) of elements, each of which is smaller than \( a \) but \( a \) is the least upper bound of \(E \)? If so, is there a sense in which the elements of \(E \) are as small as possible. Informally, maximize the amount of \( a \) that is generated by the set of elements. In a special case there is a theorem, the Krein-Milman theorem https://en.wikipedia.org/wiki/Krein–Milman_theorem, that applies to locally convex, Hausdorff, topological vector spaces that does just this.

A careful analysis of the proof of the Krein-Milman theorem shows that the statement of this theorem and its proof can be adapted so that a generalized version applies to partially ordered sets. The result of this analysis provides necessary and sufficient conditions for this result.

In a day or two I will post a proof of this result.

Again, thinking of elements of a partially ordered set as abstract regions, Suppose that \(A \) and \( B \) are to collections of elements, how does one say the regions in \(A \) "contain" the same part of the space as \( B \).

This is the kind of thing I like to do.

I would like to learn enough about category theory to translatematerial like this into the language of category theory.

## Comments

Your link is broken as it has a trailing ]

`Your link is broken as it has a trailing ]`

Thanks. The link works now.

`Thanks. The link works now.`

Hey Jay!

Welcome to the forums.

\(\LaTeX\) is a little non-standard on this website. You need to write

`\\( A \\)`

instead of`$A$`

for inline equations.`Hey Jay! Welcome to the forums. \\(\LaTeX\\) is a little non-standard on this website. You need to write `\\( A \\)` instead of `$A$` for inline equations.`

Matthew, corrected. Thanks!

`Matthew, corrected. Thanks!`

Great! I'm looking forward to your proof!

`Great! I'm looking forward to your proof!`

Welcome to the forum and course, Jay! It will be fun to see your result!

`Welcome to the forum and course, Jay! It will be fun to see your result!`