recognition /
Complexity /
Complexity.SAT.BWD3SchurPinch /
explainer
No prose has been written for this declaration yet. The Lean source and graph data below render
without it.
generate prose now
formal statement (Lean)
53 theorem feasible_implies_boolean {n N : ℕ} {φ : CNF n}
54 (M : BWD3Model (n := n) (N := N) φ) :
proof body
Term-mode proof.
55 ∀ u, M.admissible u → M.L.mulVec u = M.b → BooleanPhaseState u :=
56 M.schur_pinch
57
58 /--
59 Optional algorithmic interface: a rank/null-space test can be plugged in as a
60 single Boolean oracle. This is intentionally abstract at scaffold stage.
61 -/
depends on (16)
Lean names referenced from this declaration's body.
BooleanPhaseState
in IndisputableMonolith.Complexity.SAT.BWD3SchurPinch
decl_use
BWD3Model
in IndisputableMonolith.Complexity.SAT.BWD3SchurPinch
decl_use
CNF
in IndisputableMonolith.Complexity.SAT.CNF
decl_use
is
in IndisputableMonolith.Foundation.OptionAEmpiricalProgram
decl_use
rank
in IndisputableMonolith.Foundation.PreTemporalForcingOrder
decl_use
as
in IndisputableMonolith.Foundation.SimplicialLedger.ContinuumBridge
decl_use
is
in IndisputableMonolith.Foundation.SimplicialLedger.EdgeLengthFromPsi
decl_use
is
in IndisputableMonolith.GameTheory.MechanismDesignFromSigma
decl_use
admissible
in IndisputableMonolith.Information.Thermodynamics
decl_use
is
in IndisputableMonolith.Mathematics.RamanujanBridge.MockThetaPhantom
decl_use
schur_pinch
in IndisputableMonolith.NumberTheory.RiemannHypothesis.PickGapPersistence
decl_use
L
in IndisputableMonolith.Recognition
decl_use
M
in IndisputableMonolith.Recognition
decl_use
L
in IndisputableMonolith.Recognition.Cycle3
decl_use
M
in IndisputableMonolith.Recognition.Cycle3
decl_use
rank
in IndisputableMonolith.RRF.Theorems.OrderPreservation
decl_use