Namyoung Kim(Leo)
Data-driven is my life.
23 Aug 2017 » LaTeX LaTeX을 처음부터 하나씩 정리하기보다는, LaTeX 문법을 사용할 때 마다 정리할 예정이다.
$
: 수식의 전, 후에 붙여 주면 된다.(일반적 LaTeX)$$
: 지킬 + MathJax 연동에서는 $$
두 개를 수식 전, 후에 붙여서 써주어야 한다.
벡터, 스칼라, 집합 등 표기법
$$\mathbf{x}$$
- \[\mathbf{x}\]
$$\vec{x}$$
- \[\vec{x}\]
$$R$$
- \[R\]
$$ \in $$
- \[\in\]
$$ y \in R$$
- \[y \in R\]
$$R^N$$
- \[R^N\]
$$R^{N\times 1}$$
- \[R^{N\times 1}\]
$$[x_n]$$
- \[[x_n]\]
$$ \begin{bmatrix} x_{1} \\ x_{2} \\ \vdots \\ x_{N} \\ \end{bmatrix} $$
- \[\begin{bmatrix} x_{1} \\ x_{2} \\ \vdots \\ x_{N} \\ \end{bmatrix}\]
$$\vdots$$
- \[\vdots\]
$$\cdots$$
- \[\cdots\]
$$\ddots$$
- \[\ddots\]
$$\;$$
- \(\;\) 한 칸 띄기
$$ & $$
- 행렬에서 옆 원소 쓰기
- 지킬에서는 작동하지 않으므로
\;\;\;\;
를 대신 사용
$$ \int_a^b f(X) dx $$
- \[\int_a^b f(X) dx\]
$$ F(X=x) $$
- \[F(X=x)\]
$$ P ( \{ a \leq X \}) $$
- \[P ( \{ a \leq X \})\]
$$ P ( \{ a \geq X \}) $$
- \[P ( \{ a \geq X \})\]
$$ \dfrac{dF(x)}{dx} $$
- \[\dfrac{dF(x)}{dx}\]
$$ \rightarrow $$
- \[\rightarrow\]
$$\sum_{i=1}^N$$
- \[\sum_{i=1}^N\]
\bbox[15px, border:2px solid darkred]{x^T y = y^T x}
- \[\bbox[15px, border:2px solid darkred]{x^T y = y^T x}\]
$$\infty$$
- \[\infty\]
$${1 \over n!}$$
- \[{1 \over n!}\]
$$\bbox[15px, border:2px solid darkred]{a}$$
- \[\bbox[15px, border:2px solid darkred]{a}\]
$$ \text{tr} (\mathbf{A})$$
- \[\text{tr} (\mathbf{A})\]
$$\left( \log{x} \right)$$
- \[\left( \log{x} \right)\]
$$ f_x(x,y) = \dfrac{\partial f}{\partial x} $$
- \[f_x(x,y) = \dfrac{\partial f}{\partial x}\]
$$\top$$
- \[\top\]
$$\begin{eqnarray} \end{eqnarray} $$
- 방정식 앞뒤로 써주면 라인을 잡아준다.
$$\left(\begin{matrix} a_{11}x_1x_1 + a_{12}x_1x_2 + \cdots + a_{1N}x_1x_N \\ a_{21}x_2x_1 + \cancel{a_{22}x_2x_2} + \cdots + \cancel{a_{2N}x_2x_N} + \\ \cdots \\ a_{N1}x_Nx_1 + \cancel{a_{N2}x_Nx_2} + \cdots + \cancel{a_{NN}x_Nx_N} \end{matrix} \right)$$
- \[\left(\begin{matrix} a_{11}x_1x_1 + a_{12}x_1x_2 + \cdots + a_{1N}x_1x_N + \\ a_{21}x_2x_1 + \cancel{a_{22}x_2x_2} + \cdots + \cancel{a_{2N}x_2x_N} + \\ \cdots \\ a_{N1}x_Nx_1 + \cancel{a_{N2}x_Nx_2} + \cdots + \cancel{a_{NN}x_Nx_N} \end{matrix} \right)\]
$$\sigma$$
- \[\sigma\]
$$\Sigma$$
- \[\Sigma\]
$$x^{\ast}$$
- \[x^{\ast}\]
$$\text{arg} \max_{x} f(x)$$
- \[\text{arg} \max_{x} f(x)\]
$$\cup_i A_i \;\; \cap_i A_i$$
- \[\cup_i A_i \;\; \cap_i A_i\]
$$P(\emptyset)$$
- \[P(\emptyset)\]
$$P\{\emptyset\}$$
- \[P\{\emptyset\}\]
$$\begin{eqnarray*} P(A \cup B) &=& P(A \cup (B\cap A^C)) \\ &=& P(A) + P(B\cap A^C) \\ &=& P(A) + P(B\cap A^C) + P(A ∩ B) – P(A ∩ B) \\ &=& P(A) + P((A^C\cap B) ∪ (A ∩ B)) – P(A ∩ B) \\ &=& P(A) + P(B) \; – \; P(A ∩ B) \end{eqnarray*} $$
- \[\begin{eqnarray*} P(A \cup B) \;=\; P(A \cup (B\cap A^C)) \\ \;=\; P(A) + P(B\cap A^C) \\ \;=\; P(A) + P(B\cap A^C) + P(A ∩ B) – P(A ∩ B) \\ \;=\; P(A) + P((A^C\cap B) ∪ (A ∩ B)) – P(A ∩ B) \\ \;=\; P(A) + P(B) \; – \; P(A ∩ B) \end{eqnarray*}\]
$$\propto$$
- \[\propto\]
$$\xrightarrow{X}$$
- \[\xrightarrow{X}\]
$$\sim$$
- \[\sim\]
$$\binom N x$$
- \[\binom N x\]
$$\mathcal{N}$$
- \[\mathcal{N}\]