AFTD Auto-Formalizing Theoretical Domains

set_system_aura

def

Given a natural number r and a finite set of finite subsets S of a type α with decidable equality, the aura of S relative to parameter r is the natural number |⋃ S| + (r - 1) * |S|, where (r - 1) uses natural number subtraction.

Statement

def set_system_aura (r : ℕ) {α : Type*} [DecidableEq α] (S : Finset (Finset α)) : ℕ
Defined in
arXiv:2611.13495 Def. 3
Verified
11 Nov 2026
Axioms
none listed

Read back from the Lean

Defines set_system_aura r S for a natural number r and a finite collection S of finite subsets of a type α (with decidable equality) as the natural number equal to the cardinality of the union of all members of S, plus (r - 1) times the cardinality of S (where r - 1 is saturating subtraction on ℕ).

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

/-- The aura of a set system S relative to natural parameter r: |⋃ S| + (r - 1) * |S|. -/
def set_system_aura (r : ℕ) {α : Type*} [DecidableEq α] (S : Finset (Finset α)) : ℕ := (S.biUnion id).card + (r - 1) * S.card
See it in the graphDiscuss this resultChallenge it