Remark 3: strict and tight examples exist
OpenQAlgorithms.Papers.Independent.Intakethird100.P97.strict_and_tight_examplesLet be a positive semidefinite complex density matrix of trace one on four finite-dimensional tensor factors , each of positive dimension (dimension one is allowed). Every is the base-two von Neumann entropy of the actual marginal of this same state, with . For disjoint groups write , , and . There exists a state obeying for which the inequality is strict, and there exists a state obeying the same constraints for which it is tight:
The two existential states may use different finite local dimensions. This demonstrates both behaviors within the constrained class.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P97
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P97
attribute [local instance] Classical.propDecidable Classical.decEq
local notation "A" => ({0} : Finset (Fin 4))
local notation "B" => ({1} : Finset (Fin 4))
local notation "C" => ({2} : Finset (Fin 4))
local notation "D" => ({3} : Finset (Fin 4))
/-- PDF p.5, Remark 3: both strictness and equality occur among states obeying
all three constraints. The witnesses may have different finite local dimensions. -/
theorem strict_and_tight_examples :
(∃ q : FourPartyState, Constraints (fourPartyEntropyBits q) ∧
mutualValue (fourPartyEntropyBits q) C (A ∪ B) < mutualValue (fourPartyEntropyBits q) C D) ∧
(∃ q : FourPartyState, Constraints (fourPartyEntropyBits q) ∧
mutualValue (fourPartyEntropyBits q) C (A ∪ B) = mutualValue (fourPartyEntropyBits q) C D) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P97
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
A four-party state consists of positive natural-number dimensions , indexed by , and a positive semidefinite complex matrix of trace on the register ; dimensions equal to are permitted. Define , where is obtained by summing equal row and column coordinates outside , and is applied by functional calculus, with . Here are the fixed subsets of referenced in the declaration, whose elements are not supplied, and concatenated subscripts denote unions. The theorem asserts both of the following existence statements, with the state chosen separately in each:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.