Docs / Semantics / Mereology / Sum
Sums and the principles of part structures
import Linglib.Semantics.Mereology.Sum · namespace Mereology
A sum of a predicate, in Tarski's sense, is a bound of its members each of whose non-null parts
overlaps one of them. It overlaps exactly what its members overlap,
which is the other definition of sum in use, and the two definitions agree in a part structure
that is strongly supplemented: whatever is not part of y has a non-null part that does not
overlap y. There a sum is a least upper bound, so a predicate has at
most one. Three further principles are stated here: the product of two overlapping individuals,
the remainder of a proper part in a whole, and that a binary join is a sum. Boolean algebras
satisfy all four. Closure of a
predicate under the sums of its inhabited subpredicates is cumulative reference in its general
form, and the predicates so closed are the fixed points of algebraic
closure under arbitrary sums, which on a finite predicate is
closure under binary sums.
Implementation notes
The second clause of a sum ranges over non-null parts, as Overlap relates non-null parts. On a
carrier without a null individual this is Tarski's definition; on a carrier with one, his
definition holds of nothing, since the null individual overlaps nothing, and the present one
holds of least upper bounds in a Boolean algebra. The sources state the remainder principle with
uniqueness; the results that use it need only existence.
References
- Champollion & Krifka 2016, Mereology
Declarations
Sums
t is a sum of the P-elements (Champollion & Krifka 2016) if it lies above each of them and
each of its non-null parts overlaps one of them.
Used by isSum_eq, IsSum.overlap_iff, IsSum.bind, SupIsSum, isSum_iff_forall_overlap, IsSum.isLUB, IsSum.unique, isSum_iff_isLUB, SumClosed, SumClosure
Used in Semantics/Mereology/Atomic, Semantics/Mereology/Classical, Semantics/Mereology/Topology
A sum overlaps exactly what its members overlap.
Built from
Strong supplementation, products and remainders
A part structure is strongly supplemented if whatever is not part of y has a non-null part
that does not overlap y.
- exists_not_overlap ⦃x y : α⦄ : ¬x ≤ y → ∃ z ≤ x, ¬IsBot z ∧ ¬Overlap z y
Used by le_of_forall_overlap, exists_not_overlap_of_lt, eq_of_forall_overlap_iff, isSum_iff_forall_overlap, IsSum.isLUB, IsSum.unique, instStronglySupplemented, SumClosure.algClosure, sumClosure_iff_algClosure
Used in Semantics/Mereology/Atomic, Semantics/Mereology/Classical, Semantics/Mereology/Topology, Moon2026
A part structure has products if two overlapping individuals have a greatest common part.
- exists_isGLB ⦃x y : α⦄ : Overlap x y → ∃ (p : α), IsGLB {x, y} p
Used by Overlap.exists_isGLB, instHasProducts
Used in Semantics/Mereology/Classical, Semantics/Mereology/Topology
A part structure has remainders if every proper part x of y is completed to y by a
part that does not overlap x: the remainder principle of Krifka 1998, the relative
complementarity of Krifka 1989, and the unique separation of Champollion 2017.
- exists_remainder ⦃x y : α⦄ : x < y → ∃ (z : α), ¬Overlap z x ∧ x ⊔ z = y
Used by instHasRemainders
Used in Semantics/Mereology/Classical, Semantics/Mereology/Measure, Krifka1989
In a part structure with binary sums, the join of two individuals is their sum: each of its non-null parts overlaps one of the two. Boolean algebras and classical mereologies satisfy this; the lattice of three atoms any two of which join to the top does not.
- isSum_sup (x y : α) : IsSum (fun (u : α) => u = x ∨ u = y) (x ⊔ y)
Built from
Used by instSupIsSum, SumClosed.cum, AlgClosure.sumClosure, sumClosure_iff_algClosure
Used in Semantics/Mereology/Atomic, Semantics/Mereology/Classical, Semantics/Mereology/Topology, Semantics/Plurality/Algebra, Semantics/Reference/Context/Participants and 1 more
The product of two overlapping individuals is non-null.
Built from
In a strongly supplemented part structure, x is part of whatever all its non-null parts
overlap.
Built from
A proper part of y leaves a non-null part of y that it does not overlap, weak
supplementation.
Built from
Two individuals that overlap the same things are identical.
Built from
In a strongly supplemented part structure, a sum is a least upper bound.
Built from ,
In a strongly supplemented part structure, a predicate has at most one sum.
Built from ,
Built from
Built from
Built from
Closure under sums
A predicate is closed under sums if it holds of every sum of an inhabited subpredicate, cumulative reference in the form that covers infinite sums (Champollion & Krifka 2016).
- SumClosed P = ∀ (Q : α → Prop), (∀ (x : α), Q x → P x) → (∃ (x : α), Q x) → ∀ (t : α), IsSum Q t → P t
Built from
Used by sumClosed_sumClosure, sumClosed_iff, SumClosed.cum
Used in Semantics/Mereology/Classical, Semantics/Reference/Kind
The closure of P under sums (Champollion & Krifka 2016) holds of the sums of the inhabited
subpredicates of P.
- SumClosure P x = ∃ (Q : α → Prop), (∀ (y : α), Q y → P y) ∧ (∃ (y : α), Q y) ∧ IsSum Q x
Built from
Used by SumClosure.base, sumClosed_sumClosure, sumClosed_iff, AlgClosure.sumClosure, SumClosure.algClosure, sumClosure_iff_algClosure
Used in Semantics/Mereology/Classical
Built from
The closure of a predicate under sums is closed under sums.
Built from ,
A predicate is closed under sums iff its closure under sums adds nothing to it, as the plural of a cumulative mass noun adds nothing.
Built from ,
The closure under binary sums lies in the closure under sums.
Built from ,
The closure of a finite predicate under sums lies in its closure under binary sums.
Built from ,
The two algebraic closures of a finite predicate agree.
Built from , ,