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)
253theorem arborescence_implies_peeling {n}
254 (inputs : InputSet n) (aRef : Assignment n) (φ : CNF n) (H : XORSystem n) :
255 ForcedArborescence inputs aRef φ H → PeelingWitness inputs aRef φ H := by
proof body
Term-mode proof.
256 unfold ForcedArborescence
257 exact id
258
259/-- Peeling ↔ Arborescence equivalence. -/
depends on (12)
Lean names referenced from this declaration's body.
-
H
in IndisputableMonolith.Algebra.CostAlgebra
decl_use
-
id
in IndisputableMonolith.Algebra.CostAlgebra
decl_use
-
Assignment
in IndisputableMonolith.Complexity.RSatEncoding
decl_use
-
Assignment
in IndisputableMonolith.Complexity.SAT.CNF
decl_use
-
CNF
in IndisputableMonolith.Complexity.SAT.CNF
decl_use
-
ForcedArborescence
in IndisputableMonolith.Complexity.SAT.PC
decl_use
-
InputSet
in IndisputableMonolith.Complexity.SAT.PC
decl_use
-
PeelingWitness
in IndisputableMonolith.Complexity.SAT.PC
decl_use
-
XORSystem
in IndisputableMonolith.Complexity.SAT.XOR
decl_use
-
H
in IndisputableMonolith.Cost.FunctionalEquation
decl_use
-
id
in IndisputableMonolith.Foundation.ArithmeticOf
decl_use
-
id
in IndisputableMonolith.RRF.Core.Octave
decl_use