Evaluation after reconstruction recovers every interval coordinate

noncomputable def MagnitudeConjecture.Graded.FiniteGradedModule.intervalEvaluationCoordinateEquiv {k A : Type u} [Field k] [Ring A] [Algebra k A] [FiniteDimensional k A] (R : VectorGrading k A) (hmul : ∀ {i j : ℤ} {a b : A}, a ∈ R.component i → b ∈ R.component j → a * b ∈ R.component (i + j)) {ι : Type} [Fintype ι] (e : ι → A) (he0 : ∀ (i : ι), e i ∈ R.component 0) (he : ∀ (i : ι), e i * e i = e i) (F : CategoryTheory.Functor (PrincipalDegreeCategory R ⋯ e he0)ᵒᵖ (ModuleCat k)) [F.Additive] [CategoryTheory.Functor.Linear k F] (hneg : ∀ d < 0, R.component d = ⊥) (h1 : 1 ∈ R.component 0) (hsum : ∑ i : ι, e i = 1) (horth : Pairwise fun (i j : ι) => e i * e j = 0) (hfinite : ∀ (p : (PrincipalDegreeCategory R ⋯ e he0)ᵒᵖ), FiniteDimensional k ↑(F.obj p)) (m : ℕ) (p : ι × Fin (m + 1)) : ((principalDegreeInclusion R ⋯ e he0).obj (intervalProjectiveLabel R ⋯ e he0 m p) ⟶ (intervalReconstructedSupportedObject R ⋯ e he0 he F hneg h1 hsum horth hfinite m).obj) ≃ₗ[k] ↑(F.obj (Opposite.op (intervalProjectiveLabel R ⋯ e he0 m p)))

The actual projective evaluation of the reconstructed module is the original coordinate.

theorem MagnitudeConjecture.Graded.FiniteGradedModule.intervalEvaluationCoordinateEquiv_apply {k A : Type u} [Field k] [Ring A] [Algebra k A] [FiniteDimensional k A] (R : VectorGrading k A) (hmul : ∀ {i j : ℤ} {a b : A}, a ∈ R.component i → b ∈ R.component j → a * b ∈ R.component (i + j)) {ι : Type} [Fintype ι] (e : ι → A) (he0 : ∀ (i : ι), e i ∈ R.component 0) (he : ∀ (i : ι), e i * e i = e i) (F : CategoryTheory.Functor (PrincipalDegreeCategory R ⋯ e he0)ᵒᵖ (ModuleCat k)) [F.Additive] [CategoryTheory.Functor.Linear k F] (hneg : ∀ d < 0, R.component d = ⊥) (h1 : 1 ∈ R.component 0) (hsum : ∑ i : ι, e i = 1) (horth : Pairwise fun (i j : ι) => e i * e j = 0) (hfinite : ∀ (p : (PrincipalDegreeCategory R ⋯ e he0)ᵒᵖ), FiniteDimensional k ↑(F.obj p)) (m : ℕ) (p : ι × Fin (m + 1)) (f : (principalDegreeInclusion R ⋯ e he0).obj (intervalProjectiveLabel R ⋯ e he0 m p) ⟶ (intervalReconstructedSupportedObject R ⋯ e he0 he F hneg h1 hsum horth hfinite m).obj) : (intervalEvaluationCoordinateEquiv R ⋯ e he0 he F hneg h1 hsum horth hfinite m p) f = (have this := (↑f).toFun (principalGenerator (e p.1)); this) p

The coordinate comparison evaluates the projective map at its generator and reads one entry.