Datasets:
id stringlengths 22 186 | doc_id stringlengths 17 181 | title stringlengths 7 171 | kind stringclasses 1
value | source_url stringlengths 34 198 | flavour stringclasses 2
values | strategy_index int32 0 4 | strategy_name stringlengths 11 79 | strategy_body stringlengths 236 895 | text stringlengths 171 63.7k | n_chars int32 171 63.7k | token_count int32 57 4.72k |
|---|---|---|---|---|---|---|---|---|---|---|---|
proofwiki:Sine_of_Angle_plus_Full_Angle#aug0 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | agnostic | 0 | Concrete Numerical Verification | Select three distinct values for $x$ (e.g., $x=0$, $x=\pi/4$, and $x=3\pi/2$). For each value, manually calculate both the left-hand side $\sin(x + 2\pi)$ and the right-hand side $\sin x$ using a unit circle or known values. By verifying that the results are identical for these specific cases, you ground the abstract a... | # Numerical Verification: $\sin(x + 2\pi) = \sin x$
The objective is to verify the identity $\sin(x + 2\pi) = \sin x$ by testing three distinct values of $x$ to ensure that adding a full rotation ($2\pi$ radians) to the angle does not change the sine value.
## Case 1: $x = 0$
* **Left-Hand Side (LHS):**
$$\sin... | 1,928 | 775 |
proofwiki:Sine_of_Angle_plus_Full_Angle#aug1 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | agnostic | 1 | Dependency Mapping | Create a "Proof Tree" for this theorem. Start with the target statement $\sin(x + 2\pi) = \sin x$ at the root. Draw arrows backward to every prerequisite result cited in the proof: the "Sine of Sum" formula, the value of $\cos 2\pi$, and the value of $\sin 2\pi$. For each prerequisite, write out its mathematical statem... | # Proof Tree: $\sin(x + 2\pi) = \sin x$
## Target Statement (Root)
**Theorem:** $\sin(x + 2\pi) = \sin x$
---
## Direct Dependencies
To prove the target statement, the following mathematical results are required:
**1. Sine of Sum Formula**
$\sin(\alpha + \beta) = \sin \alpha \cos \beta + \cos \alpha \sin \beta$
*(A... | 1,196 | 397 |
proofwiki:Sine_of_Angle_plus_Full_Angle#aug2 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | agnostic | 2 | Generalization via Variable Substitution | Modify the theorem by replacing $2\pi$ with $2k\pi$, where $k$ is any integer. Attempt to extend the existing proof to show that $\sin(x + 2k\pi) = \sin x$. You will need to reason about why $\sin(2k\pi)$ remains $0$ and $\cos(2k\pi)$ remains $1$ for all integers $k$. This transitions your understanding from a single s... | # Generalization of the Periodicity of Sine
## Original Theorem
The source document proves the specific case:
$$\sin(x + 2\pi) = \sin x$$
## Generalized Theorem
For any angle $x$ and any integer $k \in \mathbb{Z}$:
$$\sin(x + 2k\pi) = \sin x$$
## Extension of the Proof
To extend the proof from a single rotation ($2... | 2,044 | 624 |
proofwiki:Sine_of_Angle_plus_Full_Angle#aug3 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | agnostic | 3 | Contrast with Cosine Periodicity | Using the same logical structure as the provided proof, derive the equivalent statement for the cosine function: $\cos(x + 2\pi) = \cos x$. Write out the steps explicitly: apply the "Cosine of Sum" formula, substitute the values for $\cos 2\pi$ and $\sin 2\pi$, and simplify. Comparing the two proofs side-by-side highli... | # Derivation of Cosine Periodicity: $\cos(x + 2\pi) = \cos x$
This derivation follows the logical structure used to prove the periodicity of the sine function, applying the corresponding sum formula and trigonometric constants for the cosine function.
## Proof
Using the "Cosine of Sum" identity and the known values ... | 1,508 | 468 |
proofwiki:Sine_of_Angle_plus_Full_Angle#aug4 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | agnostic | 4 | Blind Reconstruction (Active Recall) | Clear your workspace of the document. Attempt to prove the identity starting from the left-hand side $\sin(x + 2\pi)$ and ending at $\sin x$. If you get stuck, do not look at the proof immediately; instead, ask yourself, "What trigonometric identity allows me to break apart a sum inside a sine function?" Once you have ... | # Blind Reconstruction: $\sin(x + 2\pi) = \sin x$
## Goal
Prove the identity $\sin(x + 2\pi) = \sin x$ starting from the left-hand side (LHS) and deriving the right-hand side (RHS).
## Step-by-Step Proof
**Step 1: Expand the sine of a sum.**
Starting with the LHS:
$$\sin(x + 2\pi)$$
I need to break apart the sum ins... | 1,091 | 358 |
proofwiki:Sine_of_Angle_plus_Full_Angle#aug5 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | lean | 0 | Typeclass and Signature Drafting | Draft the complete `theorem` signature, focusing on the necessary typeclasses for the variable $x$. Since the statement involves $\sin$ and $\cos$, determine whether to use `Real` (with `Real.sin`) or a more general `Complex` or `Algebraic` type, and ensure the signature includes the required `[MetricSpace]` or `[RealI... | # Typeclass and Signature Drafting: Sine of Angle plus Full Angle
## Mathematical Analysis
The goal is to formalize the periodicity of the sine function: $\sin(x + 2\pi) = \sin x$.
Key components:
1. **Domain**: The variable $x$ represents an angle, typically a real number $\mathbb{R}$.
2. **Constants**: The const... | 2,332 | 657 |
proofwiki:Sine_of_Angle_plus_Full_Angle#aug6 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | lean | 1 | Lemma-to-Tactic Mapping | For each line of the ProofWiki equation chain, identify the specific `mathlib4` lemma that justifies the transition. Specifically, map "Sine of Sum" to `Real.sin_add` and the "Full Angle" evaluations to `Real.sin_two_pi` and `Real.cos_two_pi`. For each mapping, predict whether the lemma should be invoked via `rw` (rewr... | # Lemma-to-Tactic Mapping: Sine of Angle plus Full Angle
This document maps the mathematical transitions in the ProofWiki proof of $\sin(x + 2\pi) = \sin x$ to specific `mathlib4` lemmas and the corresponding tactics required for a formal Lean 4 proof.
## Proof Chain Analysis
| Step | Mathematical Transition | Justi... | 1,992 | 630 |
proofwiki:Sine_of_Angle_plus_Full_Angle#aug7 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | lean | 2 | Tactic-Mode Proof Skeletoning | Convert the prose proof into a sequence of Lean tactics. Start with `intro x`, then use `rw [Real.sin_add]` to expand the sum, followed by `rw [Real.cos_two_pi, Real.sin_two_pi]` to handle the constants. Finish by predicting how `ring` or `simp` would handle the final simplification of $\sin x \cdot 1 + \cos x \cdot 0$... | # Tactic-Mode Proof Skeleton: Sine of Angle plus Full Angle
This artifact converts the prose proof of the identity $\sin(x + 2\pi) = \sin x$ into a structured sequence of Lean 4 tactics.
## Lean 4 Formalization
```lean
import Mathlib
theorem sin_add_two_pi (x : β) : Real.sin (x + 2 * Ο) = Real.sin x := by
-- Step... | 1,292 | 457 |
proofwiki:Sine_of_Angle_plus_Full_Angle#aug8 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | lean | 3 | Minimal Import Identification | Analyze the constants and functions used ($\sin$, $\pi$, $2\pi$) to build a minimal `import` list. Determine if `Analysis.SpecialFunctions.Trigonometric.Basic` is sufficient or if additional imports like `Topology.Instances` or `Data.Real.Basic` are required to bring the definition of $\pi$ and the basic properties of ... | # Minimal Import Identification: Sine of Angle plus Full Angle
This analysis determines the minimal set of Lean 4 / Mathlib4 imports required to formalize the theorem $\sin(x + 2\pi) = \sin x$.
## 1. Constant and Function Analysis
To formalize the statement and the provided proof, the following mathematical objects ... | 3,442 | 890 |
proofwiki:Sine_of_Angle_plus_Full_Angle#aug9 | proofwiki:Sine_of_Angle_plus_Full_Angle | Sine of Angle plus Full Angle | theorem | https://proofwiki.org/wiki/Sine_of_Angle_plus_Full_Angle | lean | 4 | Goal-First Refinement | Restate the proof by working backward from the goal $\sin x$. Practice using `refine` or `calc` blocks to mirror the ProofWiki structure. In a `calc` block, explicitly write out the intermediate steps ($\sin(x + 2\pi) = \dots = \dots = \sin x$), ensuring that each step is a valid Lean equality that can be closed by a s... | # Goal-First Refinement: $\sin(x + 2\pi) = \sin x$
## Backward Reasoning Chain
To prove the goal $\sin(x + 2\pi) = \sin x$, we work backward from the target expression to the starting expression:
1. **Goal:** $\sin x$
2. **Step 2 (Simplify constants):** $\sin x$ is equivalent to $\sin x \cdot 1 + \cos x \cdot 0$.
3. ... | 1,614 | 545 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug0 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | agnostic | 0 | Reverse-Engineer the Derivation | Start with a blank sheet of paper and the goal state: $\sin^2 x = \frac{1 - \cos 2x}{2}$. Instead of following the proof forward, work backward: ask yourself, "What identity relates a squared sine term to a cosine term of double the angle?" Once you identify the Double Angle Formula for Cosine ($\cos 2x = 1 - 2\sin^2 x... | # Reverse-Engineering the Power Reduction Formula for Sine Squared
## Goal State
The objective is to derive the identity:
$$\sin^2 x = \frac{1 - \cos 2x}{2}$$
## Step 1: Identify the Connecting Identity
To work backward, I must identify a known trigonometric identity that relates a squared sine term ($\sin^2 x$) to a... | 1,316 | 421 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug1 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | agnostic | 1 | Concrete Numerical Verification | Pick a non-trivial angle for $x$ (e.g., $x = \pi/6$ or $30^\circ$) where the sine and cosine values are known. Calculate the left-hand side ($\sin^2 x$) and the right-hand side ($\frac{1 - \cos 2x}{2}$) independently. By manually computing both sides and confirming they reach the same numerical value, you anchor the ab... | # Concrete Numerical Verification: Power Reduction Formula for $\sin^2 x$
## Objective
Verify the identity $\sin^2 x = \frac{1 - \cos 2x}{2}$ by substituting a specific angle $x$ and calculating both sides of the equation independently to ensure they yield the same numerical result.
## Selection of Angle
I will use $... | 1,553 | 570 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug2 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | agnostic | 2 | Symmetry Construction (Cosine Version) | Using the same logical structure provided in the proof, derive the corresponding power reduction formula for $\cos^2 x$. Start with the alternative form of the Double Angle Formula for Cosine ($\cos 2x = 2\cos^2 x - 1$) and solve for $\cos^2 x$. Compare the resulting formula to the sine version; identify the specific s... | # Derivation of Power Reduction Formula for $\cos^2 x$
## Derivation
Following the logical structure used to derive the sine power reduction formula, we begin with the alternative form of the Double Angle Formula for Cosine that expresses $\cos 2x$ in terms of $\cos^2 x$.
**Step 1: State the Double Angle Formula**
$$... | 1,651 | 503 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug3 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | agnostic | 3 | Visual-Geometric Paraphrase | Imagine or sketch a unit circle. Explain out loud how the "squaring" of a vertical projection (sine) relates to the horizontal projection (cosine) of an angle twice as large. Describe the proof not as algebraic steps, but as a transformation: "I am transforming a second-degree expression of a single angle into a first-... | # Visual-Geometric Paraphrase: Power Reduction for Sine
## The Geometric Intuition
Imagine a unit circle. For any angle $x$, the vertical distance from the x-axis to the point on the circle is represented by $\sin x$. When we speak of $\sin^2 x$, we are conceptually dealing with the area of a square whose side length ... | 1,797 | 461 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug4 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | agnostic | 4 | Dependency Mapping | Create a small conceptual map showing the "ancestry" of this theorem. Place "Power Reduction for Sine Squared" at the center. Draw a directed arrow backward to its primary dependency: "Double Angle Formula for Cosine." Then, draw an arrow backward from the Double Angle Formula to the "Cosine Addition Formula" ($\cos(A+... | # Dependency Map: Power Reduction for Sine Squared
## Conceptual Ancestry Flow
**Cosine Addition Formula** $\longrightarrow$ **Double Angle Formula for Cosine** $\longrightarrow$ **Power Reduction for Sine Squared**
---
## Detailed Breakdown of Dependencies
### 1. The Root: Cosine Addition Formula
The foundation o... | 1,550 | 433 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug5 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | lean | 0 | Typeclass and Signature Specification | Draft the complete `theorem` signature, focusing on the correct typeclasses for the variable $x$. Since this is a trigonometric identity, determine whether to use `Real` or a more general `RealEuclideanSpace` or `Complex`, and ensure the signature uses the standard mathlib notation for powers (e.g., `Real.sin x ^ 2`). | # Typeclass and Signature Specification: Power Reduction Formula (Sine Squared)
## Mathematical Analysis
The goal is to formalize the identity $\sin^2 x = \frac{1 - \cos 2x}{2}$.
1. **Domain of Variable**: The identity is a fundamental property of trigonometric functions. In `mathlib4`, these are typically defined ... | 1,605 | 430 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug6 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | lean | 1 | Lemma Mapping for Double Angle Identities | Identify the specific mathlib lemma that corresponds to the "Double Angle Formula for Cosine" cited in the proof. Search the `Analysis.SpecialFunctions.Trigonometric.Basic` namespace to find the exact theorem (e.g., `Real.cos_two_mul`) and determine if it matches the required orientation or if `rw [β ...]` is needed. | # Lemma Mapping: Double Angle Formula for Cosine
## 1. Identification of the Mathematical Claim
The source document proves the power reduction formula $\sin^2 x = \frac{1 - \cos 2x}{2}$. The core of this proof relies on the **Double Angle Formula for Cosine**, specifically the variant:
$$\cos 2x = 1 - 2 \sin^2 x$$
##... | 2,695 | 887 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug7 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | lean | 2 | Tactic-Based Step Prediction | Map each line of the ProofWiki derivation to a specific Lean 4 tactic. For the "solving for $\sin^2 x$" and "rearranging terms" steps, predict whether `field_simp`, `ring`, or `linarith` would be most effective for transforming the expression into the desired goal state. | # Tactic-Based Step Prediction: Power Reduction Formula for Sine Squared
This artifact maps the mathematical derivation of the identity $\sin^2 x = \frac{1 - \cos 2x}{2}$ to specific Lean 4 tactics, predicting the most efficient automation for each transformation.
## Mapping Derivation to Tactics
| ProofWiki Step | ... | 2,938 | 915 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug8 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | lean | 3 | Goal-First Refinement Path | Restate the proof as a sequence of goals using `refine` or `apply`. Start with the goal `h : Real.sin x ^ 2 = (1 - Real.cos (2 * x)) / 2` and work backward to see if it is more efficient to start by applying the double angle formula to the right-hand side or by manipulating the left-hand side to match a known identity. | # Goal-First Refinement Path: Power Reduction for Sine Squared
This artifact explores the proof of the identity $\sin^2 x = \frac{1 - \cos 2x}{2}$ by working backward from the goal to the known axioms/identities, specifically comparing different starting points for the refinement path.
## Target Goal
The objective is... | 2,895 | 936 |
proofwiki:Power_Reduction_Formulas/Sine_Squared#aug9 | proofwiki:Power_Reduction_Formulas/Sine_Squared | Power Reduction Formulas/Sine Squared | theorem | https://proofwiki.org/wiki/Power_Reduction_Formulas/Sine_Squared | lean | 4 | Minimal Import Dependency Analysis | Determine the absolute minimum set of `import` statements required to make the theorem compile. Identify whether `Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic` is sufficient or if additional imports for algebraic manipulation (like `Mathlib.Tactic.Ring` or `Mathlib.Tactic.Linarith`) are necessary to implement ... | # Minimal Import Dependency Analysis: Power Reduction Formula for Sine Squared
This analysis determines the minimum set of Lean 4 imports required to formalize the theorem $\sin^2 x = \frac{1 - \cos 2x}{2}$.
## Theorem Formalization
The goal is to prove the identity:
$$\forall x : \mathbb{R}, \sin(x)^2 = \frac{1 - \c... | 3,732 | 1,001 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug0 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | agnostic | 0 | Truth Table Reconstruction | Clear your workspace of the document and attempt to construct the truth table for $\neg (p \iff \neg p)$ from scratch. Create columns for $p$, $\neg p$, the biconditional $(p \iff \neg p)$, and finally the outer negation. Once completed, compare your final column with the document to verify that you have produced a tau... | # Truth Table Reconstruction: $\neg (p \iff \neg p)$
## Objective
To verify the theorem $\vdash \neg (p \iff \neg p)$ by independently reconstructing the truth table to determine if the expression is a tautology.
## Step-by-Step Construction
**1. Identify Variables:**
The expression contains one propositional variab... | 1,635 | 511 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug1 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | agnostic | 1 | Semantic Translation and Paraphrase | Translate the symbolic expression $\neg (p \iff \neg p)$ into a natural language sentence using a concrete example (e.g., let $p$ be "It is raining"). Then, explain in plain English why this statement must be true regardless of whether it is actually raining. Focus your explanation on the inherent contradiction of the ... | # Semantic Translation: $\neg (p \iff \neg p)$
## 1. Natural Language Translation
To translate the symbolic expression $\neg (p \iff \neg p)$ into plain English, let us assign a concrete meaning to the proposition $p$:
**Let $p$ be: "It is raining."**
Then $\neg p$ is: "It is not raining."
The expression $(p \iff \n... | 1,606 | 436 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug2 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | agnostic | 2 | Logical Equivalence Transformation | Using known logical laws (such as the definition of the biconditional $(a \iff b) \equiv (a \implies b) \land (b \implies a)$ or the XOR relationship), algebraically manipulate the expression $\neg (p \iff \neg p)$ to simplify it to a known tautology like $\top$ or $p \lor \neg p$. This moves the learning from a visual... | # Logical Equivalence Transformation: $\neg (p \iff \neg p)$
The objective is to move beyond the truth table verification provided in the source document and prove the theorem $\vdash \neg (p \iff \neg p)$ using symbolic algebraic manipulation and known logical laws.
## 1. Decomposition of the Biconditional
By the de... | 1,911 | 582 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug3 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | agnostic | 3 | Contrast with the Law of Non-Contradiction | Compare this theorem to the Law of Non-Contradiction, $\neg (p \land \neg p)$. Identify the structural difference between the "and" ($\land$) operator and the "biconditional" ($\iff$) operator in these two contexts. Analyze why the biconditional version is essentially a statement about the impossibility of a propositio... | # Contrast Analysis: Law of Non-Contradiction vs. Biconditional of Negation
## 1. Structural Comparison
The objective is to compare the Law of Non-Contradiction (LNC) with the theorem $\vdash \neg (p \iff \neg p)$. Both are contradictions (statements that are always false), but they utilize different logical operators... | 2,484 | 708 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug4 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | agnostic | 4 | Hypothesis Variation (The "What If" Analysis) | Explore what happens if the outer negation is removed, leaving only $(p \iff \neg p)$. Construct a truth table for this modified expression and identify its classification (e.g., tautology, contradiction, or contingency). By proving that $(p \iff \neg p)$ is a contradiction, you will internalize why the original theore... | # Hypothesis Variation: Analysis of $(p \iff \neg p)$
## Objective
The original theorem states that $\neg (p \iff \neg p)$ is a tautology (a necessary truth). To understand why this is the case, I will perform a "What If" analysis by removing the outer negation. I will examine the inner expression $(p \iff \neg p)$ to... | 1,789 | 495 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug5 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | lean | 0 | Type-Level Signature Drafting | Draft the formal `theorem` statement using `Prop` as the type for $p$. Focus on correctly translating the logical symbols into Lean 4 syntax (`Β¬`, `β`), ensuring the signature is a closed term of type `Prop` (i.e., `theorem name : Β¬(p β Β¬p)`). Experiment with whether $p$ should be a fixed hypothesis or a universally qu... | # Type-Level Signature Drafting: Biconditional of Proposition and its Negation
## Logical Analysis
The source document presents the theorem $\vdash \neg (p \iff \neg p)$.
- The symbol $\vdash$ indicates that the statement is a tautology (provable from no hypotheses).
- The variable $p$ is a proposition.
- The operato... | 2,288 | 673 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug6 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | lean | 1 | Truth Table to Tactic Mapping | Since the proof is provided via a truth table, practice translating "case analysis" into Lean tactics. Map the rows of the table to the `cases p` or `by_cases h : p` tactics. For each resulting branch, determine which basic propositional tactics (such as `intro`, `contradiction`, or `simp`) would resolve the goal based... | # Truth Table to Tactic Mapping: $\neg (p \iff \neg p)$
This artifact demonstrates how to translate a truth table proof into a Lean 4 formal proof. The source document proves $\neg (p \iff \neg p)$ by exhaustively checking the truth values of $p$. In Lean, this exhaustive check is implemented via case analysis.
## 1.... | 3,256 | 999 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug7 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | lean | 2 | Exhaustive Tactic Prediction | Predict the minimal set of tactics required to close the proof. Specifically, compare the efficiency of using `tauto` or `simp` (which automate propositional tautologies) against a manual structural proof using `intro` and `absurd`. Determine if `linarith` or `ring` are irrelevant here and identify why `omega` (for fin... | # Tactic Prediction Analysis: $\neg (p \iff \neg p)$
This analysis evaluates the most efficient Lean 4 tactics for proving the theorem $\neg (p \iff \neg p)$, comparing automated decision procedures against manual structural decomposition.
## 1. Formal Statement in Lean 4
The theorem is expressed as a proposition whe... | 3,456 | 916 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug8 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | lean | 3 | Lemma Decomposition and Library Search | Break the biconditional $\neg(p \iff \neg p)$ into its constituent implications: $(p \implies \neg p) \implies \neg p$ and $(\neg p \implies p) \implies p$. Search `mathlib4` for existing lemmas that handle "negation of a biconditional" or "law of non-contradiction" to see if the entire proof can be reduced to a single... | # Lemma Decomposition and Library Search: $\neg(p \iff \neg p)$
## 1. Decomposition of the Goal
The goal is to prove the proposition $\neg (p \iff \neg p)$. In classical logic, a biconditional $p \iff q$ is equivalent to $(p \implies q) \land (q \implies p)$. Substituting $\neg p$ for $q$, we have:
$$(p \iff \neg p) \... | 3,893 | 1,157 |
proofwiki:Biconditional_of_Proposition_and_its_Negation#aug9 | proofwiki:Biconditional_of_Proposition_and_its_Negation | Biconditional of Proposition and its Negation | theorem | https://proofwiki.org/wiki/Biconditional_of_Proposition_and_its_Negation | lean | 4 | Minimal Import Identification | Determine the smallest possible set of imports needed to formalize this statement. Test whether the theorem can be proven using only the Lean 4 core library (since it is a basic result of intuitionistic or classical logic) or if `Mathlib.Tactic` or `Mathlib.Logic.Basic` is required to access specific automation tactics... | # Minimal Import Identification: $\neg (p \iff \neg p)$
The goal is to identify the minimum set of imports required to formalize the theorem $\neg (p \iff \neg p)$ in Lean 4.
## Logical Analysis
The statement $\neg (p \iff \neg p)$ is a fundamental result of propositional logic. In Lean 4, the biconditional $p \iff q... | 2,307 | 674 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug0 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | agnostic | 0 | Axiomatic Checklist | Create a two-column table. In the left column, list every axiom required for a structure to be a "unitary $R$-module" (including the underlying additive group axioms, the module action axioms, and the unitary axiom). In the right column, explicitly map each axiom back to the corresponding property of the ring $\struct ... | # Axiomatic Checklist: $R$ as a Unitary $R$-module
The following table maps the axioms required for $\struct{R, +, \circ}_R$ to be a unitary $R$-module to the corresponding properties of the ring $\struct{R, +, \circ}$.
| Unitary $R$-module Axiom | Corresponding Ring Property of $\struct{R, +, \circ}$ |
| :--- | :---... | 1,267 | 396 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug1 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | agnostic | 1 | Hypothesis Stress-Test | Consider what happens if you remove the "Unity" hypothesis. Attempt to construct a concrete example of a ring without unity (a "rng," such as $2\mathbb{Z}$) and verify if it can still be a module over itself. Then, check if it can be a *unitary* module. This contrast will help you internalize exactly why the existence ... | # Hypothesis Stress-Test: The Necessity of Unity for Unitary Modules
## The Core Hypothesis
The theorem states that if a ring $R$ has a unity $1_R$, then $R$ is a **unitary** $R$-module over itself. The critical requirement for a module $M$ over a ring $R$ to be "unitary" is that the multiplicative identity of the rin... | 2,674 | 837 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug2 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | agnostic | 2 | Dependency Mapping | Trace the logical lineage of this proof. Start with this theorem and draw an arrow backward to the "Ring is Module over Itself" result. From there, identify which ring axioms (distributivity, associativity) are being "borrowed" to satisfy the module axioms. By mapping these dependencies, you transform a trivial proof i... | # Dependency Map: Ring with Unity as a Unitary Module
## 1. Logical Lineage Trace
The proof follows a hierarchical path of specialization, moving from the general structure of a module to the specific structure of a unitary module.
**Target Theorem:** $\struct {R, +, \circ}_R$ is a unitary $R$-module.
$\downarrow$
**... | 2,597 | 737 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug3 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | agnostic | 3 | Concrete Instantiation | Apply this theorem to a specific, non-trivial ring, such as the ring of $2\times 2$ real matrices $M_2(\mathbb{R})$. Explicitly write out what the "module action" looks like in this case (matrix multiplication) and demonstrate with a concrete matrix $A$ that $I \cdot A = A$, where $I$ is the identity matrix. This moves... | # Concrete Instantiation: The Ring $M_2(\mathbb{R})$ as a Module over Itself
## 1. The Selection of the Ring
To instantiate the theorem that a ring with unity $R$ is a unitary $R$-module over itself, we consider the ring of $2 \times 2$ real matrices:
$$R = M_2(\mathbb{R}) = \left\{ \begin{pmatrix} a & b \\ c & d \end... | 2,141 | 747 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug4 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | agnostic | 4 | Reverse Paraphrase | Explain this theorem to an imaginary peer who knows what a ring is but has just been introduced to the definition of a unitary module. Instead of following the proof's linear path, explain it as a "promotion": "We already know every ring is a module over itself; adding a unity to the ring promotes that module to a *uni... | # Understanding the Promotion: From $R$-Module to Unitary $R$-Module
So, you've just learned the definition of a **unitary module**. At first glance, it looks like just another axiom to memorize, but it's helpful to think about it as a "promotion" of a structure we already understand.
### The Starting Point: The Ring... | 1,913 | 497 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug5 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | lean | 0 | Typeclass Signature Mapping | Draft the complete `theorem` signature, focusing on the translation of mathematical structures into Lean 4 typeclasses. Specifically, practice declaring the ring $R$ using `[Ring R]` and specifying the module structure using `Module R R`. Focus on how to represent "the ring as a module over itself" by identifying the c... | # Typeclass Signature Mapping: Ring as a Unitary Module over Itself
## Mathematical Analysis
The goal is to translate the statement "A ring $R$ with unity $1_R$ is a unitary $R$-module over itself" into a Lean 4 theorem signature.
1. **The Ring $R$**: In mathlib4, a ring with unity is represented by the `Ring` typec... | 3,019 | 805 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug6 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | lean | 1 | Axiom-to-Tactic Mapping | For the final step of the proof ("The axiom follows from the definition of a unity"), identify the exact mathlib lemma or definition that provides this equality. Predict which tactic would close the goal: whether it is a simple `rw [one_mul]` (or the equivalent for the specific module action) or if `simp` would suffice... | # Axiom-to-Tactic Mapping: Ring with Unity as Unitary Module
## Goal Analysis
The source document aims to prove that a ring $R$ with unity $1_R$ is a unitary $R$-module over itself. The critical step is verifying the unitary axiom:
$$\forall x \in R, 1_R \circ x = x$$
In the context of a ring acting on itself as a mo... | 1,994 | 537 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug7 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | lean | 2 | Dependency Graphing | Decompose the proof into its logical prerequisites to mirror a Lean file's structure. Since the proof explicitly references "Ring is Module over Itself," practice creating a minimal `import` list and a sequence of `have` blocks or separate `lemma` declarations. Determine if the "Ring is Module over Itself" part is alre... | # Dependency Graph: Ring with Unity as a Unitary Module
## 1. Logical Decomposition
To formalize the theorem "Ring with Unity is Module over Itself," the proof can be decomposed into the following prerequisite layers:
1. **Algebraic Structures**:
* A Ring $R$ (additive group with multiplication).
* The ... | 3,155 | 848 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug8 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | lean | 3 | Goal-Driven Refinement | Restate the proof goal-first by starting with the final conclusion (`is_unitary`) and using `refine` or `apply` to break it down. Since a unitary module requires verifying a specific property for all $x \in R$, practice using `intro x` to move the universal quantifier into the local context, then determine how to trans... | # Goal-Driven Refinement: Ring with Unity is a Unitary Module
This artifact demonstrates the process of proving that a ring $R$ with unity $1_R$ is a unitary module over itself, focusing on a goal-driven refinement approach. In Lean 4, this involves starting with the high-level property and decomposing it into its con... | 2,881 | 829 |
proofwiki:Ring_with_Unity_is_Module_over_Itself#aug9 | proofwiki:Ring_with_Unity_is_Module_over_Itself | Ring with Unity is Module over Itself | theorem | https://proofwiki.org/wiki/Ring_with_Unity_is_Module_over_Itself | lean | 4 | Instance Search Simulation | Simulate the process of finding the "unitary" property within mathlib4's hierarchy. Instead of writing the proof, search for the specific `instance` or `class` that defines a unitary module. Contrast the ProofWiki approach (treating "unitary" as an additional axiom) with Lean's approach (where `Module` usually implies ... | # Instance Search Simulation: Unitary Modules in Mathlib4
## 1. Goal and Simulation Objective
The objective is to formalize the theorem "A Ring with Unity is a Module over Itself." The source document treats "unitary" as an additional axiom that must be verified after establishing the basic module structure. I will si... | 3,942 | 1,008 |
proofwiki:Logarithm_is_Strictly_Concave#aug0 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | agnostic | 0 | Dependency Mapping | Create a directed graph of the logical dependencies used in this proof. Start with the conclusion ("$\ln x$ is strictly concave") and draw arrows backward to every prerequisite result cited in the text (e.g., "Real Function is Strictly Concave iff Derivative is Strictly Decreasing," "Second Derivative of Natural Logari... | # Dependency Map: Proof that $\ln x$ is Strictly Concave
## Logical Dependency Graph
**[$\ln x$ is strictly concave]**
$\uparrow$
*(Arrow 1)*
$\uparrow$
**[Real Function is Strictly Concave iff Derivative is Strictly Decreasing]**
$\uparrow$
*(Arrow 2)*
$\uparrow$
**[$D \ln x$ is strictly decreasing]**
$\uparrow$
*(A... | 1,460 | 405 |
proofwiki:Logarithm_is_Strictly_Concave#aug1 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | agnostic | 1 | Numerical Verification (Concrete Example) | Pick a specific interval, such as $[1, 2]$, and verify the concavity numerically. Calculate the value of $\ln x$ at the endpoints and the midpoint. Show that the average of the logarithms $\frac{\ln(1) + \ln(2)}{2}$ is strictly less than the logarithm of the average $\ln(\frac{1+2}{2})$. Then, calculate the second deri... | # Numerical Verification of the Strict Concavity of $\ln x$
This artifact provides a concrete numerical verification of the theorem stating that $\ln x$ is strictly concave for $x > 0$. According to the definition of strict concavity, for any two distinct points $x_1, x_2$ in the domain, the function value of the aver... | 2,185 | 738 |
proofwiki:Logarithm_is_Strictly_Concave#aug2 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | agnostic | 2 | Hypothesis Stress-Testing | Explore the boundaries of the theorem by attempting to apply the logic to $x \le 0$. Explain why the proof fails immediately when $x = 0$ (division by zero in the second derivative) and why the natural logarithm is not defined for $x < 0$ in the context of real numbers. Then, consider what happens if the domain is rest... | # Hypothesis Stress-Testing: Concavity of $\ln x$
This analysis explores the boundaries of the theorem stating that $\ln x$ is strictly concave for $x > 0$ by attempting to extend the logic to $x \le 0$.
## Testing the Boundary $x = 0$
The proof of strict concavity relies on the second derivative of the natural loga... | 2,403 | 649 |
proofwiki:Logarithm_is_Strictly_Concave#aug3 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | agnostic | 3 | Alternative Proof Route (First Principles) | Instead of using the second derivative test, attempt to prove the strict concavity using the formal definition of a concave function: $f(tx + (1-t)y) > tf(x) + (1-t)f(y)$ for $t \in (0, 1)$. Use the properties of logarithmsβspecifically that $\ln(ab) = \ln a + \ln b$ and that $\ln x$ is strictly increasingβto see if yo... | # First Principles Proof of the Strict Concavity of $\ln x$
## Objective
The source document proves that $f(x) = \ln x$ is strictly concave for $x > 0$ by showing that its second derivative $D^2 \ln x = -1/x^2$ is strictly negative. This artifact attempts to prove the same result using the formal definition of strict ... | 2,661 | 889 |
proofwiki:Logarithm_is_Strictly_Concave#aug4 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | agnostic | 4 | Contrast with Convexity | Construct a "mirror" version of this proof for a function that is strictly convex (for example, $f(x) = x^2$ or $f(x) = e^x$). Write out the steps side-by-side: where the current proof requires $D^2 \ln x < 0$, what must be true for the convex function? Where the current proof cites "strictly decreasing" derivatives, w... | # Contrast Study: Strict Concavity vs. Strict Convexity
This artifact contrasts the proof that $f(x) = \ln x$ is strictly concave with a mirror proof showing that $g(x) = e^x$ is strictly convex. The goal is to isolate the sign of the second derivative as the pivoting mechanism that determines the curvature of the fun... | 2,392 | 742 |
proofwiki:Logarithm_is_Strictly_Concave#aug5 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | lean | 0 | Typeclass and Signature Drafting | Draft the `theorem` signature, focusing on the correct translation of "strictly concave" into mathlib's terminology (likely using `StrictlyConcave` or a definition involving the second derivative). Pay specific attention to the hypothesis $x > 0$; determine whether this should be a local hypothesis `(hx : x > 0)` or if... | # Typeclass and Signature Drafting: Strict Concavity of the Natural Logarithm
## Analysis of Mathematical Translation
The goal is to formalize the theorem that the natural logarithm function $f(x) = \ln x$ is strictly concave for $x > 0$.
### 1. Domain Specification
The source document specifies the condition $x > ... | 3,096 | 872 |
proofwiki:Logarithm_is_Strictly_Concave#aug6 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | lean | 1 | Tactic Prediction Mapping | Go through the prose proof and map each sentence to a specific Lean 4 tactic or automation tool. For example, identify where `linarith` or `positivity` would be used to prove that $-1/x^2 < 0$, and where `rw` or `simp` would be used to substitute the second derivative of `Real.log`. | # Tactic Prediction Mapping: Logarithm is Strictly Concave
This document maps the prose steps of the proof that $f(x) = \ln x$ is strictly concave to the corresponding Lean 4 tactics and library lemmas required for formalization.
## Formalization Context
To formalize this, we assume the following setup:
* **Function*... | 2,533 | 827 |
proofwiki:Logarithm_is_Strictly_Concave#aug7 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | lean | 2 | Mathlib Lemma Hunting | For every named reference in the ProofWiki text (e.g., "Second Derivative of Natural Logarithm Function"), search the mathlib4 documentation to find the exact lemma name (e.g., `deriv2_log`). Create a mapping table between the prose claim and the formal lemma, noting if the lemma requires specific preconditions (like `... | # Mathlib Lemma Mapping: Logarithm is Strictly Concave
This table maps the mathematical claims and named results from the ProofWiki document "Logarithm is Strictly Concave" to their corresponding lemmas and definitions in Lean 4's `mathlib4`.
| Prose Claim / Named Reference | Mathlib4 Lemma / Definition | Preconditio... | 2,386 | 675 |
proofwiki:Logarithm_is_Strictly_Concave#aug8 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | lean | 3 | Goal-Oriented Proof Decomposition | Restate the proof "backwards" by starting with the final goal (`StrictlyConcave Real.log`) and using `apply` or `refine` to break it down. Determine the exact sequence of goals that would be generated: first, showing the derivative is strictly decreasing, then showing the second derivative is strictly negative, and fin... | # Goal-Oriented Proof Decomposition: $\ln x$ is Strictly Concave
This decomposition breaks down the proof of the strict concavity of the natural logarithm by working backward from the final goal to the initial calculation, mimicking the logic of a Lean 4 proof script using `apply` and `refine`.
## Final Goal
**Goal:*... | 2,776 | 849 |
proofwiki:Logarithm_is_Strictly_Concave#aug9 | proofwiki:Logarithm_is_Strictly_Concave | Logarithm is Strictly Concave | theorem | https://proofwiki.org/wiki/Logarithm_is_Strictly_Concave | lean | 4 | Minimal Import Synthesis | Analyze the mathematical objects usedβreal numbers, natural logarithms, derivatives, and concavityβto build the smallest possible list of `import` statements. Distinguish between core `Analysis.SpecialFunctions.Log` and the more general `Analysis.Calculus.Deriv.Basic` or `Analysis.Convex.Concave` modules needed to make... | # Minimal Import Synthesis: Logarithm is Strictly Concave
This analysis identifies the precise Lean 4 `mathlib4` modules required to formalize the theorem that the natural logarithm is strictly concave on the interval $(0, \infty)$.
## Mathematical Object Analysis
To formalize the statement and proof provided in the... | 2,488 | 640 |
proofwiki:Complex_Plane_is_Banach_Space#aug0 | proofwiki:Complex_Plane_is_Banach_Space | Complex Plane is Banach Space | theorem | https://proofwiki.org/wiki/Complex_Plane_is_Banach_Space | agnostic | 0 | Dependency Mapping | Create a directed graph of the logical dependencies required to prove this theorem. Start with "Complex Plane is a Banach Space" as the root node, and draw arrows to the three supporting pillars mentioned in the proof: the definition of a vector space over $\mathbb{C}$, the proof that the complex modulus satisfies the ... | # Dependency Map: Complex Plane is a Banach Space
Below is the logical dependency mapping required to establish that the complex plane $\mathbb{C}$ is a Banach space.
## Logical Dependency Graph
**[Root] Complex Plane is a Banach Space**
$\downarrow$
*(Requires the following three pillars)*
$\downarrow$
1. $\righta... | 1,416 | 330 |
proofwiki:Complex_Plane_is_Banach_Space#aug1 | proofwiki:Complex_Plane_is_Banach_Space | Complex Plane is Banach Space | theorem | https://proofwiki.org/wiki/Complex_Plane_is_Banach_Space | agnostic | 1 | Definition Decomposition | To internalize why this theorem is a "composite" result, list the three distinct mathematical structures involved: a Vector Space, a Normed Vector Space, and a Banach Space. For each, write down the minimal set of additional requirements needed to move from one to the next (e.g., Vector Space $\xrightarrow{+ \text{Norm... | # Definition Decomposition: Complex Plane as a Banach Space
## 1. Structural Hierarchy
To establish that the complex plane $\mathbb{C}$ is a Banach space, it must be viewed as a composite of three nested mathematical structures. Each level adds a specific layer of constraint or property to the previous one.
### Level... | 2,122 | 508 |
proofwiki:Complex_Plane_is_Banach_Space#aug2 | proofwiki:Complex_Plane_is_Banach_Space | Complex Plane is Banach Space | theorem | https://proofwiki.org/wiki/Complex_Plane_is_Banach_Space | agnostic | 2 | Concrete Sequence Verification | To ground the "completeness" aspect of the proof, construct a concrete Cauchy sequence of complex numbers that converges to a point in $\mathbb{C}$ (e.g., $z_n = \sum_{k=1}^n \frac{i^k}{k^2}$). Explicitly show how the complex modulus $|\cdot|$ is used to prove the sequence is Cauchy and how the completeness of the real... | # Concrete Sequence Verification: Completeness of $\mathbb{C}$
To verify the claim that the complex plane $\mathbb{C}$ is a Banach space, we must demonstrate that it is a complete normed vector space. A space is complete if every Cauchy sequence of its elements converges to a limit within the space. This verification ... | 3,222 | 1,139 |
proofwiki:Complex_Plane_is_Banach_Space#aug3 | proofwiki:Complex_Plane_is_Banach_Space | Complex Plane is Banach Space | theorem | https://proofwiki.org/wiki/Complex_Plane_is_Banach_Space | agnostic | 3 | Hypothesis Variation | Consider what happens if you change the scalar field. Analyze whether the complex plane $\mathbb{C}$ remains a Banach space if it is viewed as a vector space over the real numbers $\mathbb{R}$ instead of $\mathbb{C}$. Determine if the modulus still serves as a valid norm and if the space remains complete. This will hel... | # Hypothesis Variation: The Complex Plane $\mathbb{C}$ as a Vector Space over $\mathbb{R}$
The source document establishes that the complex plane $\mathbb{C}$, equipped with the complex modulus, is a Banach space over the field $\mathbb{C}$. To better understand the relationship between the underlying set and the scal... | 3,584 | 1,008 |
proofwiki:Complex_Plane_is_Banach_Space#aug4 | proofwiki:Complex_Plane_is_Banach_Space | Complex Plane is Banach Space | theorem | https://proofwiki.org/wiki/Complex_Plane_is_Banach_Space | agnostic | 4 | Active Recall Reconstruction | Close the document and attempt to prove the theorem from scratch on a blank sheet of paper. Instead of just writing the conclusions, force yourself to explicitly name the theorem or definition that justifies every single leap in logic. If you cannot remember the name of a prerequisite (e.g., "Complex Modulus is Norm"),... | # Reconstruction: Complex Plane is Banach Space
**Theorem:** The complex plane $\mathbb{C}$, equipped with the complex modulus $|\cdot|$, forms a Banach space over $\mathbb{C}$.
**Proof Reconstruction:**
1. **Vector Space Requirement:**
First, I must establish that the underlying set and field structure are cor... | 1,420 | 349 |
proofwiki:Complex_Plane_is_Banach_Space#aug5 | proofwiki:Complex_Plane_is_Banach_Space | Complex Plane is Banach Space | theorem | https://proofwiki.org/wiki/Complex_Plane_is_Banach_Space | lean | 0 | Typeclass Hierarchy Mapping | Identify the chain of typeclass inheritance required to satisfy the definition of a Banach space in mathlib4. Specifically, map the prose claims to the required Lean instances: from `Complex` being a `VectorSpace` over itself, to the existence of a `NormedAddCommGroup` instance, and finally to the `CompleteSpace` insta... | # Typeclass Hierarchy Mapping: Complex Plane as a Banach Space
This artifact maps the mathematical claims in the source document to the formal typeclass hierarchy used in Lean 4's `mathlib4` to define a Banach space.
## 1. Mapping Prose to Typeclasses
The source document claims that the complex plane $\mathbb{C}$ is... | 3,397 | 933 |
proofwiki:Complex_Plane_is_Banach_Space#aug6 | proofwiki:Complex_Plane_is_Banach_Space | Complex Plane is Banach Space | theorem | https://proofwiki.org/wiki/Complex_Plane_is_Banach_Space | lean | 1 | Lemma Correspondence Audit | For each sentence in the proof, locate the exact corresponding lemma or instance in mathlib4. For the claim regarding norm axioms, search for the `NormedAddCommGroup` instance for `Complex`; for the completeness claim, locate the specific lemma (e.g., `Complex.complete` or the instance `CompleteSpace Complex`). This br... | # Lemma Correspondence Audit: Complex Plane as a Banach Space
This audit maps the high-level mathematical claims in the proof that the complex plane $\mathbb{C}$ is a Banach space over itself to the specific types, instances, and lemmas found in `mathlib4`.
## 1. Vector Space Structure
**Claim:** "The complex plane $... | 3,109 | 858 |
proofwiki:Complex_Plane_is_Banach_Space#aug7 | proofwiki:Complex_Plane_is_Banach_Space | Complex Plane is Banach Space | theorem | https://proofwiki.org/wiki/Complex_Plane_is_Banach_Space | lean | 2 | Tactic-Mode Skeleton Construction | Draft a proof skeleton using `have` blocks that mirror the structure of the ProofWiki document. For the first block, use `infer_instance` to handle the vector space requirement; for the second, use `exact` to point to the norm axioms; and for the third, use `exact` for completeness. This exercises the ability to decomp... | # Tactic-Mode Skeleton: Complex Plane as a Banach Space
This artifact decomposes the proof that the complex plane $\mathbb{C}$ is a Banach space over itself into a formal Lean 4 skeleton. A Banach space is defined as a normed vector space that is complete with respect to the metric induced by the norm.
## Formal Deco... | 3,202 | 863 |
proofwiki:Complex_Plane_is_Banach_Space#aug8 | proofwiki:Complex_Plane_is_Banach_Space | Complex Plane is Banach Space | theorem | https://proofwiki.org/wiki/Complex_Plane_is_Banach_Space | lean | 3 | Import List Minimization | Determine the minimal set of imports needed to make the statement and proof compile. Experiment with importing only the base `Complex` definitions versus the higher-level `Analysis.NormedSpace.Basic` or `Analysis.InnerProductSpace.Basic` modules. This teaches the learner where the "Banach" properties of $\mathbb{C}$ re... | # Import List Minimization: Complex Plane as a Banach Space
This study artifact explores the minimal set of imports required to formalize the statement that the complex plane $\mathbb{C}$ is a Banach space over itself. By stripping away the monolithic `import Mathlib` and testing specific modules, we can pinpoint wher... | 4,372 | 1,066 |
ProofWiki Active Reading
Synthetic mathematical study material produced by applying the Active Reading recipe (Meta, arXiv:2508.09494) to the full ProofWiki corpus.
For every source theorem the generator first invents document-specific study strategies, then executes each strategy against the source document to produce a study artifact β a worked numerical verification, a proof-dependency tree, a blind reconstruction, a Lean 4 signature draft, a tactic-mode skeleton, and so on. The artifacts, not the strategies, are the training data.
The corpus was built as the Active-Reading-WikiProof slice of the math bucket of a 2 T-token
annealing mix, and is released here as a companion asset to the accompanying tech report.
Contents
| Config | Rows | Description |
|---|---|---|
active_reading (default) |
185,319 | One row per study artifact. 18,532 source theorems Γ 10 artifacts (2 flavours Γ 5 strategies). 178.5 M Qwen2.5 tokens. |
proofwiki |
54,318 | The parsed ProofWiki source corpus: theorems, definitions, axioms and corollaries with all their proofs, in lightly-cleaned wikitext. |
from datasets import load_dataset
ar = load_dataset("OVHaiLLM/ProofWiki-ActiveReading", "active_reading", split="train")
pw = load_dataset("OVHaiLLM/ProofWiki-ActiveReading", "proofwiki", split="train")
# artifacts join back onto their source document
ar[0]["doc_id"] # 'proofwiki:Sine_of_Angle_plus_Full_Angle'
Models used
| Role | Model | Settings |
|---|---|---|
| Strategy generation (stage 1) and artifact writing (stage 2) | RedHatAI/gemma-4-31B-it-FP8-dynamic (FP8 quantization of google/gemma-4-31B-it) |
temperature 0.8, β€ 4096 generated tokens per artifact, served with vLLM |
| Lean repair attempt (validation only) | Goedel-LM/Goedel-Prover-V2-32B |
recovered none of the failing snippets; its outputs are not in this release |
Token counts (token_count) |
Qwen2.5 tokenizer (Qwen/Qwen2.5-7B-Instruct) |
How it was built
A two-stage vLLM pipeline, google/gemma-4-31b-it served as
RedHatAI/gemma-4-31B-it-FP8-Dynamic
for both stages.
Stage 1 β strategy generation. Each source document is shown to the model twice, once per flavour, and the model proposes 5 concrete, document-specific study strategies:
agnosticβ general mathematical mastery. The prompt asks for a spread of cognitive modes (active recall, paraphrase, working a concrete example, weakening a hypothesis, mapping lemma dependencies, comparing proof routes, contrasting with neighbouring theorems, building a counter-example).leanβ strategies aimed specifically at the downstream task of formalising the statement in Lean 4 / mathlib4: drafting a theorem signature with the right typeclasses, mapping each prose step to a mathlib lemma, restating the goal withapply/refine, predicting tactics, building a minimalimportlist.
Stage 2 β strategy application. Each (document, strategy) pair is executed independently, yielding one markdown study artifact (β€ 4096 generated tokens).
Source-document filter: kind == theorem, proof text β₯ 200 characters, document truncated to
8000 characters. That selects 18,532 of the 23,936 ProofWiki theorems.
The pipeline code lives in the math_lean.active_reading package of the training repo
(prompts.py, pipeline.py, client.py).
active_reading schema
| Field | Type | Notes |
|---|---|---|
id |
string | {doc_id}#aug{i}, i β 0β9 |
doc_id |
string | joins onto proofwiki.id |
title |
string | theorem title |
kind |
string | always theorem in this config |
source_url |
string | ProofWiki page |
flavour |
string | agnostic (92,660 rows) or lean (92,659) |
strategy_index |
int32 | 0β4, position within the flavour's 5 strategies |
strategy_name |
string | model-invented name, e.g. Dependency Mapping, Typeclass and Signature Drafting |
strategy_body |
string | the stage-1 strategy text that produced this artifact |
text |
string | the study artifact β the training text |
n_chars |
int32 | characters in text |
token_count |
int32 | Qwen2.5 tokens in text |
proofwiki schema
| Field | Type | Notes |
|---|---|---|
id, title, kind, source_url |
string | kind β definition (29,079), theorem (23,936), corollary (936), axiom (367) |
statement |
string | wikitext, LaTeX preserved |
proofs |
list<{name, text}> | often several per theorem; empty for most definitions |
n_proofs |
int32 | |
categories, wikilinks, sources, also_known_as |
list<string> | ProofWiki metadata; sources holds {{BookReference}} citations |
used_for_active_reading |
bool | true for the 18,532 documents that passed the filter |
active_reading_chunk |
string | the exact rendered document text fed to the generator (null otherwise) |
Statistics
- 185,319 artifacts over 18,532 distinct theorems (one generation failed and is dropped).
- 178,472,691 Qwen2.5 tokens β 76.98 M
agnostic+ 101.49 Mlean. Median artifact 958 tokens. - 49,257 distinct strategy names β strategies are re-invented per document, so the long tail is enormous; the head is dominated by recurring shapes:
| Strategy | Count |
|---|---|
| Dependency Mapping | 8,577 |
| Typeclass and Signature Drafting | 7,582 |
| Hypothesis Stress-Testing | 3,489 |
| Goal-First Refinement | 2,897 |
| Minimal Import Identification | 2,045 |
| Tactic-to-Step Mapping | 1,617 |
| Concrete Instantiation | 1,407 |
| Concrete Numerical Verification | 1,291 |
Known limitations
- The Lean 4 code is mostly not compilable. In a separate validation pass, 120,801 Lean
snippets were extracted from the
lean-flavour artifacts and compiled against Mathlib: 10,157 compiled cleanly (8.4 %), 7,955 compiled only withsorry(6.6 %), and 102,682 failed (85.0 %). A repair pass over every failing snippet withGoedel-Prover-V2-32Brecovered none of them. Treat thelean-flavour artifacts as pedagogical prose about formalisation, useful as pretraining signal, not as a verified formal corpus. The verification and repair records are not included in this release. - Artifacts are model-generated and not fact-checked; they can contain incorrect mathematics, hallucinated mathlib lemma names, and misattributed dependencies.
- Only
theorem-kind documents were augmented. Definitions, axioms and corollaries appear in theproofwikiconfig only. - Long documents were truncated to 8000 characters before generation, so artifacts for large pages may reference only part of the source.
- The source wikitext is lightly cleaned but still contains ProofWiki markup
(
{{eqn}},[[β¦]],<onlyinclude>), by design β that is what the generator saw.
Licensing
- The
proofwikiconfig and all source text are derived from ProofWiki, licensed CC BY-SA 4.0. The whole dataset is released under the same licence. - The
active_readingartifacts are outputs of a Gemma model and are additionally subject to the Gemma Terms of Use and Prohibited Use Policy.
Citation
Active Reading recipe:
@article{activereading2025,
title = {Learning Facts at Scale with Active Reading},
journal = {arXiv preprint arXiv:2508.09494},
year = {2025},
url = {https://arxiv.org/abs/2508.09494}
}
Please also credit ProofWiki as the source corpus.
- Downloads last month
- 2