0
votes
0answers
16 views

Ingredients for Proving that a set is bounded below

I am having a hard time to really understand the definition of bounded below. The definition states : Let S be a nonempty subset of real numbers, we say S is bounded below if there is a c ∈ ℝ ...
2
votes
1answer
91 views

Defining a partial order on $A\times B$, given partial orders on $A$ and on $B$

Let $(A,\preceq_A)$ and $(B,\preceq_B)$ be partially ordered sets. Define $C = A \times B$ and define the relation $\preccurlyeq$ on $C$ to be $(a,b) \preccurlyeq$ $(a',b')$ if and only if ...
3
votes
1answer
24 views

Partitioning a totally ordered set into three subsets according to the order

Consider a set $S$, and a total order $R$ over that set. Part (a) Given some element $e \in S$, explain why it is possible to partition $S$ into the following three sets: $$S_1 = \{ x \in S ...
0
votes
1answer
18 views

Diagonal Relation as a poset I - establishing the result by vacous truth

I have a problem with the logic behind the fact that, given a nonempty set X, the diagonal relation $D_X := \{ (x,x) : x \in X \}$ is a partial order on $X$. More specifically, my problem is with ...
4
votes
1answer
50 views

Problems with a proof that -in a linear order- a minimal element is the smallest element

I have a problem with a proof I found in Velleman's "How to prove it". This is sort of interesting, because it is the very first time I cannot see the structure of a proof presented in the book. The ...
0
votes
0answers
27 views

Shorten a proof using Galois connections

Consider a Galois connection: $f:R\rightarrow F$ is a lower adjoint of $r:F\rightarrow R$ for partially ordered sets (actually complete lattices) $F$ and $R$. We have also $f(r(g))=g$ for every $g\in ...
2
votes
0answers
94 views

Back-and-Forth Argument vs. “One-Way” Argument

The wikipedia article on the Back and Forth Argument claims at the end: If we iterated only step $(1)$, rather than going back and forth, then in some cases the resulting function from A to B ...
5
votes
1answer
63 views

Question about sets of well-orders and isomorphisms between well-orders

I was thinking about this problem in trying to better get a feel for and understand well-orders (I'm trying to learn some set theory) - right now, I'm not really hoping for anybody to supply me with a ...
0
votes
1answer
45 views

Prove transitivity of partial ordered set in lattice.

Prove transitivity of partial ordered set in lattice. I am given this If $(A, \le_{A})$ is a lattice and C is a set, $([C \rightarrow A], \le)$ is also a lattice. And $\rightarrow$ is defined as ...
1
vote
1answer
21 views

Finding order properties in the relation $aSb \iff \exists k \in \mathbb{N} : b = ak$

An order relations exercise I just did. I think it's fine, but the second proof felt a bit too wordy or discursive, instead of going straight to the point with brief and accurate statements. How could ...
7
votes
0answers
261 views

Proving equivalence of a tree-based version of Countable Choice for families of finite sets.

In this paper by Good and Tree, the following result is mentioned without proof as part of Proposition 6.5: Each of the following statements imply those beneath it. The countable union of ...
5
votes
2answers
301 views

Ordering the field of real rational functions

Perusing the Wikipedia article on ordered fields, I encountered an interesting statement, a variation of which I am now trying to prove. Basically, I am trying to show that the set of real rational ...
2
votes
1answer
65 views

Proof for a creating a partition of a countable set using chains in partial orders.

Definition: A partition of a set $A$ is a set of nonempty subsets of $A$ called the blocks of the partition, such that  every element of $A$ is in some block, and  if $B$ and $B'$ are different ...
0
votes
2answers
347 views

how to show equivalence relation and its classes

i am stumbling again in proving things in maths. the task is to prove that this statement $A \sim B : \Longleftrightarrow \sum_{a\in A} a = \sum_{b\in B} b $ is an Equivalence Relation on Power Set ...
2
votes
0answers
203 views

Examples of proofs by induction with respect to relations that are not strict total orders.

I have read this Wikipedia article and found it fascinating. I came across it after I tried to prove a certain statement with a method resembling induction in the set of natural numbers but ordered by ...