Skip to main content

All Questions

5 votes
2 answers
164 views

The question is the following: Given a cardinal $\kappa$, is there a dense linear order of size $\leq \kappa$ such that there are $2^\kappa$ cuts (a cut is a downward closed subset)? The question is a ...
Matteo Bisi's user avatar
0 votes
0 answers
64 views

Consider the dynamical map that terminates on all natural numbers: $f_o:x\mapsto (x+1)/2$ if $x$ odd $f_e:x\mapsto x/2$ if $x$ even This is easily proven to terminate for all natural numbers. Now ...
Robert Frost's user avatar
  • 9,768
2 votes
1 answer
112 views

Let $\mathcal{B}$ be a topological basis, let $\mathcal{P}$ be the topology generated by $\mathcal{B}$. Suppose we define $\mathfrak{P}$ to be the lattice generated by $(\mathcal{P},\subseteq )$. I ...
Co-'s user avatar
  • 64
0 votes
1 answer
61 views

I read that given a graph $G$, we say $S$ is a maximal subgraph of $G$ with property $p$ if for all $S'$ contained in $G$ which strictly contain $S$, then $S'$ does not have property $p$. I was ...
Francisco J. Maciel Henning's user avatar
0 votes
1 answer
58 views

Birkhoff (1967, sec. II.8) defines a "modular" poset: (1) When $x, y \in J$ and $x$ and $y$ both cover an element of $J$, then they are both covered by an element of $J$ (which may not be ...
Dale's user avatar
  • 501
2 votes
0 answers
115 views

Consider the binary relation $\gtrsim$ between topological spaces defined by $A \gtrsim B$ iff there exists a continuous (not necessarily bicontinuous!) bijection from $A$ to $B$. This relation is ...
tparker's user avatar
  • 6,950
2 votes
1 answer
125 views

I have heard that, from a constructive point of view, it is quite difficult to show that a given order $X$ is a well-order, i.e. each subset of $X$ has a minimum, or better constructivley $\forall_x(\...
Zermelo-Fraenkel's user avatar
1 vote
1 answer
55 views

Page 54, Set theory and logic, Book by Robert Roth Stoll. Unable to do exercise 11.6. There is no errata for Stoll textbook. I'm unable grasp the meaning of the last sentence: How can we form a ...
Iaroslav Baranov's user avatar
6 votes
1 answer
492 views

I would like to prove or disprove that the following: Given a set $X$, if two topologies $\tau_1$ and $\tau_2$ on $X$ are such that for all $\bar{x}=(x_i: i\in I)$ net on $X$ there is an element $x_1\...
Matteo Bisi's user avatar
5 votes
0 answers
191 views

The following is a collection of combinatorics theorems commonly refereed as "equivalent" due to one being easily derived from another. Theorem (Hall). A finite bipartite graph $G = (A\...
Alma Arjuna's user avatar
  • 7,009
7 votes
1 answer
132 views

For linear orders $L_1$ and $L_2$, the constructions of linear order addition and linear order multiplication are well-known, they are defined respectively using the disjoint union and cartesian ...
C7X's user avatar
  • 1,761
1 vote
0 answers
47 views

A binary relation $R$ is said to be cycle-free if there are no cycles in the relation, meaning, for every positive integer $n$, there are no $x_1,...,x_n$ such that $x_1Rx_2...Rx_1$. Also, a strict ...
user107952's user avatar
  • 24.8k
3 votes
1 answer
84 views

In Jech 9.13 he describes how to construct a normal Suslin tree from a given arbitrary Suslin tree. In the second step Jech adds new elements $a_C$ for chains $C = \{ x \in T_1 | x < y \}$ where $y ...
Johannes's user avatar
  • 137
0 votes
0 answers
25 views

Let the $n \times n$ real matrices ${\bf A}, {\bf B}$ be symmetric and positive semidefinite. If ${\bf A} \succeq {\bf B}$, can one conclude that ${\bf A}^{\frac12} \succeq {\bf B}^{\frac12}$, i.e., ...
Rodrigo de Azevedo's user avatar
0 votes
0 answers
63 views

Similar to how we think of divergence of $\mathbb{N}$ or $\mathbb{R}$ one can naturally inherit this concept to talk about divergence on those sets as with the std order. But what about in a more ...
IV-301's user avatar
  • 49

15 30 50 per page
1
2 3 4 5
298