truncated_add_cayley
def
Given a subset D and a connection set S in an additive abelian group G, the truncated Cayley graph on D with connection set S is the subgraph of the Cayley graph of G with connection set S induced by D.
Statement
open scoped Pointwise in def truncated_add_cayley {G : Type*} [AddCommGroup G] (D S : Set G) : SimpleGraph D
- Defined in
- arXiv:2611.05321 Definition 2.1
- Verified
- 04 Nov 2026
- Axioms
- none listed
- Used by 3
- truncated_add_cayley_exists_adj_of_not_memLet A ⊆ D and Z be subsets of an additive abelian group G such that 0 ∈ Z and D ⊆ A + Z. Then every vertex of D not belonging to A is…
- truncated_add_cayley_indep_of_is_direct_sum_setIf A and Z are subsets of an additive abelian group G whose sum A + Z is direct, then the preimage of A in D is an independent set in the…
- direct_sum_cover_maximal_independent_truncated_cayleyLet G be an additive abelian group, and let A ⊆ D ⊆ G and Z ⊆ G be subsets with 0 ∈ Z. Suppose that the sum A + Z is direct and D ⊆ A + Z.…
Read back from the Lean
For an additive commutative group G and subsets D, S : Set G, truncated_add_cayley D S defines the simple graph on the subtype D (the elements of G in D) obtained by inducing the additive Cayley graph of G with respect to S (SimpleGraph.addCayley S) onto D.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
open scoped Pointwise in /-- The truncated Cayley graph on vertex set D with connection set S, induced from addCayley S. -/ def truncated_add_cayley {G : Type*} [AddCommGroup G] (D S : Set G) : SimpleGraph D := (SimpleGraph.addCayley S).induce D