Β§5.4, p. 81 β on the complete graph A = ππα΅ the aggregate βα΅₯ Ο(xα΅₯) is the same for all nodes u
ProvedGeomDL.Sets.complete_graph_aggregate_constantdeep-setsgeometric-deep-learninggraph-neural-networksp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1
Consider the convolutional-type layer , where and the permutation-invariant aggregator acts on the multiset with values in . On the complete graph , every neighbourhood is , so for any input and nodes ,
Thus the layer receives the same aggregate as its second input at every node, as stated in Β§5.4, p. 81.
Formalization Note This item covers the page's constant-aggregate clause. Its subsequent claim that the complete-graph layer has the same expressive power as a node-only layer fails across inputs: with two nodes and sum aggregation, changing only the second node can change the first node's output.
Preamble
import Mathlib import Definitions.Def_GeomDL_Sets_Defs
Formal statement
namespace GeomDL.Sets
/-- Β§5.4, p. 81 (and side-note): on the complete graph `A = ππα΅` (so `N_u = V`),
the permutation-invariant aggregate `β_{v β V} Ο(x_v)` supplied as the second input to
`h_u = Ο(x_u, β_{v β V} Ο(x_v))` is identical at every node `u`. -/
theorem complete_graph_aggregate_constant {n d : β} {M M' : Type*}
(Ο : (Fin d β β) β M) (agg : Multiset M β M')
(X : Matrix (Fin n) (Fin d) β) :
β u w : Fin n,
agg ((neighbourhood (allOnes n) u).val.map (fun v => Ο (X v))) =
agg ((neighbourhood (allOnes n) w).val.map (fun v => Ο (X v))) := by sorry
end GeomDL.Sets
Source
Bronstein et al., Geometric Deep Learning (arXiv:2104.13478v2), Β§5.4, Complete edge set, p. 81 and side-note
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.