For questions about the writing of proofs. But instead of focusing the mathematics behind the proof, these questions ask about the details and implementation of the proof.

learn more… | top users | synonyms

2
votes
3answers
37 views

Let $A$ be a subset of a topological space. Prove that $Cl(A) = Int(A) \cup Bd(A)$

Let $A$ be a subset of a topological space. Prove that $Cl(A) = Int(A) \cup Bd(A)$ Here are my defintions: Closure: Let $(X,\mathfrak T)$ be a topological space and let $ A \subseteq X$ . The ...
27
votes
4answers
1k views

What really is mathematical rigor? How can I be more rigorous?

I'm an undergraduate mathematics student who has received some constructive feedback from two instructors at the end of my exams. Namely, that I am a bit hand-wavey and not always very rigorous. While ...
1
vote
1answer
65 views

Question 7F from general topology by Stephen willard?

Can someone help me with 7F from Willard? In part two : $\mathbf{7}$F. Functions to and from the plane. The facts presented here for the plane will be proved in more generality for ...
2
votes
1answer
45 views

Do I write $f\in C^{-n}$ for an integrable function?

I have seen in a variety of texts that an $n$-differentiable function $f$ is written \begin{align} f\in C^{n}\Longleftrightarrow f^{\left(n\right)}\in C,\tag{1} \end{align} such as in Widder's ...
0
votes
0answers
27 views

A manifold with boundary in $\mathbb{R}^{n}$.

I want to show that the cylinder $C = \{ (x,y,z)\in\mathbb{R}^3: x^2 + y^2 = 1, 0 \le z \le 1 \}$ is a differentiable manifold with boundary, of dimension 2, this is: A subset $M \subset ...
0
votes
2answers
23 views

Define $f : X \rightarrow Y$ by $f(x) = y_0$ for every $x \in X$. Then $f$ is $\mathfrak T_1 - \mathfrak T_2$ continuous.

Suppose that $(X, \mathfrak T_1)$ and $(Y, \mathfrak T_2)$ are topological spaces and suppose $y_0 \in Y$. Define $f : X \rightarrow Y$ by $f(x) = y_0$ for every $x \in X$. Then $f$ is $\mathfrak ...
1
vote
1answer
43 views

Show that this is indeed a differentiable manifold with boundary.

I want to show that the cylinder: $$C = \{ (x,y,z)\in\mathbb{R}^3: x^2 + y^2 = 1, 0 \le z \le 1 \}$$ is indeed a a differentiable manifold with boundary, this means the following: A subset $M ...
3
votes
2answers
48 views

Proving UNIT INTERSECTION NP-complete [duplicate]

I am working on some review problems right now and am extremely stuck on how to solve problem - any help would be so appreciated. We are told to consider the following combinatorial problem: Unit ...
3
votes
1answer
128 views

Looking for help to clearly define a function that counts the number of twin primes in a range

My goal is to define a function that counts the number of twin primes between $q$ and $q^2$ where $q$ is any prime greater than $7$. I would like to do this using: The Sieve of Eratosthenes The ...
5
votes
3answers
142 views

Prove ten objects can be divided into two groups that balances each other when placed on the two pans of balance. [closed]

There are 10 objects with total weight 20, each of the weight being a positive integer. Given that none of the weights exceed 10, prove ten objects can be divided into two groups that balances each ...
0
votes
0answers
27 views

Simple Turing machine problems [duplicate]

I'm trying to go over some review problems regarding Turing Machine recognizability, and am still pretty confused about the following problems. This is the only information we are given in the problem ...
2
votes
1answer
52 views

Distributing identical objects into distinct boxes

The problem I'm trying to solve is: find the number of ways of distributing $r$ identical objects into $n$ distinct boxes such that no box is empty, where $r \geq n$. I've found conflicting answers ...
1
vote
1answer
39 views

Splitting parties into committees

I feel like this should be an extremely simple problem, but I can't quite figure it out. How many ways are there to split $2n + 1$ places in a committee among $3$ nonempty parties, such that a ...
0
votes
1answer
83 views

Density of Subgraphs

I am stuck trying to make sense of this review problem: Given a graph G(V, E), we say that the induced subgraph G(S) on a subset of vertices S ⊆ V is a subgraph of G whose vertex set is S and edge ...
0
votes
3answers
159 views

Proving prime number combinatorics

I am trying to figure out the following review problem: Let $p$ be a prime number and $a$ be a natural number. Prove that the following (parts 1, 2, 3 and 4) are true for every $p$ and $a$. Here, ...
0
votes
1answer
111 views

Turing Machine recognizability

I'm trying to go over some review problems regarding Turing Machine recognizability, and am still pretty confused about the following problems. This is the only information we are given in the problem ...
1
vote
1answer
107 views

Proving that Unit Intersection is NP-complete

I am extremely stuck on how to go about this problem and any help would be so appreciated. We are told to consider the following combinatorial problem: Unit Intersection: Let X = {1, 2,...,n}. ...
0
votes
0answers
21 views

Proof of an congruence modulo n [duplicate]

I've the following theorem: For $n\in\Bbb Z$, prove that $n^3\equiv n \pmod{6}$ Please check whether I produced a good proof: 1) Let $k,n\in\Bbb Z$ s.t. $6=kn$ since $n^{3}$ is congruent to $n ...
0
votes
1answer
26 views

Show that the tangent space of a manifold is a certain set.

Let $A\subset \mathbb{R}^n$ an open set, and $g:A\to \mathbb{R}$ continously differentiable such that $g'(x)\not=0 $ for $x\in A$. If $M = g^{-1}(\{0\})\not=\emptyset$, then I want to show that the ...
2
votes
2answers
35 views

If $A$ is a finite set in $(\mathbb R, \mathfrak T_U)$ then $A' = \emptyset$.

If $A$ is a finite set in $(\mathbb R, \mathfrak T_U)$ then $A' = \emptyset$. My knowledge: $\mathfrak T_U$ is the usual topology $A'$ is the set of all limit points and my definition for this is: ...
1
vote
1answer
46 views

Every complete axiomatizable theory is decidable

Enderton (in A Mathematical Introduction to Logic) gives the following theorems: Theorem $17$F : A set of expressions is decidable iff both it and its complement (relative to the set of all ...
1
vote
2answers
44 views

Properties of the deductive closure

Let $\Phi_0$ be the set of $\cal L$-sentences. For $\Gamma\subseteq\Phi_0$, the deductive closure of $\Gamma$ is given by $$\mathsf{Cn}(\Gamma)=\left\{\phi\in\Phi_0\mid\Gamma\vdash\phi\right\}$$ ...
5
votes
4answers
73 views

Show $x^n \geq x_1^n+x_2^n+\ldots+x_k^n \Bigg\vert x_1+x_2+\ldots+x_k = x, x \geq 0, n \geq 1, k\in\mathbb{Z}$

Hello StackExchange Community, This is my first post on the forum. Please forgive me for any errors with formatting and my expressions. I am working on the following proof: Show $$x^n \geq ...
44
votes
9answers
8k views

Is an irrational number odd or even?

My sister just asked this question to me: "Is an irrational number odd or even?" I told her that decimals are not odd or even and that does imply that not recurring and non repeating decimals will ...
1
vote
2answers
22 views

Help with induction step of proving a recursive definition / sequence

I'm a bit of a maths noob so please bear with me with what is probably a really dumb question, but I could really do with some help - I'm self-learning at home. I'm stuck on the question below from ...
0
votes
1answer
33 views

Proof that there is at most one perfect matching in a tree

I'm trying to understand this proof to prove that there is at most one perfect matching in a tree. Let M, M' be perfect matchings in the tree T = (V, E) and consider the graph on V with edge set ...
1
vote
5answers
66 views

Suppose that $A$ and $B$ are sets and that $f: A \rightarrow B$ is onto. Does being onto guarantee the sets are finite?

Suppose that $A$ and $B$ are sets and that $f: A \rightarrow B$ is onto. Determine which of the following statements are true: If $A$ is finite then $B$ is finite. If $B$ is finite, ...
0
votes
3answers
23 views

Prove that for any graph G the number of vertices multiplied by the lowest degree is $\le$ the number of edges multiplied by 2

For this proof. I know that number edges is half the sum of the degree sequence since vertices are connected only once. So if the edges are doubled that means, it will definitely be more than the ...
1
vote
1answer
41 views

Prove that if a graph has six vertices, then at least one of G or $\bar{G}$ has a subgraph isomorphic to $K_3$

I think this proof is related to proving to Theorem on friends and strangers which can be proved with the pigeonhole principle. But I am at a loss as to what are the holes and pigeons in this case. I ...
0
votes
2answers
41 views

Proving that there is a unique linear map such that $T(u_i)=v_i$.

I have a problem with understanding of a rather simple concept in linear algebra. I have seen in a book, a following question: Suppose $U,V$ are vector spaces over $K$ and $u_1,\dots,u_n$ is a ...
4
votes
2answers
31 views

Help setting out a proof about the circle $x^{2} + y^{2} + 2gx + 2fy + c = 0$

16. Given that the circle $$x^{2} + y^{2} + 2gx + 2fy + c = 0$$ touches the $y$-axis, prove that $f^{2} = c$. So, because the circle touches the $y$-axis, we know that there is a ...
0
votes
1answer
29 views

For every $A\in \mathcal {P}(U)$ there is a unique $B\in \mathcal{P}(U)$ such that for every $C\in \mathcal{P}(U)$, $C\cap A=C-B$

Pls help me out with the proof: For every $A\in \mathcal {P}(U)$ there is a unique $B\in \mathcal {P}(U)$ such that for every $C\in \mathcal {P}(U), C \cap A=C-B$. For the existence part, we have to ...
8
votes
1answer
59 views

Is there a standard name for this “continuous induction” principle?

I am working on a paper, and I want to prove that some statement $P(x)$ holds for every value of a parameter $x \in [0,\infty)$. I plan to proceed as follows: Show that $P(0)$; Show that if $P(x)$ ...
2
votes
1answer
67 views

Argue that if a sentence has a proof, then it is a tautology

This is a corollary of the soundness theorem, which states that for a set of formulas $\Phi$ (of propositional logic) and a formula $\alpha$ : $$\Phi\vdash\alpha\Longrightarrow\Phi\vDash\alpha$$ What ...
0
votes
1answer
25 views

Let T be a one-to-one linear transformation from $R^m$ to $R^n$ and B={$e_1$,$e_2$,…,$e_m$} a basis for $R^m$.

Prove that the set {T($e_1$),T($e_2$),...,T($e_m$)} is an independent set. Let T : $R^n$ → $R^m$ be a linear transformation. Then there exists a unique matrix A such that T(x) = Ax for all x in ...
2
votes
2answers
36 views

Suppose $\{v_1,v_2,v_3\}$ is a basis for some subspace $V$ of $\mathbb R^m$.

Let $b$ be a vector in that subspace. Prove that if $b$ is orthogonal to all three basis vectors, then b has to be a zero vector. Hint: What is $\|b\|$ I do not know how to start this proof. Thanks ...
7
votes
5answers
89 views

Show that if $g \circ f$ is injective, then so is $f$.

The Problem: Let $X, Y, Z$ be sets and $f: X \to Y, g:Y \to Z$ be functions. (a) Show that if $g \circ f$ is injective, then so is $f$. (b) If $g \circ f$ is surjective, must $g$ be surjective? ...
3
votes
3answers
58 views

Exhibit a bijective function $\Bbb Z \to \Bbb Z$ with infinitely many orbits

I've the following exercise: Give an example of a bijective function $\Bbb Z\rightarrow\Bbb Z$ with infinitely many orbits. What would be its infinite orbits?
1
vote
1answer
39 views

Injections from a set of functions to R

Show there is an injection from $\Bbb R^2 \to \Bbb R $ Does there exist an injection from $X \to \Bbb R$ where $X $ is the set of all functions where f(x)=x for all but finitely many x. This is a ...
4
votes
3answers
442 views

Prove that the integers $x$, $x+6$, $x+12$, $x+18$, $x+24$ can only be prime if $x$ is $5$.

Prove that the integers $x$, $x+6$, $x+12$, $x+18$, $x+24$ can only be prime if $x$ is $5$. I am very new to proofs and not completely sure of how to approach this one. I tried several different ...
1
vote
3answers
81 views

No continuous injective map $f: \mathbb{S}^1 \to \mathbb{R}$ [duplicate]

A friend asked me if there could be a continuous injective map $$f: \mathbb{S}^1 \to \mathbb{R}.$$ My intuition tells me no. Endow $\mathbb{S}^1$ with a topology $\mathscr{T}$ and fix a pole $x ...
1
vote
2answers
115 views

How can I find $(x,y)$ so that $x^y=y^x$, $x\neq y$? [duplicate]

I have found that there are two $(x,y)$ that fulfill the property that $x^y=y^x$, $x\neq y$: $(2,4)$ $(4,2)$ From this: How can I find more, if any? How can I prove that there are no other ...
1
vote
1answer
32 views

Show that if $\lim_{x \to a}f(x)=L$ then $f$ is bounded near $a$.

The Problem: Show that if $\lim_{x \to a}f(x)=L$ then $f$ is bounded near $a$, i.e. there are constants $C,M > 0$ such that $\left|f(x)\right|<M$ for all $x$ such that $\left|x-a\right| < ...
1
vote
2answers
57 views

Combinatorial Proof of falling factorial and binomial theorem

For $n,m,k \in \mathbb{N}$ is true: $$(n+m)^{\underline{k}}=\sum^{k}_{i=0}\binom ki \cdot n^{\underline{k-i}} \cdot m^{\underline{i}}$$ I can prove the binomial theorem for itself combinatorically ...
0
votes
1answer
35 views

Let $(X, \mathfrak T)$ be a topological space and supposed that A is a subset of X. Then $Bd(A) = Cl(A) \cap Cl(X-A)$.

Let $(X, \mathfrak T)$ be a topological space and supposed that A is a subset of X. Then $Bd(A) = Cl(A) \cap Cl(X-A)$. I know this is a true statement. I am trying to prove if because I would also ...
1
vote
2answers
154 views

Josephine problem

So the problem is Suppose there are 2n people in a circle; the first n are “good guys” and the last n are “bad guys.” Show that there is always an integer m (depending on n) such that, if we go ...
1
vote
0answers
35 views

people passing a bridge (a proof for a greedy algorithm)

the problem some people are passing a bridge . each one takes a different time to pass . assume the people are sorted by their passing time increasingly . these are the conditions of passing the ...
1
vote
1answer
56 views

Let $\mathfrak T_X = \{f^{-1} (U) : U \in \mathfrak T_Y\}$ then $\mathfrak T_X$ is a topology on X. False?

Let $f :X \rightarrow Y$ be a function and suppose that $\mathfrak T_Y$ is a topology on $Y$. Let $\mathfrak T_X = \{f^{-1} (U) : U \in \mathfrak T_Y\}$ then $\mathfrak T_X$ is a topology on X. ...
1
vote
4answers
31 views

A={n∈ℤ: 6∣n and 8∣n} and B={n∈ℤ: 48∣n}. Is A⊆B?

A={n∈ℤ: 6∣n and 8∣n} and B={n∈ℤ: 48∣n}. Is A⊆B? Is B⊆A? I'm pretty sure that they are subsets of each other, because any n that 6 and 8 would both divide would have to be divisible by 6*8, but I'm ...
1
vote
3answers
41 views

Prove there exists $m$ and $k$ such that $ n = mk^2$ where $m$ is not a multiple of the square of any prime.

For any positive integer $n$, prove that there exists integers $m$ and $k$ such that: $$n = mk^2 $$ where $m$ is not a multiple of the square of any prime. (For all primes $p$, $p^2$ does not divide ...