Encyclopedia Foundation Foundation Entanglement Monogamy3 From Jcost Ent Monogamy3 Cert
ARTICLE 4 claims 3 theorems 1 model
Foundation Entanglement Monogamy3 From Jcost Ent Monogamy3 Cert
A machine-checked certificate bundles three basic facts about a cost function, but its name points to a research goal its code does not yet reach.
A certificate and its limits
In mathematics, a certificate is a compact bundle of verified facts. The Recognition Science library contains a machine-checked collection of formal theorems, and within it the declaration EntMonogamy3Cert is a certificate: a structure that packages three proven statements about a function called domainCost, which is defined as J(m/e), the J-cost of the ratio of two real numbers m and e. The three facts are that this cost is zero when m equals e, that it is never negative when both inputs are positive, and that the number phi minus 3/2 is positive. The library proves each of these and then shows the certificate exists, meaning the three facts hold together consistently.
The name suggests a connection to entanglement monogamy, a quantum information principle where two systems cannot both be maximally entangled with a third. The certificate itself, however, proves nothing about entanglement. The function domainCost is defined purely as J(m/e), with no definition of m or e in terms of quantum states. The three proven facts are general properties of the J-cost function, not results about physics. The library's own documentation states this plainly: the module proves three general facts and nothing specific to the subject, because the cost function is defined without reference to one.
What the certificate does establish is a small, solid foundation. It shows that J-cost behaves sensibly as a cost: zero at equality, nonnegative for positive inputs. The positivity of phi minus 3/2 is a concrete numerical fact, roughly 0.118, that could serve as a threshold in future work. The certificate format itself is useful: it bundles these facts into a single object that other theorems can refer to, so any later result about entanglement monogamy can build on a verified base rather than re-proving these basics.
The gap between the name and the content is the honest story. The certificate is a placeholder, a scaffold. What would turn it into a theorem about entanglement is a definition of m and e in quantum terms, for example as measures of entanglement between subsystems. Until such a definition exists, the certificate remains a general-purpose tool waiting for its subject. The library records this openly as a research note, not as a result.
MODEL EntMonogamy3Cert · domainCost · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean
structure EntMonogamy3Cert where
cost_at_eq : ∀ r : ℝ, r ≠ 0 → domainCost r r = 0
cost_nonneg : ∀ m e : ℝ, 0 < m → 0 < e → 0 ≤ domainCost m e
threshold_pos : 0 < canonicalThreshold
def domainCost (m e : ℝ) : ℝ := Jcost (m / e)
THEOREM domainCost_at_eq · domainCost_nonneg · canonicalThreshold_pos · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean
theorem domainCost_at_eq (r : ℝ) (h : r ≠ 0) : domainCost r r = 0 := by
unfold domainCost; rw [div_self h]; exact Jcost_unit0
theorem domainCost_nonneg (m e : ℝ) (hm : 0 < m) (he : 0 < e) : 0 ≤ domainCost m e := by
unfold domainCost; exact Jcost_nonneg (div_pos hm he)
theorem canonicalThreshold_pos : 0 < canonicalThreshold := by
unfold canonicalThreshold; linarith [phi_gt_onePointFive]
THEOREM cert_inhabited · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean
theorem cert_inhabited : Nonempty EntMonogamy3Cert := ⟨cert⟩
THEOREM domainCost · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean
def domainCost (m e : ℝ) : ℝ := Jcost (m / e)
What this page does not claim
Entanglement monogamy is proven for any physical system. The quantities m and e are defined in terms of quantum states. The certificate provides a numerical bound on entanglement. The name EntMonogamy3Cert reflects a proven result about monogamy.
Verify this page
Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:
$ lake env lean IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)
A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.
Derived articles
This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red:
- What definitions of m and e in quantum terms would turn this certificate into a theorem about entanglement monogamy?
- How does the J-cost function relate to standard measures of entanglement such as entanglement entropy?
- What role does the threshold phi minus 3/2 play in a future proof of monogamy?
- Does the triangle inequality for J-cost hold in a form that would directly imply the monogamy inequality?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
MODEL EntMonogamy3Cert · domainCost · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean
structure EntMonogamy3Cert where cost_at_eq : ∀ r : ℝ, r ≠ 0 → domainCost r r = 0 cost_nonneg : ∀ m e : ℝ, 0 < m → 0 < e → 0 ≤ domainCost m e threshold_pos : 0 < canonicalThresholddef domainCost (m e : ℝ) : ℝ := Jcost (m / e)The declaration EntMonogamy3Cert is a certificate: a structure that packages three proven statements about a function called domainCost, which is defined as J(m/e), the J-cost of the ratio of two real numbers m and e. EntMonogamy3Cert · domainCost · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.leanTHEOREM domainCost_at_eq · domainCost_nonneg · canonicalThreshold_pos · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean
theorem domainCost_at_eq (r : ℝ) (h : r ≠ 0) : domainCost r r = 0 := by unfold domainCost; rw [div_self h]; exact Jcost_unit0theorem domainCost_nonneg (m e : ℝ) (hm : 0 < m) (he : 0 < e) : 0 ≤ domainCost m e := by unfold domainCost; exact Jcost_nonneg (div_pos hm he)theorem canonicalThreshold_pos : 0 < canonicalThreshold := by unfold canonicalThreshold; linarith [phi_gt_onePointFive]The three facts are that this cost is zero when m equals e, that it is never negative when both inputs are positive, and that the number phi minus 3/2 is positive. domainCost_at_eq · domainCost_nonneg · canonicalThreshold_pos · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.leanTHEOREM cert_inhabited · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean
theorem cert_inhabited : Nonempty EntMonogamy3Cert := ⟨cert⟩The library proves each of these and then shows the certificate exists, meaning the three facts hold together consistently. cert_inhabited · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.leanTHEOREM domainCost · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean
def domainCost (m e : ℝ) : ℝ := Jcost (m / e)The certificate itself, however, proves nothing about entanglement. domainCost · IndisputableMonolith/Foundation/EntanglementMonogamy3FromJCost.lean