We say a metric space complete if every Cauchy sequence converges.
Let (X, d) be a metric space. Show that there exists an isometric imbedding from X to a complete metric space Y so that the image of X in Y is dense.
Let \( f_n : [-1, 1] \to \mathbb{R} \) be a continuous function for \( n = 1, 2, 3, \dots \). Define
\[
g_n(y) := \log \int_{-1}^1 e^{y f_n(x)} dx.
\]
Suppose there exists a continuous function \( g: \mathbb{R} \to \mathbb{R} \) and \( y_0 \in \mathbb{R} \) such that \( \lim_{n \to \infty} g_n(y) = g(y) \) for all \( y \neq y_0 \). Prove or disprove that \( \lim_{n \to \infty} g_n(y_0) = g(y_0) \).
A permutation \( \pi : [n]\rightarrow [n] \) is graceful if \( |\pi(i+1) – \pi(i)| \neq |\pi(j+1)-\pi(j)| \) for all \(i\neq j \in [n-1]\). For a graceful permutation \( \pi :[2k+1] \rightarrow [2k+1] \) with \( \pi(\{2,4,\dots,2k\}) = [k] \), prove that \(\pi(1)+ \pi(2k+1) = 3k+2 \).
Either find an example of a group which is expressed as the union of two proper subgroups or prove that such a group cannot exist.
For a given positive integer \( n \), find all non-negative integers \( r \) such that the following statement holds:
For any real \( n \times n \) matrix \( A \) with rank \( r \), there exists a real \( n \times n \) matrix \( B \) such that \( \det (AB+BA) \neq 0 \).
Let \(f = X^n + a_{n-1}X^{n-1} + \dots + a_0\in \mathbb{Z}[X]\) be a polynomial with integer coefficients, and let \(m\in \mathbb{Z}\).
Consider the sequence \[f_0,f_1,f_2,\dots \]
where \(f_0:=m\), and \(f_i:=f(f_{i-1})\) for all \(i\ge 1\).
Let \(S:=\{p\in \mathbb{P}: p \text{ divides } f_i \text{ for some } i\ge 0\}\) be the set of prime divisors of the sequence \(f_0,f_1,f_2,\dots\).
Assume that \(S\) is finite, but \(\{f_i\mid i\ge 0\}\) is infinite. Show that \(f=X^n\).
Let \( A \) be an \( m \times n \) matrix and \( \delta \in (0, 1) \). Suppose that \( \| A^T A – I \| \leq \delta \). Prove that all singular values of \( A \) are contained in the interval \( (1-\delta, 1+\delta) \).
Let \(G = (S | R)\) be a group presentation where S is a set of generators and R is a set of relators. Given any subset S’ of S, we set R’ to be the subset of R which consists of words only in the elements of S’. Then the presentation \(S’|R’\) is called a sub-presentation of \(S|R\).
The presentation complex for the presentation \(S|R\) is a cell complex constructed as follows: start with a single vertex v. For each element s of S, we attach an oriented edge labelled by s to v by identifying both endpoints of the edge with v. In this way, we get a wedge of circles where the circles are in 1-1 correspondence with the generating set S. For each element r of R, we attach a closed disk to the wedge of circles we obtained so that the boundary of the disk after gluing can be read using the labels of the edges to be the word r we started with.
For instance, consider the following presentation of a group \(x, y| xyx^{-1}y^{-1}\). We get a wedge of two circles first labelled by x and y. Then we add one disk so that the boundary reads as \(xyx^{-1}y^{-1}\). It is easy to see that the resulting space is homeomorphic to the torus. As one sees from this example, the presentation complex is a cell complex whose fundamental group is the group with the given presentation. For a group presentation \((S|R)\), let \( K(S|R) \) denote the presentation complex.
Suppose we have a group presentation \((S|R)\) such that any continuous map \(f: S^2 \to K(S|R) \) is homotopic to a constant map where \(S^2\) is the 2-sphere. Prove or find a counter-example to that every sub-presentation of \((S|R)\) has the same property, i.e., for any sub-presentation \((S|R)\), every continuous map \(h: S^2 \to K(S’|R’)\) is homotopic to a constant map.
Find all integers \( n \) such that the following holds:
There exists a set of \( 2n \) consecutive squares \( S = \{ (m+1)^2, (m+2)^2, \dots, (m+2n)^2 \} \) (\( m \) is a nonnegative integer) such that \( S = A \cup B \) for some \( A \) and \( B \) with \( |A| = |B| = n \) and the sum of elements in \( A \) is equal to the sum of elements in \( B \).
Nubjook and Kai are playing a game. First, they take an empty 2019×2019 matrix and take turns to write numbers in each entry. Once the matrix is completely filled, Nubjook wins if the determinant is nonzero and Kai wins otherwise. If Nubjook does the first move, who has a winning strategy?