Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Topology

40 missions · 26 completed

Missions

Open14Completed26All40
🏆Completed
Algorithmic Game TheoryAnalysisOperations Research·Captain: mikedeng1

A Generalization of Brouwer's Fixed Point Theorem: An Upper Semi-Continuous Map with Nonempty Closed Convex Values on a Bounded Closed Convex Set in Euclidean Space Has a Fixed PointResearch Paper

Brouwer's fixed point theorem says that a continuous map of a closed simplex into itself has a fixed point. Many existence questions in game theory and mathematical economics produce instead a point-to-set mapping: to each point xxx it assigns a whole set Φ(x)\Phi(x)Φ(x) of admissible responses, for instance the set of best replies of a player to the others'…

15 thms8 active usersReviewed
🏆Completed
Algorithmic Game TheoryOptimization·Captain: mikedeng1

On General Minimax Theorems 1: For a Minimal Finite Y with Every f(·, y) Quasi-Concave and u.s.c. on Convex M, One μ₀ ∈ M Has f(μ₀, y) < c for All y ∈ YResearch Paper

A minimax theorem asserts that, for a function f(μ,ν)f(\mu, \nu)f(μ,ν) of two variables,

11 thms5 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research+1·Captain: mikedeng1

Maximal Flow Through a Network II: In an ab-Planar Network Some Chain from Source to Sink Meets Every Cut Exactly OnceResearch Paper

The maximum flow problem asks how much of a commodity can be shipped from a source to a sink through a network whose arcs have limited capacities. L. R. Ford, Jr. and D. R. Fulkerson's 1956 paper Maximal Flow Through a Network proved the minimal cut theorem: the largest flow value equals the smallest total capacity of a set of arcs that separates source…

10 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryAnalysisOperations Research+1·Captain: mikedeng1

A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games 2: The Social Optimum Cost, the Wardrop Equilibrium Cost and the Price of Anarchy Are Continuous on the Game SpaceResearch Paper

Traffic users choose routes for themselves, while a planner may choose routes that minimize everyone's combined travel cost. The price of anarchy measures the cost of the users' equilibrium relative to the planner's optimum. Travel demand and arc latency functions are estimated from data and change over time, so a ratio that changes abruptly under a small…

9 thms3 active usersReviewed
🏆Completed
AnalysisOperations ResearchProbability+1·Captain: mikedeng1

Some Useful Functions for Functional Limit Theorems 3: The First-Passage-Time Map Is M₁-Continuous and J₁-Continuous at Strictly Increasing PathsResearch Paper

Functional limit theorems in queueing and applied probability are rarely proved from scratch. A limit theorem is established once for a primitive process, such as a random walk, a cumulative input or a renewal-reward process, and then transferred to the quantities of interest through the continuous mapping theorem: if Xn⇒XX_n \Rightarrow XXn​⇒X in a function space…

14 thms3 active usersReviewed
🏆Completed
AnalysisDynamic ProgrammingOperations Research+2·Captain: mikedeng1

Stochastic Optimal Control: The Discrete-Time Case VI: Lower Semianalytic Functions — Analytically Measurable ε-Optimal Selectors (Jankov–von Neumann)Textbook

Dynamic programming over uncountable state and control spaces needs two things at every stage: the optimal cost-to-go, obtained by minimizing over the control, must be a function that can be integrated against the next stage's transition probabilities, and a policy that nearly attains the minimum must be measurable, so that it defines a stochastic process.…

8 thms3 active usersReviewed
🏆Completed
AnalysisDynamic ProgrammingOperations Research+2·Captain: mikedeng1

Stochastic Optimal Control: The Discrete-Time Case V: Semicontinuous Functions — a Borel-Measurable Minimizing Selector for Lower Semicontinuous CostsTextbook

Every step of the dynamic programming algorithm on a general state space does three things: it takes a conditional expectation of the cost-to-go under a transition kernel, it minimizes the resulting function of state and control over the control, and, if a policy is to be produced, it picks a control for each state that attains or nearly attains that…

10 thms3 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Assumptions of Physics III: Properties, Quantities and Natural OrdersTextbook

This is the third mission of the series on Assumptions of Physics by G. Carcassi and C. A. Aidala (book, v3.0, 2025), formalizing the order-theoretic core of Part II, Chapter 3, "Properties and quantities". The chapter explains when the possibilities of an experiment can be labelled by numbers: a domain can be described by a quantity exactly when its…

11 thms3 active usersReviewed
🏆Completed
Mathematical Logic·Captain: LG

Acharjee–Gogoi: Cognitive-Consequence Spaces and the Limit of Human IntelligenceResearch Paper

In 1998 Smale listed eighteen problems for the twenty-first century; the eighteenth asks: What are the limits of intelligence, both artificial and human? (Smale 1998). The paper of Acharjee and Gogoi (arXiv:2310.10792) proposes a mathematical model of a mind, the cognitive-consequence space, built from a Tarski consequence operator, and claims that two…

14 thms3 active usersReviewed
🏆Completed
Dynamical Systems·Captain: mikedeng1

Ordinary Differential Equations and Dynamical Systems XI: The Smale HorseshoeTextbook

The Smale horseshoe is the standard example of a smooth invertible map of the plane with chaotic dynamics. Smale introduced it in the 1960s as the mechanism behind the complicated orbits near a transverse homoclinic point, and it became the basic model of hyperbolic invariant sets (Smale 1967). Its importance for differential equations is the Smale–Birkhoff…

20 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

The Structure of Dynamic Programing Models: A Solution of the Principle of Optimality with Vanishing Tail Is the Optimal ReturnResearch Paper

Dynamic programming, as introduced by Bellman in the early 1950s, solves sequential decision problems through a functional equation: the value of a problem started in a given state equals the best one-stage return plus the value of the problem started in the state that decision leads to. In practice the argument usually runs backwards. One writes down the…

8 thms3 active users
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

A Social Equilibrium Existence Theorem: Equilibrium Points Exist When Actions Are Contractible Polyhedra and Constrained Best Responses Are ContractibleResearch Paper

Nash's equilibrium existence theorem assumes that each player's set of available strategies is fixed. Many social and economic systems do not work that way: a consumer's budget set depends on prices, which are the choices of another agent, and a firm's feasible production may depend on what other firms do. Gerard Debreu's A Social Equilibrium Existence…

19 thms3 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: Xiaoyang Liu

Monodromy Computation: Native Reversible UniversalityResearch Paper

A closed path can return to its base point while its analytic continuation reaches a different branch. The question is whether this change of branch can participate in the execution of a complete computational model: storing unbounded information, making conditional changes, and determining which operation follows.

106 thms2 active usersReviewed
🏆Completed
Functional AnalysisMathematical PhysicsProbability·Captain: LG

Ensemble spaces: monodecomposability and separatenessResearch Paper

A physical law is a claim about what happens whenever a preparation is repeated, not about a single run. The objects of the law are therefore ensembles: the statistical outputs of a preparation procedure. Classical probability distributions and quantum density operators are two realizations of that idea, and they share a convex structure coming from…

9 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Assumptions of Physics II: Inference and Causal Relationships Between Experimental DomainsTextbook

This is the second mission of the series on Assumptions of Physics by G. Carcassi and C. A. Aidala (book, v3.0, 2025), formalizing Part II, Chapter 2, "Domain combination and relationships". The chapter asks when the outcome of one experiment can be inferred from another (e.g. temperature from the height of a mercury column), and shows that such inference…

7 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Assumptions of Physics I: Experimental Domains and Their Natural TopologyTextbook

Assumptions of Physics by Gabriele Carcassi and Christine A. Aidala (book, v3.0, 2025) is a programme to derive the mathematical structures of physical theories from explicit physical requirements. Part II, "Physical Mathematics", begins (Chapter 1) by making precise what it means for a statement to be experimentally verifiable, and shows that a single…

15 thms2 active usersReviewed
🏆Completed
Analysis·Captain: LG

Rudin PMA IV: ContinuityTextbook

Continuity is the hypothesis under which limits may be moved inside a function, and Chapter 4 of Walter Rudin's Principles of Mathematical Analysis (3rd edition, McGraw-Hill, 1976) is about what continuity gives once the domain is compact or connected. Three of its theorems are used in nearly every later argument of the book: a continuous function on a…

11 thms2 active usersReviewed
🏆Completed
Dynamical SystemsGroup Theory·Captain: dbenbenn

Brin–Squier: the group of piecewise-linear homeomorphisms of the line with finitely many breakpoints has no free subgroup of rank greater than oneResearch Paper

Von Neumann introduced amenability in 1929 in response to the Banach–Tarski paradox: a group is amenable when it carries a finitely additive, translation-invariant probability measure on its subsets, and no amenable group contains a free subgroup of rank 222 — which is exactly what the paradox needs. The converse is the von Neumann conjecture, and it is…

32 thms2 active usersReviewed
🏆Completed
Analysis·Captain: LG

Rudin PMA II: Basic TopologyTextbook

Convergence, continuity and integration are all statements about nearness, and Chapter 2 of Walter Rudin's Principles of Mathematical Analysis (3rd edition, McGraw-Hill, 1976) isolates the amount of structure needed to talk about nearness: a metric. The chapter's payoff is a single theorem, Heine–Borel (Theorem 2.41), which says that in Rk\mathbb{R}^kRk — and,…

15 thms2 active usersReviewed
🏆Completed
Mathematical LogicProbability·Captain: username

No Borel upper bound for the Δ30\Delta^0_3Δ30​ equivalence relations modulo null setsOpen Problem

A Borel reduction assigns complete invariants by a Borel map: two source points are equivalent exactly when their images are equivalent. A universal relation would provide one classification problem to which every relation in a specified class reduces. Allowing a null exceptional set changes this question. A probability measure may permit a classification…

7 thms1 active userReviewed
🏆Completed
Functional AnalysisMathematical Logic·Captain: username

Comparisons of benchmark equivalence relationsOpen Problem

A classification assigns invariants to objects so that two objects receive the same invariant exactly when they are equivalent. Requiring this assignment to be Borel measurable makes it possible to compare classification problems without choosing arbitrary representatives. Borel reducibility expresses this comparison: a relation EEE reduces to a relation FFF whe…

12 thms1 active userReviewed
🏆Completed
Mathematical Logic·Captain: username

No Borel upper bound for the FσF_\sigmaFσ​ equivalence relationsOpen Problem

Borel reducibility compares classification problems by asking whether one can assign invariants for one problem using the equivalence classes of another. The comparison is sensitive to the definability of the assignment: the coding map must be Borel measurable and must preserve and reflect equivalence. It is a standard organizing principle in invariant…

7 thms1 active userReviewed
🏆Completed
Mathematical Logic·Captain: username

There is no universal FσF_\sigmaFσ​ equivalence relationOpen Problem

A classification problem specifies when two objects should count as equivalent. Descriptive set theory compares such problems by asking whether an assignment of invariants transforms one equivalence relation into another. Requiring that assignment to be Borel measurable prevents arbitrary choices from obscuring the topological complexity of classification.…

4 thms1 active userReviewed
🏆Completed
Combinatorics·Captain: username

Continuous graph homomorphisms for Zd\mathbb Z^dZd-actions: Theorem 1.4 and Proposition 7.1Research Paper

A graph homomorphism sends vertices of one graph to another while preserving adjacency. Requiring this map to be continuous makes graph coloring sensitive to topology: each color must occupy an open and closed region. For integer lattice actions, the resulting questions connect finite graph structure with continuous dynamics. The results considered here…

17 thms1 active userReviewed
🏆Completed
Dynamical SystemsMathematical Physics·Captain: lisamegawatts

Winding Dynamics I: Homotopy Conservation and Reset BalanceTextbook

Phase winding is an integer attached to a circle-valued field on a closed spatial cycle. It distinguishes configurations that cannot be continuously deformed into one another while remaining circle-valued and spatially continuous. In oscillator and spin models this integer is often described informally as conserved by smooth evolution, while changes of…

6 thms1 active userReviewed
PreviousPage 1 of 2Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me