Pith. sign in

Explain the Lean theorem `FApply_neg` in module `IndisputableMonolith.Cost.Ndim.Projector`. Write for an educated reader who knows science and programming but may not know Lean. Cover: (1) what the declaration says in plain English, (2) why it matters in Recognition Science, (3) how to read the formal statement, (4) visible dependencies or certificates in the supplied source, and (5) what this declaration does not prove. Cite only declarations present in the supplied Recognition source.

Big AI job. Grok 4.3 reads the canon and writes a Lean-grounded derivation; usually 20 seconds to 2 minutes. Your answer will appear below.
confidence: high in recognition cached

Explanation of FApply_neg in IndisputableMonolith.Cost.Ndim.Projector

(1) Plain English

The theorem asserts that the almost-product operator F (defined as F = 2P - I from the normalized projector P) is homogeneous with respect to negation: F(-w) = -F(w). This is a basic linearity property for the operator algebra built from a covector β and inverse metric kernel hInv.

(2) Why It Matters in Recognition Science

In Recognition Science this operator algebra encodes the finite-dimensional rank-one tensor picture induced by the J-cost functional equation. The F operator serves as the base for the golden operator GApply and the metallic family MetallicApply, which capture self-similar scaling tied to φ. Negation homogeneity ensures the algebra is consistent under sign changes, supporting the reciprocal symmetry J(r) = J(1/r) and the derivation of structural features such as projectors and almost-products without introducing extra parameters.

(3) How to Read the Formal Statement

The declaration reads:

theorem FApply_neg {n : ℕ}
    (lam : ℝ) (hInv : Fin n → Fin n → ℝ) (β w : Vec n) :
    FApply lam hInv β (-w) = -FApply lam hInv β w := by
  simpa using FApply_smul lam hInv β (-1) w

In standard notation: for dimension n, scalar λ (lam), inverse kernel h⁻¹, covector β, and vector w, the equality F(λ, h⁻¹, β, −w) = −F(λ, h⁻¹, β, w) holds. The proof is a one-line instantiation of the scalar-multiplication theorem FApply_smul at scalar −1.

(4) Visible Dependencies or Certificates

(5) What This Declaration Does Not Prove

It establishes only the algebraic negation property for the finite-dimensional FApply operator. It does not prove any link to ledger events, recognition forcing, or the J-cost uniqueness theorem; it does not address infinite-dimensional or continuous limits; it supplies no physical interpretation, empirical falsifier, or connection to the forcing chain in IndisputableMonolith.Foundation.RealityFromDistinction.

cited recognition theorems

outside recognition

Aspects Recognition does not yet address:

  • Any physical or Recognition-Science interpretation of the operators
  • Connection to the J-cost functional equation or forcing theorems
  • Infinite-dimensional or continuous extensions
  • Empirical predictions or falsifiers

recognition modules consulted

The Recognition library is at github.com/jonwashburn/shape-of-logic. The model is restricted to the supplied Lean source and instructed not to invent theorem names. Treat output as a starting point, not a verified proof.