Posts

Unix

Last edited: August 8, 2025

Unix is a standard set of tools commonly used in software development.

  • macOS and Linux are on top of Unix
  • Windows comes Unix now lol

You can navigate Unix inside a command line.

Unix V6 Filesystem

Last edited: August 8, 2025

its a File Payload Data with smartness.

Sector SizeBlock SizeInode SizeInodes Per BlockAddress Type
5125123216Short, 2 bytes

Notably, the entire file system only supports \(2^{16} = 32MB\) worth of space due to short address types.

For each file on the disk, we store payload data in a bunch of places scattered across the disk, and a single inode which stores the location of each block for the file in an array.

UNSAT

Last edited: August 8, 2025

\begin{equation} \text{UNSAT} = \qty {\phi : \text{all assignment make $\phi$ false}} \end{equation}

Equivalently, we have:

\begin{equation} \text{UNSAT} = \neg \text{SAT} \end{equation}

NP = coNP IFF UNSAT is in NP

\begin{equation} \text{NP} = \text{coNP} \Leftrightarrow \text{UNSAT} \in \text{NP} \end{equation}

\(\Rightarrow\)

Because \(\text{UNSAT} \in \text{coNP}\), and we hypothesize NP = coNP, so \(\text{UNSAT} \in \text{NP}\)

\(\Leftarrow\)

Suppose UNSAT in NP, we desire that \(\text{coNP} = NP\). Let \(L \in \text{coNP}\),so \(\neg L \in \text{NP}\), since SAT is NP-complete, we can write that \(L \leq_{p} \text{SAT}\). Equivalently, we have \(L \leq_{p} \neg \text{SAT} = \text{UNSAT}\). Since \(\text{UNSAT} \in \text{coNP}\), we have \(L \in \text{NP}\).

upper-triangular matrix

Last edited: August 8, 2025

A matrix is upper-triangular if the entries below the diagonal are \(0\):

\begin{equation} \mqty(\lambda_{1} & & * \\ & \ddots & \\ 0 & & \lambda_{n}) \end{equation}

properties of upper-triangular matrix

Suppose \(T \in \mathcal{L}(V)\), and \(v_1 … v_{n}\) is a basis of \(V\). Then:

  1. the matrix of \(T\) w.r.t. \(v_1 … v_{n}\) is upper-triangular
  2. \(Tv_{j} \in span(v_1 \dots v_{j})\) for each \(v_{j}\)
  3. \(span(v_{1}, … v_{j})\) is invariant under \(T\) for each \(v_{j}\)

\(1 \implies 2\)

Recall that our matrix \(A=\mathcal{M}(T)\) is upper-triangular. So, for any \(v_{j}\) sent through \(A\), it will be multiplied to the $j$-th column vector of the matrix. Now, that $j$-th column has \(0\) for rows \(j+1 … n\), meaning that only through a linear combination of the first \(j\) vectors we can construct \(T v_{j}\). Hence, \(Tv_{j} \in span(v_1 … v_{j})\)

US WWII Propaganda

Last edited: August 8, 2025
  • Investment: Paid for 50% of war bonds
  • Production: ships, tanks, airplanes, etc. — encourages production
  • Conservation: 5% of the world’s population production, 50% of the world’s manufactured goods — rationing, grow goods, etc.