Partially specified elements of a group?

  • Thread starter Thread starter Stephen Tashi
  • Start date Start date
  • Tags Tags
    Elements Group
AI Thread Summary
The discussion centers on identifying a technical term in group theory for "partially specified elements" of a group, which are defined as incomplete mappings represented by ordered pairs. These mappings can be viewed as functions that do not fully specify all possible outputs for each input. The concept of reversing these pairs leads to what is termed an "inverse specification." Additionally, the product of two such partial specifications can be defined through the composition of their mappings, although this is limited by the available ordered pairs. While the term "relation" is acknowledged, it is noted that this type of partial specification is more specific than a general relation.
Stephen Tashi
Science Advisor
Homework Helper
Education Advisor
Messages
7,864
Reaction score
1,602
Is there a technical term in group theory for (what I would call) partially specified elements of a group?

I mean "partially specified" in the following sense:

An elements of a group acts as permuation on the set of elements of the group. So a group element can be considered to be a function that is specified by a set of ordered pairs. Suppose we have a set of ordered pairs of group elements that incompletely specifies a 1-1 function on the group. For example if the group elements are {a,b,c,d} we might have the set of ordered pairs { (a,b),(c,a)} which is missing a specification for (b,?) and (d,?).

If A is a partial specification then reversing the ordered pairs in A give a different partial specification which one might call the inverse specification. If A and B are two partial specification then the product can be defined as the partial specification given by forming the composition of the two mappings, insofar as we can do so from the given ordered pairs in A and B.
 
Physics news on Phys.org
As I know it, it's called a "relation".

From wikipedia: "Formally, a relation is a set of n-tuples of equal degree."
 
I like Serena said:
As I know it, it's called a "relation".

I agree that it is a relation, but this type of partial specification is more specific than a general relation. A general relation need not even be a subset of the ordered pairs of a function.
 

Thread 'Deductive proof in logic formal systems'

I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
View full post »

Similar threads

I Does the definition of cardinality assume distinguishability?
Replies
9
Views
2K
Insights Groups, The Path from a Simple Concept to Mysterious Results
Replies
17
Views
8K
I Add an exponential number of elements, what will be the final cardinality?
Replies
16
Views
2K
MHB Partial Order Relation on a Functions Set
Replies
3
Views
2K
I Direct limit of multiverse models of ZFC
Replies
2
Views
2K
I Finding the Number of Sets in Two Groups: A Simplified Problem
Replies
2
Views
1K
I Question about "A Group Epimorphism is Surjective"
Replies
13
Views
639
I Observational Studies: What to Believe
Replies
3
Views
2K
I Can an ordered pair have identical elements?
Replies
14
Views
3K
Conceptual questions on proving identity element of a group is unique
Replies
6
Views
3K

Hot Threads

Recent Insights

Back
Top