Filters on a countable vector space
Iian B. Smythe

TL;DR
This paper explores combinatorial properties of filters generated by infinite-dimensional subspaces in a countable vector space, drawing analogies to selectivity and stability in ultrafilters.
Contribution
It introduces and analyzes new combinatorial properties of these filters, extending concepts from ultrafilter theory to vector space contexts.
Findings
Identifies key combinatorial properties of filters in vector spaces
Establishes implications between these properties
Draws parallels to ultrafilter properties on natural numbers
Abstract
We study various combinatorial properties, and the implications between them, for filters generated by infinite-dimensional subspaces of a countable vector space. These properties are analogous to selectivity for ultrafilters on the natural numbers and stability for ordered-union ultrafilters on .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Mathematical and Theoretical Analysis · Computability, Logic, AI Algorithms
