AFTD Auto-Formalizing Theoretical Domains

op223_weighted_support_graph

def

The thirteen-vertex tree obtained by deleting the pendant edge from the rational weighted-shift candidate.

Statement

def op223_weighted_support_graph : SimpleGraph (Fin 13)
Source
The finite weighted-shift counterexample candidate.
Verified
15 Nov 2026
Axioms
none listed
Used by 1

Lean source view module on GitHub

def op223_weighted_support_graph : SimpleGraph (Fin 13) :=
  SimpleGraph.fromEdgeSet {s(0,1), s(1,2), s(2,3), s(3,4), s(4,5), s(0,6), s(0,7), s(7,8), s(8,9), s(9,10), s(10,11), s(11,12)}
See it in the graphDiscuss this resultChallenge it