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

0
votes
2answers
73 views

Showing convergence rigourously

So I have $f_n(x) = x^{4n} + \frac1{n^2}$ which I know converges to $f(x)=0$ uniformly on interval $[0,1)$, but how can I show this with rigour? Is this acceptably rigourous? $\lim ...
1
vote
4answers
33 views

Lowest possible value of a function with derivative greater than 2

I have the following two problems, and want to attempt to solve them with Mathematical rigour(which I don't yet possess): Suppose that $f$ is differentiable on $[1,4]$ and is such that $f(1) = 10$ ...
0
votes
0answers
29 views

Matrix Saddle Points and Dominance

I was teaching myself about dominance relations and saddle points after a friend of mine started discussing it with me and how it can be used in games. I wanted to know how to prove a problem like ...
0
votes
1answer
33 views

Proof regarding division with a remainder

Let $a\in\mathbb{Z},n\in\mathbb{N}$. If $a$ has a remainder $r$ when divided by $n$, then $a\equiv r\pmod n$ I've done some of these questions before with modulus and division, but I'm unsure of how ...
2
votes
5answers
67 views

Proof regarding divisibility

if $n\in\mathbb{Z}$, then $4$ does not divide $(n^2 - 3)$ I'm not sure how to approach this question, I know how to do questions that involve proving that it does divide but I'm unsure of how to do ...
0
votes
2answers
24 views

Modulus related proof help

I need to prove this via either direct proof, or contrapositive. Unsure of the best way to approach this. if $a \equiv b\mod n$ and $c \equiv d\mod n$, then $ac \equiv bd\mod n$ So far I have: ...
2
votes
4answers
62 views

Prove that if product of matrices is singular, one of the matrices is singular.

I'm having trouble with this proof, it would be much easier to work out the other way it seems. Let $A$ and $B$ be square matrices of equal size. Prove that if $\det(AB) = 0 =C$ then either $A$ or ...
1
vote
1answer
30 views

Proof about isometries, symmetry and reversing orientation.

Suppose $f:\mathbb{R} \rightarrow \mathbb{R}$ is an isometry of the reals. Prove that $f$ is a symmetry around a point if and only if $f$ reverses orientation of $\mathbb{R}$. The orientation of ...
2
votes
2answers
112 views

Proving the roots of a polynomial are irrational

This is a homework question so I'm just looking for some guidance. Basically we are asked to write a step by step proof in the form of assume/then statements for: $\forall x \in \mathbb{R}, ax^2 + ...
1
vote
2answers
35 views

Contrapositive proof using rule of divisibility

Suppose $x,y,z$ are integers and $x \neq 0 $ if $x$ does not divide $yz$ then $x$ does not divide $y$ and $x$ does not divide $z$. So far I have: Suppose it is false that $x$ does not divide $y$ and ...
0
votes
1answer
33 views

Proof about symmetry in isometries.

Suppose $f: \Bbb R \rightarrow \Bbb R$ is an isometry of the reals. Prove that $f$ is a symmetry about a point if and only if $f$ has a unique fixed point. Part 1: The assumption is $f$ is a ...
1
vote
3answers
35 views

Proof about isometries

Suppose $f\colon\mathbb R\to\mathbb R$ is an isometry of the reals. Prove $f$ is a non-trivial translation iff $f$ has no fixed points. Assumption: $f$ is a non-trivial translation (trivial ...
0
votes
0answers
38 views

finite subset topology

Let $X$ be a set and $\tau=\left\{X\right\}\,\cup\,\{u_i\subset X|u_i \text{ is finite}\}$. Is $\tau$ is a topology on $X$? My effort to show this is as follows: 1) $X\in\tau$ by definition and ...
2
votes
3answers
27 views

Help complete proof ('or' statement in conclusion): $a^2 \ge 7a \Rightarrow a\le0 \text { or } a\ge7$

Question Prove that if $a$ is a real number such that $a^2 \ge 7a$ then $a\le0 \text { or } a\ge7$ My Attempt We are given: $a \in \mathbb{R}$ $a^2 \ge 7a$ And need to prove: $a\le 0 \text{ ...
2
votes
1answer
35 views

Set difference between power sets

Show that if $A$ and $B$ are sets then $\varnothing \notin \mathcal P(A) − \mathcal P(B)$ . My Attempt: If $A$ and $B$ are sets, then $ \varnothing \subseteq A $ since the empty set is subset of ...
7
votes
4answers
581 views

What is the correct way of disproving a mathematical statement?

This question is motivated by my midterm exam. In this exam there was a question as follow: Question: If the following statement is true, prove it, otherwise disprove it. If $\mathbf{u}$ and ...
0
votes
1answer
19 views

question about the Darboux integral theorem proof

well, the sentence goes like this: Consider $f$ bounded function in $[a,b]$. $f$ is integrable IF AND ONLY IF $\forall\epsilon >0$ $\exists$ a partition $P$ of $\left[a,b\right]$ such that ...
1
vote
1answer
50 views

How to prove a very basic algorithm by induction

I just studied proofs by induction on a math book here and everything is neat and funny: the general strategy is to assume the LHS to be true, and use it to prove the RHS (for the inductive step). Now ...
2
votes
0answers
57 views

Simple Proofs in ZFC Set Theory

So I'll keep this real short and simple. In this document on page 23 there is a list of axioms. On page 24 there is a list of theorems that come from said axioms. I can prove them all except 3 and 5. ...
1
vote
1answer
31 views

Prove that $\dfrac{\sigma_1(n)}{n} = \sigma_{-1}(n)$ where $\sigma_x(n)$ is the sum of the $x$th powers of the positive divisors of $n$.

I computed $\dfrac{\sigma_1(n)}{n}$ and $\sigma_{-1}(n)$ on a good hundred values of $n$, and they seem to always match. For example: $\dfrac{\sigma_1(6)}{6} = \dfrac{1 + 2 + 3 + 6}{6} = ...
6
votes
4answers
653 views

The role of 'arbitrary' in proofs

Generally, when one is going to prove a result regarding a set of elements, they begin their proof with those first few pleasing words: "Suppose...is an arbitrary element in..." My question is, why ...
2
votes
2answers
90 views

Proof by induction that $(1^3 + 2^3 + 3^3+\cdots+n^3) = (1 + 2 + \cdots + n)^2$

I'm sitting with the proof in front of me, but I do not understand it. $$A = \{n \in Z^{++} \mid (1^3 + 2^3 + 3^3+\cdots+n^3) = (1 + 2 + \cdots + n)^2\}$$ The first step of proof by induction is ...
1
vote
0answers
40 views

What is the relationship between division and proving an integer is odd?

I am trying to use proof by contradiction to prove: $101$ is an odd integer. I know that the first step is to assume that $101$ is even, so: $101 = 2q, q \in \mathbb{Z}$ Then I am stuck. I don't ...
2
votes
2answers
97 views

How to prove that the law of the excluded middle is necessary?

This is a follow up question to this answer by Carl Mummert to the question whether every proof with contradiction can also be proved without contradiction. As Carl Mummert pointed out, there are ...
1
vote
1answer
23 views

Prove that every subgraph of forest has at least one vertex of degree < 2

So I know that a forest is a graph that has no cycles. This is what I had in mind: Assume that we have the subgraph T, which has two options: to be connected or not. if it's connected it has to be a ...
3
votes
2answers
18 views

How do I eliminate mod from an expression?

If I have an expression such as $$ x = ((a \bmod b) - s) \bmod t, \quad 0 < a < b $$ And I want to step to $$ x = (a - s) \bmod t $$ Is acceptable to jump straight from the first expression to ...
4
votes
3answers
714 views

What is the relation A = B = C called in a proof?

When writing a proof if I have the relationship $$ A = B = C $$ And I want to use that to prove $$ A = C $$ I remember there being some term for it. What is that term, and what would be an ...
0
votes
2answers
36 views

Let $F$ be a field and $x, y\in F$. Prove:

Use field axioms to prove: a) $(−1) · (−x) = x $ b) If $x · y = 0$ then $x = 0$ or $y = 0$ I don't understand how to approach these questions. Does the field include $1$ and $0$ as well?
0
votes
1answer
51 views

Winning or Non-losing strategy for A or B

Find a winning or a non-losing strategy for the following game: Consider $25$ sticks arranged in a $5$ x $5$ square. Players alternately take any number of sticks from a single row or column. At ...
2
votes
1answer
32 views

$\frac{|| \overline{AM}||}{|| \overline{AB}||}=\frac{|| \overline{AN}||}{|| \overline{AC}||}=\frac{|| \overline{MN}||}{|| \overline{BC}||}$

$\Delta ABC$ is a triangle, $M$ is a point in the segment $\overrightarrow{AB}$ and $N$ is a point in the segment $\overrightarrow{AC}$, such that $\overrightarrow{MN}$ is parallel to ...
1
vote
3answers
62 views

Use induction to prove that $2^n$ divides $(2n)!$ for any $n\in\mathbb{Z}_{\geq0}.$ [duplicate]

Use induction to prove that $2^n$ divides $(2n)!$ for any $n\in\mathbb{Z}_{\geq0}.$ How would you do the inductive step for this proof? I have the base case done.
1
vote
5answers
47 views

Matrix Power Formula

Prove that for a fixed $a \in \mathbb{R}$ we have the matrix power formula for all $n \in \mathbb{Z}_+$: $$\begin{pmatrix}a & 1\\0 & a\end{pmatrix}^n = \begin{pmatrix}a^n & ...
2
votes
1answer
44 views

Question about $e^T$ where T is a transformation

First off, I'm given a matrix $A$ s.t. the characteristic polynomial of $A$ is $p(a) = (-1)^nx^n+x^2-x+2$ and am asked to find $det(A^k)$ for a natural $k$ and $det(e^A)$. So from the polynomial I get ...
0
votes
4answers
147 views

Singleton sets are a subset

I am tasked with prove the following elementary result. I am concerned about being rigours enough in my proof: $$a\in S \iff \{a\} \subseteq S $$ My Attempt: Suppose $\{a\} \subseteq S $ . Then ...
3
votes
0answers
39 views

Do I need to use induction to have sufficient rigor in this proof?

I'm taking my first analysis class this summer. The professor asked us to prove that $a^{2n}-b^{2n}$ is divisible by $a+b$. After dorking around with the first couple of $n$ I was able to come up ...
2
votes
3answers
72 views

Beginner Proof about Primes

I am interested in understand the proof of infinitely many primes. It seems like quite an easy proof, ( I know there are many but I am referring to the proof that goes as follows); " Suppose there ...
0
votes
2answers
75 views

Prove that if $n^2 - 1$ is divisible by a prime number $p$ such that $n - 1$ is not divisible by $p$, then $n + 1$ is also divisible by $p$.

If this proposition is false, please give at least $3$ counter-examples, and try to modify the proposition so that it becomes true. If the proposition is true, please try to prove this even more ...
1
vote
5answers
98 views

If $a, b$ are relatively prime proof.

Prove that if $a$ and $b$ are relatively prime integers and $ab$ is a perfect square so are $a$ and $b$. Show by counterexample that the relatively prime condition is necessary. I dont know how ...
-3
votes
2answers
35 views

Proofs for modular arithmetic

$\rm(a)$ Prove that for any pair $a,b$ of positive integers there are integers $x,y\in\Bbb Z$ such that $ax+by=\gcd(a,b).\ $ (Hint: Use the well-ordering principle on the set of integer linear ...
0
votes
1answer
13 views

How do I derive a contradiction from an assumption that is “not asymmetric”

Let $R$ be a transitive relation on a set $A$. Define another relation, $S$, such that, for any $x,y \in A$, $Sxy$ iff $Ryx$. Moreover, let $S$ be irreflexive. Prove: $S$ is asymmetric on $A$. ...
2
votes
3answers
55 views

Metric Space, Induced topology

I'm trying to show that the metric topology is indeed a topology. To do so, I want to show the following three statements are true: $\emptyset$ and X are in $\tau$ finite intersections of open sets ...
1
vote
2answers
71 views

Projections are open maps. Why might I be wrong?

I got this problem from Munkres, my idea is similar, but comparing to the actual solution, I missed at least 4 steps. Prove that the projection maps $\pi_1 : X \times Y \to X$ and $\pi_2 : X ...
2
votes
2answers
79 views

Is there a “rule of thumb” of what can be reasonably omitted from a proof at the graduate student level?

As someone entering graduate school this fall, this is something I would like to know. For undergraduates, I know that professors generally want students to show very rigorously and clearly their ...
0
votes
2answers
62 views

How would this problem need the Mean Value Theorem?

I'm asked to square the inequality and use the Mean Value Theorem to prove that $$\sqrt{1+x} < 1 + \frac{x}{2}$$ for $x>0$. Unfortunately, I don't really understand why I would need such a ...
2
votes
2answers
44 views

Free and bound variables in “if” statements

The assertion $x>2$ is true when we replace $x$ by a number greater than $2$($3$ for example) and false if we replace it by $1$. But the assertion $\forall x(x>2)$ is false. In the first case ...
0
votes
0answers
26 views

U-substitution proof by partitions

I am trying to prove integration by substitution, i.e. for $f:[c,d] \rightarrow \mathbb{R}$ continuous and $\phi: [c,d] \rightarrow [a,b]$ continuous on $[c,d]$ and $C^1$ on $(c,d)$. Then define ...
2
votes
1answer
44 views

Proving a theorem on limits

I need to prove that: If $$\lim_{(x,y) \to (a,b)}f(x,y)= 0 \text{ and } g(x,y)\leq k,$$ then: $$\lim_{(x,y) \to (a,b)}f(x,y) g(x,y) =0.$$ My approach is like follow: ...
3
votes
2answers
78 views

Idea of a proof by contradicton

Is the idea of a contradiction to prove that the desired conclusion is both true and false or can it be any derived statement that is true and false (not necessarily relating to the conclusion)? Or ...
0
votes
0answers
19 views

complete logic for proving inequalities

Last semester I took a course on algorithm analysis a big part of which was proving that the running time function of a program was in the set $O(f(x))$ for some $f$. To prove $f\in O(g(x))$ one ...
1
vote
2answers
41 views

Show a double-sided infinite integral of $\sin(x+b)$ exists iff $b=n\pi$

More formally: Show that $$\lim_{a\rightarrow \infty} \int_{-a}^a \sin(x+b)$$ exists if and only if $b=n\pi$ for some $n \in \mathbb{Z}$. I get the intuition fine. The function is just a horizontal ...