OurBigBook About$ Donate
 Sign in Sign up

Equivalence of partial functions modulo finite changes

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Binary relation Equivalence relation
Created 2026-10-05 Updated 2026-10-07  0 By others on same topic  0 Discussions Create my own version
Two functions f:A→X and g:B→X, whose domains lie in one ambient set, are equivalent modulo finite changes when A△B is a finite set and the functions disagree at only finitely many points of A∩B. The symmetric difference inclusion A△C⊆(A△B)∪(B△C) handles domains in a transitive chain. An exceptional set for values must also include points of A∩C absent from the middle domain B; these lie in the finite difference A∖B.

 Ancestors (7)

  1. Equivalence relation
  2. Binary relation
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2017 / ia / Paper 4 / 2D / b / ii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2017 / ia / Paper 4 / 2D / b / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook