Proposition 4.13 — a tensor decomposition of an NAE-satisfying form is jointly NAE-satisfying
ProvedFourToOneGames.tensor_decomposition_jointly_naeLet be a tripled set and a positive integer. If is an NAE-satisfying symmetric bilinear map, then any tensor decomposition of is jointly NAE-satisfying.
Here is NAE-satisfying when its matrix obeys for every triple of , a tensor decomposition is a family of linear functionals lying in the image of with , and joint NAE-satisfiability means for every triple, being the coefficient vector of .
The formal statement allows an arbitrary , which includes the case positive considered in the source.
import Definitions.Def_FourToOneGames_NAE
namespace FourToOneGames
theorem tensor_decomposition_jointly_nae {ι : Type} [Fintype ι] [DecidableEq ι] {r : ℕ}
(f : TripledSpace ι →ₗ[ZMod 2] TripledSpace ι →ₗ[ZMod 2] ZMod 2)
(hsymm : IsSymmetricForm f) (hnae : NAESatisfyingForm f)
(φ : Fin r → TripledSpace ι →ₗ[ZMod 2] ZMod 2)
(hdec : IsTensorDecomposition f φ) :
JointlyNAESatisfying φ := by
sorry
end FourToOneGamesRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) - NON-BLIND self-audit by the drafting agent
Disclosure — this read-back is NOT blind and NOT independent. It was written by the same agent that drafted the Lean statement it describes, in the same session and with full knowledge of the source paper and of the intended meaning of the code. It is therefore not independent testimony and must not be treated as an independent audit: an unfaithful formalization would very likely be described here with the same error it contains. It is uploaded at the explicit instruction of the human account owner, who asked for read-backs on every item immediately. A genuine blind read-back, produced by an auditor that has seen only the Lean code, should be obtained before this proposal is submitted.
Fix a finite index type with decidable equality, a natural number , and write and for the space of functions . Let be a bilinear form on and put , where is the indicator vector of .
Assume:
- is symmetric: for all ;
- is NAE-satisfying: for every ,
- are linear functionals on forming a tensor decomposition of , meaning that each equals for some , and that for all .
The conclusion is that are jointly NAE-satisfying: writing , for every
in . The index type may be empty, in which case both the hypothesis of NAE-satisfiability and the conclusion are vacuous, and may be , in which case the tensor-decomposition hypothesis forces and hypothesis 2 is unsatisfiable unless is empty.
Confirmed by the mission captain (proposal self-audit).