If a matrix has repeated eigenvalues, the eigenvectors of the matched repeated eigenvalues become one of eigenspace. For example, the identity matrix has all repeated eigenvalues of one. The eigenvectors of the identity matrix are any vectors of the whole column space of the identity matrix. The whole column space is the eigenspace. A symmetric matrix can be chosen with orthogonal eigenvectors not only orthogonal eigenvectors because when a symmetric matrix has repeated eigenvalues, the eigenvectors that correspond to the repeated eigenvalues do not have to be orthonormal but can be orthonormal.
Gaussian kernel matrix can be factorized into \((\Phi \textbf{X})^\textbf{H} \Phi \textbf{X} =\textbf{X}^\textbf{H} \Phi^\textbf{H} \Phi \textbf{X} = \textbf{X}^\textbf{H}\textbf{X}\), where \(\Phi\) is Gaussian kernel basis matrix and \(\textbf{X}\) is coefficients matrix of reproducing kernel Hilbert space \(K(\cdot,x) \in \mathcal{H}_K\) https://www.jkangpathology.com/post/reproducing-kernel-hilbert-space/.
A matrix is a system. A system takes input and gives output. A matrix is a linear system. Differentiation and Integration are linear systems. Fourier transformation matches input basis and operator (differentiation) basis.
The infinite impulse response is a property of a filter of digital signal processing. The filter response of the impulse signal does not end infinitely. The filter can be represented in either the time domain or frequency domain. Time-domain filter modifies time-domain input signal to time-domain output signal. The frequency domain lets us understand or to design the effect of the filter.
The discrete Fourier transformation \(\Sigma^{N-1}_{n=0} x(n)e^{-i2\pi nm/N}\) transforms time domain to frequency domain in the finite impulse response.
Cauchy’s integral formula defines analytic function evaluation with path integral with denominator translation at evaluation point (\(\frac{1}{z-a}\)).
\(f(a) = \frac{1}{2\pi i} \oint_\gamma \frac{f(z)}{z-a}\, dz\,\)
\(f^{(n)}(a) = \frac{n!}{2\pi i} \oint_\gamma \frac{f(z)}{\left(z-a\right)^{n+1}}\, dz\)
Cauchy’s integral formula is a limit of path.
\(\lim_{r \rightarrow 0}\gamma : \lvert z-z_{0} \rvert = r\)
Taylor series evaluated a analytic function by approximation at an open disc \(D(z_{0}, r)\).
\(f(x) = \sum_{n=0}^\infty a_n(x-b)^n\)
\(\frac{f^{(n)}(b)}{n!} = a_n\)
The presence of primitive function is a strong condition that makes a function is analytic in a disc \(D(a,R)\). The meaning is the presence of primitive function is confusing at first to me. If a function is integrable, then integration value and a primitive function can be determined. But in complex analysis this is not the case. In real analysis, the integral interval \([a, b]\) is unique, but in complex analysis the integral interval should be determined by line path \(\Gamma = g(x)\).
A norm of linear transformation \(\Lambda : X \rightarrow Y\) is defined by \(\| \Lambda \| = \sup \{ \| \Lambda(x) \|:x \in X, \|x\| \le 1 \}\). We can give a norm to a space or a set. A norm determines the size of a vector in the function space. The way of measure the size of a vector gives important properties of the space like boundness, completeness or orthogonality.
It is the main subject of analysis that finding conditions making sequential mathematical objects like a set, sequence, series to be convergent. Induction changes \(S = \mathbb{N}\) to \(s_{1} \in S\) and if \(s_{n} \in S\) then \(s_{n+1} \in S\). The natural number has a property of endless addable with one. But, induction can prove only natural number \(\mathbb {N}\) not infinity \(\infty\).
\[ Induction \\ s_{1} \in S \\ if\ s_{n} \in S \ then \ s_{n+1} \in S \\ Then\ S = \mathbb{N} \\ \] The limit is the way \(\mathbb {N}\) goes to \(\infty\).
The Fourier series represents a periodic function as a descrete vectors. The Fourier transformation turns a time domain non-periodic function into a frequency domain continuous function. The Fourier series and transformation change a single time base \(t\) into infinite frequency basis \(e^{inx}\) or \(e^{iwx}\). The function on infinite basis domain can be represented by a vector or a function of basis domain \(v_{n}\) or \(f(w)\). This is a coefficients of Fourier series or Fourier transformation.
Convolution is a vector operation on two vectors.
\[ Convolution \\ c * d = d*c \\ (c*d)_n = \Sigma_{i+j} c_i d_j = \Sigma_i c_i d_{n-i}.\] This is multiplying polynomials. The parameters of multiplied polynomial become convolution of two polynomials. Fourier transformation expands x base to infinite exponential basis \(e^{iwk}\). The multiplication on x (time) space becomes convolutionn on k (frequency) space.
If time space is periodic, its Fourier transformation is discrete i.
The optimization problem have two components that are objective function \(f_0 : \mathbb R ^n \rightarrow \mathbb R\) and the constraints. The objective function and constraints keep in check each other and make balance at saddle point i.e. optimal point. The dual (Lagrange) problem of the optimal problem also solve the optimization problem by making low boundary.
The dual problem can be explained as a conjugate function \(f^* = \sup (x^Ty-f(x))\).