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
0answers
31 views

Differentiability and $L^1, L^2$ spaces

If $f\in L^1(\mathbb{R})$ then $\frac{d}{dx}\{f(x)\}\in L^1(\mathbb{R})$ where we have given that $f$ is of compact support.
2
votes
2answers
29 views

Proof of multiplicative inverse for polar complex numbers [duplicate]

Use the polar form of complex numbers to show that every complex number $z\neq0$ has multiplicative inverse $z^{-1}$. If $z=a+bi$, then the polar form is $z=r(\cos(\alpha)+i\sin(\alpha))$. I can do ...
0
votes
0answers
44 views

Prove that a defined function g is continuous for a certain point

Consider the set of rational numbers $\mathbb{Q}$ equipped with the subspace topology inherited from $\mathbb{R}$. Let $c \in \mathbb{R}$. Define the function $g_{c}: \mathbb{Q} \to \mathbb{Q}$ via: ...
1
vote
3answers
38 views

Proof for complex numbers and square root

Use the polar form of complex numbers to show that every complex number $z\neq0$ has two square roots. I know the polar form is $z=r(\cos(\alpha)+i \sin(\alpha))$. I'm just not sure how to do this ...
1
vote
2answers
47 views

Use polar complex numbers to find multiplicative inverse

Use the polar form of complex numbers to show that every complex number $z\neq0$ has multiplicative inverse $z^{-1}$. If $z=a+bi$, then the polar form is $z=r(cos(\alpha))+i(sin(\alpha))$. I can do ...
2
votes
2answers
72 views

Prove that a function of the rational numbers $\mathbb{Q}$ with subspace topology inherited from $\mathbb{R}$ is injective

Consider the set of rational numbers $\mathbb{Q}$ equipped with the subspace topology inherited from $\mathbb{R}$. Suppose $g: \mathbb{R} \to \mathbb{R}$ and $h: \mathbb{R} \to \mathbb{R}$ are ...
0
votes
1answer
58 views

A set $A \subseteq \mathbb{R}$ is closed if and only if every convergent sequence in $\mathbb{R}$ completely contained in A has its limit in A

Real analysis is a topic I'm unfamiliar with and I'm confused on how to write proofs on them. In order to prove that: A set $A \subseteq \mathbb{R}$ is closed (1) $\iff$ Every convergent sequence in ...
0
votes
2answers
39 views

Prove that if g is injective, f is injective

$f \colon A \to \mathbb R$ be a function (where $A$ is some set) and define the function $g \colon A \to \mathbb R$ as $g(x) = 3 (f(x))^2 + 1.$ Prove if $g$ is injective then $f$ is injective How do ...
2
votes
3answers
73 views

Limit of $(1+ x/n)^n$ when $n$ tends to infinity [duplicate]

Does anyone know the exact proof of this limit result? $$\lim_{n\to\infty} \left(1+\frac{x}{n}\right)^n = e^x$$
1
vote
1answer
49 views

Help prove $f:X \rightarrow Y$ is an injection $\Leftrightarrow$ $f:X\rightarrow Y$ is a surjection when $|X|=|Y|$

I need to prove: Given non-empty finite sets $X$ and $Y$ with $|X| = |Y|,$ a function $X\rightarrow Y$ is an injection if and only if it is a surjection. The hint given is to use the pigeonhole ...
4
votes
3answers
40 views

Does continuity of $f$ imply $f^{-1}(\bar A)\subset\overline{f^{-1}(A)}$?

I'm struggling to prove or disprove that the continuity of $f$ implies $f^{-1}(\bar A)\subset\overline{f^{-1}(A)}$. $f:X\to Y$ is a map between metric spaces $(X,d),(Y,d')$ while $\bar M$ denotes the ...
0
votes
1answer
43 views

Help to prove the existance of a function

Let $f:X \rightarrow Y$ be a function. Prove that there exists a function $g:Y \rightarrow X$ such that $f \circ g = I_Y$ if and only if $f$ is a surjection. I need help on proving the following: ...
0
votes
1answer
34 views

Proving theorems on relations

I came across the following three statements about relations. I understand why the statements are true, but I am not sure how to demonstrate them mathematically. In the following, $A,B$ are sets and ...
0
votes
3answers
25 views

A property regarding intervals

While I was solving a problem on TopCoder I used the following assumption. I have n intervals: $ [a_1,b_1], [a_2,b_2],...,[a_n,b_n]$ and a number $T$ such that: $$ a_1 + a_2 + ... + a_n \leq T \leq ...
1
vote
0answers
8 views

Finding posterior of normal distributions and logistic regression.

$P(w_0 | x) = \frac{1}{1 + e^{-log\frac{P(x|w_0)}{P(x|w_1)}-log\frac{P(w_0)}{P(w_1)}}}$ Note: x = $[x_1, \dots, x_d]^T$; a $d$ dimensional vector. $w$ can take on one of two values: $w_0$ or $w_1$. ...
1
vote
1answer
101 views

Question about proving that a finite intersection of big unions is a big union of finite intersections

Let $I_{1}$,...$I_{k}$ be index sets and for each $1 \leq m \leq k$ and each $j \in I_{m}$, let $U_{j}$ be a set. Prove that: $$(\bigcup\limits_{j_{1}\in I_{1}}U_{j_{1}}) \cap ... ...
0
votes
2answers
37 views

Proving that any common multiplication of two numbers is a multiplication of their least common multiplication

Im trying to prove that if there are to numbers $n,m$ (natural numbers), and their smallest common multipe is $k$, so that $k = n·i$ and $k = m·j$ for some $i,j$ natural numbers, any common multiple ...
1
vote
1answer
46 views

Strange proposition in probability book for conditional probability

I found the following proposition (15.1) in the probability book of Heinz Bauer: Let us given that $X$ is a numeric random variable on $(\Omega,\mathcal{A},P)$ which is non-negative / ...
1
vote
1answer
103 views

Proving the properties of big union of unions for indexed sets

Let $I$ be an index set, and for each $i \in I$, let $J_{i}$, be another index set. For each $i \in I$ and $j \in J_{i}$, let $U_{j}$ be a set. Set X = $\bigcup\limits_{i\in I}J_{i}$. Prove that: ...
1
vote
1answer
37 views

Proving properties of closures using intersection of indexed sets and topology

How would I write a proof for this example? Let X be a set, and let $B \subseteq \mathcal P \left({X}\right)$. Define $B^* =${ $U \subseteq X:$ There is an index set $I$ and $U_{i} \in B$ for each ...
0
votes
3answers
41 views

How do I prove $x^n < x^m$ when $m > n$ and $x > 1$

Title I made an attempt at it here: $x^n < x^m$ when $m > n$ and $x > 1$, $m$ and $n$ are naturals so divide both sides by $x^n$ so $1 < x^{m-n}$ but here i am stuck. Please help!
0
votes
2answers
41 views

Prove that the order of $U(n)$ is even when $n>2$.

I'm trying to provide a solution to the following claim: "The order of $U(n)$ is even when $n>2$." Note: here, $U(n)$ is the set of all positive elements that are less than and relatively prime ...
0
votes
1answer
49 views

Question about proofs with topological spaces

How would I write a proof for this example? Let $(X, \tau_{1})$, $(Y, \tau_{2})$ and $(Z, \tau_{3})$ be topological spaces. A function ${f}: X \rightarrow Y$ is said to be continuous if for every V ...
0
votes
1answer
47 views

Question about writing proofs for limit

I intuitively understand proof with limits, but I'm not sure on how to write a formal proof for this example. For each $n \in \mathbb{N}$, let $a_n$, $b_n$ be real numbers. Also, let $a_{\infty}$, ...
0
votes
1answer
70 views

Quick question about $\epsilon -\delta$ proofs

There is one step in $\epsilon - \delta$ proofs that I hope somebody could bring clarity to for me. Say we wanted to show $\displaystyle \lim_{x \to 2} x^2 = 4 $. Somewhere along the proof we would ...
1
vote
1answer
35 views

Question about written proof for geometric summation

Suppose $\alpha$ $\ne$ $\beta$ $\in \{0, 2\}^\mathbb{N}$ Prove that $$\sum\limits_{k = 0}^\infty\frac{\alpha(k)}{3^k} \ne \sum\limits_{k = 0}^\infty\frac{\beta(k)}{3^k}. $$ This is the written proof ...
0
votes
1answer
54 views

Help to clarify inductive step for proof of $\mathbb{N_m} \rightarrow \mathbb{N}_n\Rightarrow m\le n$

The statement to prove is: If there exists an injection $\mathbb{N_m} \rightarrow \mathbb{N}_n$ then $m\le n$ The solution says to prove by induction on $n$. I just need help on the inductive ...
0
votes
1answer
44 views

How to prove that a given map is an injection?

Let $g:\mathbb{N_{m_1-1}}\rightarrow \mathbb{N}_{m_1}$, where: $$g(i) = \left\{ \begin{align} i & \text {, for } i<i_0 \\ i+1 & \text{, for } i \ge i_0 \end{align}\right.$$ and $i_0 ...
0
votes
5answers
52 views

Proof of $\forall n \in \Bbb N$, $n > 2 \implies n! < n^n$

What I've got so far is this: Base case: n = 3 then $3 *2 * 1 = 6$ and $3^3 = 27$ $\therefore 6 < 27, 3! < 3^3$ So the base case is true. So if we assume $n! < n^n$ (n > 2) $(n + 1)! = ...
1
vote
2answers
27 views

If $R$ is a transitive realation, then $R\circ R\subseteq R$

Here's the question I'm struggling with: Let R be a transitive relation on a set A. Prove the R composed with R is a subset of R. I'm kind of lost on how to prove this. I've started with saying: ...
1
vote
4answers
44 views

Prove $\forall n \in\Bbb N$, $0 < a < 1$ $\implies$ $a^n \leq 1$

I'm trying to prove this by induction but I'm running into some trouble. The base case is $0$, so, $a^0 = 1$, the inequality holds true Being new to induction, I don't exactly know what to do for ...
-1
votes
2answers
47 views
2
votes
1answer
50 views

Question about proof with geometric sums

I am confused on how to write proofs for geometric sums. I think that using the well ordering principle to find the least n $\in$ $\mathbb{N}$ with $\alpha(n)$ $\ne$ $\beta(n)$ would be a good ...
0
votes
1answer
48 views

Question about proofs with limits

I intuitively understand proof with limits, but I'm not sure on how to write a formal proof for this example. For each n $\in$ $\mathbb{N}$, let $a_{n}$ be a real number. Also, let $a_{\infty}$ be a ...
0
votes
2answers
41 views

How do I reduce this induction problem at the k+1 step

Show that $2^n > n^2$ through induction and so far I got to the $k+1$ step, but I am stuck. I have $2^{k+1} = 2 +2^k$, but I don`t know how the book turned it into $k^2 +k^2$. The book then ...
0
votes
2answers
54 views

Proof by induction $\sum_{k=1}^{n}$ $k \binom{n}{k}$ $= n2^{n-1}$ for each natural number n [duplicate]

Prove by induction that $\sum_{k=1}^{n}$ $k \binom{n}{k}$ $= n2^{n-1}$ for each natural number n
0
votes
0answers
20 views

Orthonormality and fourier transform

If $g\in\mathcal{L}^2(\mathbb{R})$ then $\sum_{k\in\mathbb{Z}} |\hat{g}(\zeta+2k\pi)|^2=1$ for a.e $\zeta\in \mathbb{R} \Rightarrow \{g(.-k): k\in \mathbb{Z}\}$ is an orthonormal system. Please ...
1
vote
2answers
92 views

Prove: If $A \subseteq B$ and $B \subseteq C$, then $A \subseteq C$.

Can someone tell me if this proof is acceptable? Assume $A \not\subseteq C$. This means that there is an $x \in A$ such that $x \not\in C$. But since $\forall x \in A: x \in B$ and $\forall x \in B: ...
1
vote
2answers
74 views

Prove the reflexivity of $\subseteq$.

My professor gave me a list of exercises, I've been able to figure out what mechanism I should exploit to prove them, but I'd like to know if it's good. Until now we've been taught a little logic and ...
0
votes
2answers
24 views

Proof exercise: finding hypothesis and conclusion in a statement

I am starting learn mathematical proofs and I was doing some exercise that needed to identify the hypothesis and the conclusion in a given statement. And I'm having trouble trying to figure it out in ...
0
votes
3answers
25 views

Can the proof for the following 4 cases be simplified to 2 cases?

Let $X$ and $Y$ be finite and disjoint sets. Suppose we are required to prove the following: $|X|\ge 0 \text{ and } |Y|\ge 0 \Rightarrow Q $ where $Q$ is some statement. Therefore, I know I need to ...
1
vote
1answer
62 views

How to prove that $f:\mathbb{N}\rightarrow X$ where $f$ maps to an element in a set, is a bijection?

Let $X$ and $Y$ be disjoint finite sets, $|X|=n$ and $|Y|=m$, so that we have the following bijections: $f:\mathbb{N}_n \rightarrow X$ and $g:\mathbb{N}_m \rightarrow Y$ I need to prove that ...
1
vote
4answers
50 views

Direct proof using modular arithmetic

Give a direct proof of $8\mid (3^n + 5^n)$ for all odd natural numbers. I know how to prove this by induction, I am not sure how to go about it using a direct proof. I would start by saying that ...
2
votes
3answers
34 views

Proof involving lcm and biconditional statement.

Suppose $a,b\in\mathbb{Z}$. Then $a = \operatorname{lcm}(a,b)$ if and only if $b\mid a$ Unsure of how to approach this problem.
2
votes
4answers
90 views

Prove $A \subset \emptyset \iff A = \emptyset$

How does one prove this? Can one prove by contradiction by saying: Let $A$ be any set such that $A$ contains at least one element. Now assume $A \subset \emptyset$. This is clearly absurd by the ...
0
votes
3answers
34 views

Proof for a non-conditional statement

I'm having a bit of trouble doing this proof. If $a\in\mathbb{Z}$, then $a^3 \equiv a \pmod 3$. I know how to do proofs if there were conditional statements but not sure how to prove this with ...
0
votes
2answers
55 views

If a converse of an implication is false, does this mean that the proof of that implication will always have an implication that is not reversible?

Let $f:X \rightarrow Y$ be a function and $B_1, B_2 \in \mathcal{P}(Y)$. Prove that $B_1 \subseteq B_2 \Rightarrow \overleftarrow{f}(B_1) \subseteq\overleftarrow{f}(B_2)$. My attempt: $\begin{align} ...
2
votes
2answers
30 views

Help to prove $f$ is surjective $\Leftrightarrow \forall y \in Y, (X \times \{y\} \cap G_f ) \ne \emptyset $

Let $f:X \rightarrow Y$ be a function with graph $G_f \subseteq X \times Y$. Prove that $f$ is surjective if and only if $\forall y \in Y, (X \times \{y\} \cap G_f ) \ne \emptyset $ I have some ...
-1
votes
1answer
25 views

Prove this statement (inequality)

$x,y,z$ $\in\mathbb R$ then $|x-y| \leq|x-z|+|y-z|$ Prove this statement. I thought it was the triangle inequality, but I can't seem to end up with the correct order.
1
vote
1answer
34 views

Correctly understanding truth table problem?

I'm typing up a solution set for an "intro to proof" course. One of the problems asks the student to "construct a truth table for $(P \implies Q) \implies (\neg P)$." I interpreted this as requesting ...