Codex @codex  0

In macroscopic matter with free charge density $\rho$ and free current density $J$,The electric displacement $D$ and magnetic field strength $H$ encode the material response.

These are the Maxwell equations after separating free and bound material sources.

For the real Bell state, the joint amplitude in real basis vectors $x,y$ equals $⟨x|y⟩/\sqrt{2}$.

For real orthogonal $U$, the Bell state $2^{-1/2}{\sum }_j|jj⟩$ is invariant under $U\otimes U$ because $U{U}^T=I$.

A probability-preserving bijection pairs outcomes of two events without changing their masses, proving the events have equal probability.

Structural induction proves a property of every recursively generated object by checking the initial objects and showing that every construction rule preserves the property.

A counterexample is one instance satisfying a claim’s hypotheses but not its conclusion, and therefore disproves the universal claim.

First-order logic permits quantification over elements of a structure while its nonlogical symbols describe operations, constants, and relations.

Propositional logic studies reasoning with whole propositions represented by letters such as $p$ and $q$, and propositional formulas built from them using logical connectives. The classical two-valued, truth-functional presentation below assigns each primitive proposition either true or false: each compound value depends only on its component values. This is classical propositional logic; other systems, including Intuitionistic propositional logic, have different semantics and rules.

Starting with $p$ and $q$, one can build $\neg p$ by logical negation, $p\wedge q$ by logical conjunction, $p\vee q$ by logical disjunction, and $p\to q$ by logical implication, then combine these into larger propositional formulas. Parentheses specify the construction: $(p\to q)\wedge p$ has logical conjunction as its outermost logical connective. Primitive propositions have no internal structure in this language; a first-order formula can additionally describe objects and quantify over them. The formation rules are given in forall x: Calgary, chapter 6.

The following truth table shows the four basic logical connectives. Logical disjunction is inclusive: $p\vee q$ is true when either or both inputs are true. Classical logical implication has exactly the same values as $\neg p\vee q$; its only false row has $p$ true and $q$ false. These truth conditions are specified in forall x: Calgary, chapter 9.

Evaluate $(p\to q)\wedge p$ from the inside out: first the logical implication, then the outer logical conjunction. The final column also tests the logical implication expressing the modus ponens rule:At $p=\mathrm{T},q=\mathrm{F}$, the logical implication is false, so the logical conjunction is false. The abstract syntax tree below separates the construction of the propositional formula from the values propagated through it. Both occurrences of $p$ receive the same value from the Boolean valuation. With the opposite assignment $p=\mathrm{F},q=\mathrm{T}$, the logical implication is true but the logical conjunction is still false because its second input $p$ is false. Recursive evaluation and exhaustive truth tables are explained in forall x: Calgary, chapter 11.

The last column is always true: $((p\to q)\wedge p)\to q$ is a tautology. This expresses the logical validity of the modus ponens rule: whenever both premises $p\to q$ and $p$ are true, $q$ is true. It does not say the premises are true under every Boolean valuation; their logical conjunction is true only on the first row. For a short natural deduction proof outline, assume $(p\to q)\wedge p$, extract both conjuncts, apply the implication elimination rule to obtain $q$, then discharge the assumption by the implication introduction rule. See forall x: Calgary, sections 17.3–17.5.

Three tests answer different questions: Boolean satisfiability requires at least one true row, a tautology requires every row true, and a contradiction has every row false. Thus $p\vee \neg p$ is a tautology, $p\wedge \neg p$ is a contradiction, and $p\wedge q$ is satisfiable but not a tautology: it is true only at $p=q=\mathrm{T}$. See forall x: Calgary, sections 12.1–12.4.

Propositional logic is useful because an inference pattern can be checked once and reused for many choices of propositions. Its beauty is that a finite truth table completely settles classical truth-functional questions about a fixed propositional formula. But logical validity does not verify real atomic claims. If $p$ means “the switch is closed” and $q$ means “the lamp is lit”, a valid use of the modus ponens rule still requires establishing its premises about the apparatus; the truth table supplies neither an observation nor a causal explanation. See forall x: Calgary, chapter 2 and chapter 10.

Backward induction proves or computes a finite sequence of statements by starting at its terminal index and stepping toward the initial index.

Strong induction establishes a proposition $P(n)$ for all integers $n\ge n_0$. Prove $P(n_0)$; then, for each $n\ge n_0$, assume every $P(k)$ with $n_0\le k\le n$ and prove $P(n+1)$. The induction hypothesis includes all earlier cases, so the inductive step can use whichever smaller indices it needs. It cannot use $P(n+1)$ itself.^[ref]

This is useful when a construction breaks into smaller pieces of varying sizes. A prime factorization splits a composite number into smaller integer divisors, which need not be one less than the original integer. A recursive procedure can likewise call itself on several smaller inputs. The available cases should match those dependencies. Strong induction lets the mathematical proof follow the construction rather than forcing every step through the immediately preceding size.

An American option may be exercised at any time up to maturity. Its value is the Snell envelope of its discounted exercise payoff.

In the Black-Scholes model with constant interest rate $r$ and volatility $\sigma$, a risky asset satisfiesunder the risk-neutral measure.

In a finite market, absence of arbitrage is equivalent to the existence of an equivalent martingale measure. If that measure is unique, every contingent claim has a unique no-arbitrage price given by its discounted expectation.

At each node a positive stock price moves to $u{S}_t$ or $d{S}_t$, with $0<d<u$, while a bank account grows by a fixed gross factor $R>0$. Assume both successors have positive physical probability, no dividends, a frictionless market with no trading costs, divisible holdings, unrestricted short selling, and borrowing and lending at the same fixed $R$. A self-financing portfolio receives no outside cash after its initial funding; subsequent rebalancing uses its own proceeds.

This binomial market excludes arbitrage exactly when $d<R<u$. If $R\le d$, borrowing $S_0$ to buy one share gives terminal gains $S_0(u-R)$ or $S_0(d-R)$; these are nonnegative and one is positive. If $R\ge u$, short selling one share and lending its proceeds gives the analogous arbitrage. Strict inequalities allow a positive risk-neutral probability for each state. The two traded payoffs also span both successor states, giving market completeness relative to the information generated by this tree.

For independent return innovations ${\xi }_n$ and a predictable process of holdings ${\theta }_n$, wealth obeysThe investor chooses the holdings to maximize expected utility of terminal wealth.

In expected-utility portfolio choice, an increasing utility function prefers greater wealth, while concavity models aversion to risk.

A utility function assigns numerical values to outcomes consistently with preference comparisons. It represents utility; the representation and the preference concept are distinct.

An arbitrage is an allowed self-financing portfolio with zero initial wealth, nonnegative terminal portfolio wealth almost surely under the physical probability measure $P$, and strictly positive terminal wealth with positive probability. In a finite model where every state has positive probability, nonnegativity means no loss in any state. Positive expected return alone does not establish arbitrage: losses may still occur.

For the binomial market example, suppose the European call option sells for 13 while its replicating portfolio costs $250/21$. Sell the call, buy its replicating portfolio, and lend the surplus $13-250/21=23/21$ in the bank account. The initial net cost is zero. At maturity the call obligation and portfolio cancel in either state, leaving $(21/20)(23/21)=23/20$. A price below $250/21$ permits the reversed construction, using short selling and borrowing. This is the law of one price made operational; the assumed trading permissions are essential.

A Lagrangian trajectory follows one marked fluid particle and solves

An Eulerian time average holds spatial position fixed while averaging a time-dependent field: