recognition /
Complexity /
Complexity.SAT.PC /
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)
245 theorem peeling_implies_arborescence {n}
246 (inputs : InputSet n) (aRef : Assignment n) (φ : CNF n) (H : XORSystem n) :
247 PeelingWitness inputs aRef φ H → ForcedArborescence inputs aRef φ H := by
proof body
Term-mode proof.
248 unfold ForcedArborescence
249 exact id
250
251 /-- Arborescence ⇒ peeling (Prop-level).
252 Trivial since ForcedArborescence is defined as PeelingWitness. -/
depends on (17)
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
is
in IndisputableMonolith.Foundation.OptionAEmpiricalProgram
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
is
in IndisputableMonolith.Mathematics.RamanujanBridge.MockThetaPhantom
decl_use
id
in IndisputableMonolith.RRF.Core.Octave
decl_use