TheoremDB
R313formalizationStatus: draftEvidence: ReportedLean: kernel unchecked

[#R313] Draft Lean definition of the Fibonacci-sum matrix

View verificationOpen source ↗

1Summary

A proposed Lean object uses Matrix (Fin n) (Fin n) Int with entries determined by Fibonacci membership after converting indices to one-based naturals.

This is a design sketch. It has not been elaborated in the pinned world.

Reported evidence. Replay readiness: partial.

2Verification

Verification material: partial

Part of the replay path is recorded. Check the missing fields before comparing a new run.

Runtime
lean-4.33.0-rc1/mathlib4@4608056c77c5

Verification source: mathoverflow.net ↗, theoremdb mixed-memory fixture

3Formal statement

leanlean-4.33.0-rc1/mathlib4@4608056c77c5
def fibSumMatrix (n : Nat) : Matrix (Fin n) (Fin n) Int := fun i j => if IsFibonacci (i.val + j.val + 2) then 1 else 0

4How it connects

Formalizes

Supersedes (incoming)

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R313",
  "content_hash": null,
  "slug": "fib-formalization-matrix-draft",
  "type": "formalization",
  "title": "Draft Lean definition of the Fibonacci-sum matrix",
  "summary": "A proposed Lean object uses Matrix (Fin n) (Fin n) Int with entries determined by Fibonacci membership after converting indices to one-based naturals.",
  "relevance": "For fib problem determinant range; fib problem nonzero support, record fib-formalization-matrix-draft (“Draft Lean definition of the Fibonacci-sum matrix”) states a machine-checkable theorem or proof obligation. The record states: A proposed Lean object uses Matrix (Fin n) (Fin n) Int with entries determined by Fibonacci membership after converting indices to one-based naturals.",
  "relevance_source": "recorded",
  "body": "This is a design sketch. It has not been elaborated in the pinned world.",
  "status": "draft",
  "evidence_grade": "unverified_formalization",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "partial",
    "kind": "formalization",
    "runtime": "lean-4.33.0-rc1/mathlib4@4608056c77c5",
    "citation": {
      "url": "https://mathoverflow.net/questions/513340/is-the-determinant-of-this-fibonacci-sum-indicator-matrix-always-1-0-or/513372",
      "locator": "theoremdb mixed-memory fixture"
    },
    "missing": [
      "source",
      "command",
      "expected_output"
    ]
  },
  "formal_statement": "def fibSumMatrix (n : Nat) : Matrix (Fin n) (Fin n) Int := fun i j => if IsFibonacci (i.val + j.val + 2) then 1 else 0",
  "source": {
    "url": "https://mathoverflow.net/questions/513340/is-the-determinant-of-this-fibonacci-sum-indicator-matrix-always-1-0-or/513372",
    "locator": "theoremdb mixed-memory fixture"
  },
  "relations": [
    {
      "slug": "fib-problem-determinant-range",
      "title": "Fibonacci-sum indicator determinant conjecture",
      "object_type": "problem",
      "relation": "formalizes",
      "direction": "outgoing"
    },
    {
      "slug": "R904",
      "title": "Lean definition of the Fibonacci-sum matrix",
      "object_type": "formalization",
      "relation": "supersedes",
      "direction": "incoming"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
fibonacci-sum-determinant
Locator
theoremdb mixed-memory fixture
License
CC-BY-SA-4.0
Contributors
Philip Weiss
Public record
R313
Stable alias
fib-formalization-matrix-draft
Projection
Reproduction fields are derived from the immutable record.

A machine-checkable rendering of a statement, with the world it was written against.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.