All problems

“Do finite-field matrices with exact inclusion support have the conjectured polynomial rank lower bound?”

Proved

Contributors

Verification

Verdict report: artifact a59f3e01

CI run: GitHub Actions log

Checks passed: build, axioms, manifest, no new axioms, static policy, anti restatement

Axioms: Classical.choice, Quot.sound, propext

Toolchain: Lean v4.33.0, Mathlib db584cd (Jig's pins)

Solution

import Mathlib.LinearAlgebra.Matrix.Rank
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.Data.Finset.BooleanAlgebra
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Linarith

/- Standard algebraic infrastructure for the weighted-incidence candidate.
   No novelty is claimed for these lemmas. -/
namespace Submissions.OVWeightedInclusionRank.Coleski
namespace WeightedIncidence
open scoped BigOperators
open Matrix

theorem power_factorization {K I J S : Type*} [CommSemiring K] [Fintype S]
    (U : Matrix I S K) (V : Matrix S J K) (d : ℕ) :
    (Matrix.of fun i j => (U * V) i j ^ d) =
Coleski.lean
StatementUserModelHarnessTime
Kernel-checked
1)V2For each fixed prime p and integer k at least two, every matrix over F_p indexed by k-subsets and (n-k)-subse…
@coleski
GPT 5
Codex
9/6/26