Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two global minimizers on the same supplied admissible set have equal prices

Proved
APFPaper5.K3.realized_cost_eq

by FiniteUniverse · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

apfapf-referencesib-v15-2026-11

Let admissible be any set of states and price any real-valued function. Suppose s and t both belong to admissible and each has price no greater than every member of that same set. Then price s=price t. These two global-minimum hypotheses are explicit. This is supplied-domain optimization mathematics; identification of the domain and price with the full original A2 objects is not certified. This is a scoped reference result about the stated mathematical data and explicit hypotheses. Applying it at an original physical interface requires a separate source-faithful identification of those data; this declaration does not discharge the K3 physical realization and observable-descent obligations.

Preamble
import Definitions.Def_APFPaper5_K3_Continuity

set_option autoImplicit false
namespace APFPaper5.K3
end APFPaper5.K3
open APFPaper5.K3
universe u
variable {S : Type u}
Formal statement
theorem APFPaper5.K3.realized_cost_eq (admissible : Set S) (price : S → ℝ) (s t : S)
    (hs : s ∈ admissible ∧ ∀ a ∈ admissible, price s ≤ price a)
    (ht : t ∈ admissible ∧ ∀ a ∈ admissible, price t ≤ price a) : price s = price t := by sorry
Source
[{'path': 'Papers/Paper 05 - Quantum Structure - Hilbert Space and Born Rule/Paper_5_Quantum_Structure_Hilbert_Born_Supplement_v7.33.tex', 'locator': '1660-1679'}, {'path': 'APF Reference Docs/APF Reconstruction Spine/FOUNDATION_INPUTS.json revision 2026-10-04.1', 'locator': 'B07a'}, {'path': 'frozen_v15/APFFoundationLedger/Theorems/Thm_APFPaper5_K3_cost_invariant.lean', 'line': 36, 'declaration': 'APFPaper5.K3.realized_cost_eq', 'sha256': '711cb6ac43bbc199872124413291491daa432d662e5ec262c4762ec3cb7a27f1'}]
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

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