## Code Screenshot: Theorem Proof for Schur-Convexity ### Overview The image shows a code snippet from a formal theorem proof, likely written in a proof assistant or theorem prover (e.g., Lean, Coq, or Isabelle). The code defines a theorem about **Schur-convexity** related to the function `x ↦ x * log(x)`, with a focus on properties like majorization and sum equality. ### Components/Axes - **Line Numbers**: Left-aligned numbers (531–536) indicate code line positions. - **Syntax Highlighting**: - Keywords (e.g., `theorem`, `SchurConvex`, `fun`, `intro`, `obtain`) in **orange** and **green**. - Variables (e.g., `x`, `n`, `h`, `h_majorization`) in **blue**. - Mathematical symbols (e.g., `Fin`, `R`, `i`, `Real.log`) in **white** or **purple**. - **Text Content**: - Theorem declaration: `theorem schur_convex_xlogx {n : N} :` - Function definition: `SchurConvex (fun x : Fin n → R => ∑ i, x i * Real.log (x i)) : by` - Proof steps: - `unfold SchurConvex` - `intro x y hx_nonneg hy_nonneg h` - `obtain (h_majorization, h_sum_eq) : h` ### Detailed Analysis 1. **Theorem Statement**: - Declares a theorem named `schur_convex_xlogx` parameterized by `n : N` (natural numbers). - The theorem’s conclusion is implied by the proof steps (`: by`). 2. **Function Definition**: - `SchurConvex` is defined as a function taking `fun x : Fin n → R` (a function from finite indices to real numbers) and returning a real number. - The body computes `∑ i, x i * Real.log (x i)`, which is the **entropy-like sum** over indices `i`. 3. **Proof Steps**: - `unfold SchurConvex`: Expands the definition of `SchurConvex`. - `intro x y hx_nonneg hy_nonneg h`: Introduces variables `x`, `y` (vectors) and hypotheses `hx_nonneg` (non-negativity of `x`), `hy_nonneg` (non-negativity of `y`), and `h` (a general hypothesis). - `obtain (h_majorization, h_sum_eq) : h`: Proves two subgoals: - `h_majorization`: Majorization condition between `x` and `y`. - `h_sum_eq`: Equality of sums (likely related to convexity). ### Key Observations - The code uses **dependent types** (e.g., `Fin n` for finite indices) to enforce correctness. - The proof strategy involves **unfolding definitions** and **introducing variables/hypotheses** to establish majorization and sum equality. - The use of `Real.log` suggests a connection to **information theory** or **optimization**. ### Interpretation This code formalizes a mathematical result about **Schur-convex functions**, which are functions preserving the majorization order. The theorem likely states that the function `x ↦ x * log(x)` is Schur-convex, meaning it satisfies certain monotonicity properties under majorization. The proof leverages formal verification tools to ensure correctness, which is critical in fields like **machine learning** or **economics** where such properties underpin algorithms or models. The structured approach (`unfold`, `intro`, `obtain`) reflects a step-by-step logical deduction, common in formal proofs. The reliance on non-negativity (`hx_nonneg`, `hy_nonneg`) and majorization (`h_majorization`) highlights the interplay between convexity and ordering in the function’s behavior.