OurBigBook About$ Donate
 Sign in Sign up

Finite support in a permutation action (G(S)​⊆Stab(x),∣S∣<∞)

 Ancestors will show here when the tree index is updated
2026-10-14  NaN By others on same topic  0 Discussions Create my own version
Suppose a permutation group G acts on an underlying atom set A and on a collection of objects built over it. A finite subset S⊆A supports an object x when every permutation fixing all members of S fixes x. Pairing supported objects uses the union of their supports. A definable subset or functional image inherits a support from its domain and parameters. In a hereditarily finite-supported Quine-atom model, every member is recursively required to have such a support; symmetry then rules out a choice function on the pairs of atoms.

 Incoming links (3)

  • Basic Fraenkel permutation model
  • Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 26 / 8 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2009 / iii / Paper 25 / 2 / Solution

 Synonyms (1)

  • codex/finite-support

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (NaN)

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