Skip to main content
deleted 26 characters in body
Source Link

I first quote a definition from Clone theory in Universal Algebra: A binary relation $\rho$ on a set U is strongly rigid if every universal algebra on U such that $\rho$ is a subuniverse of its square is trivial, i.e., the clone preserving ρ has only projections. It is known that there are only two strongly rigid relations on a 3-element domain. I found that

  1. On a 4-element domain {0,1,2,3}, the following binary relation is possibly a strongly rigid relation: {(0,1), (0,2), (0,3), (1,0), (1,2), (2,0), (2,1), (2,3), (3,1), (3,2)}

  2. On a 5-element domain {0,1,2,3,4}, the following relation is possibly a strongly rigid relation: {(0,2), (0,3), (0,4), (1,0), (1,3), (1,4), (2,0), (2,1), (2,4), (3,0), (3,1), (3,2), (3,4), (4,0), (4,1), (4,2), (4,3)}.

    Could you let me know if there is an easy way to prove the above statements? This could be an algebraic proof, or by using a computer program.

Thanks a lot, Qinghe

I first quote a definition from Clone theory in Universal Algebra: A binary relation $\rho$ on a set U is strongly rigid if every universal algebra on U such that $\rho$ is a subuniverse of its square is trivial, i.e., the clone preserving ρ has only projections. It is known that there are only two strongly rigid relations on a 3-element domain. I found that

  1. On a 4-element domain {0,1,2,3}, the following binary relation is possibly a strongly rigid relation: {(0,1), (0,2), (0,3), (1,0), (1,2), (2,0), (2,1), (2,3), (3,1), (3,2)}

  2. On a 5-element domain {0,1,2,3,4}, the following relation is possibly a strongly rigid relation: {(0,2), (0,3), (0,4), (1,0), (1,3), (1,4), (2,0), (2,1), (2,4), (3,0), (3,1), (3,2), (3,4), (4,0), (4,1), (4,2), (4,3)}.

    Could you let me know if there is an easy way to prove the above statements? This could be an algebraic proof, or by using a computer program.

Thanks a lot, Qinghe

I first quote a definition from Clone theory in Universal Algebra: A binary relation $\rho$ on a set U is strongly rigid if every universal algebra on U such that $\rho$ is a subuniverse of its square is trivial, i.e., the clone preserving ρ has only projections. It is known that there are only two strongly rigid relations on a 3-element domain. I found that

  1. On a 4-element domain {0,1,2,3}, the following binary relation is possibly a strongly rigid relation: {(0,1), (0,2), (0,3), (1,0), (1,2), (2,0), (2,1), (2,3), (3,1), (3,2)}

  2. On a 5-element domain {0,1,2,3,4}, the following relation is possibly a strongly rigid relation: {(0,2), (0,3), (0,4), (1,0), (1,3), (1,4), (2,0), (2,1), (2,4), (3,0), (3,1), (3,2), (3,4), (4,0), (4,1), (4,2), (4,3)}.

    Could you let me know if there is an easy way to prove the above statements? This could be an algebraic proof, or by using a computer program.

added 51 characters in body; edited title
Source Link

How to prove that a binary relation is a strongly rigid relation? i.e. Polρ only contains projections.

I first quote a definition from Clone theory in Universal Algebra: A binary relation $\rho$ on a set U is strongly rigid if every universal algebra on U such that $\rho$ is a subuniverse of its square is trivial, i.e., the clone preserving ρ has only projections. It is known that there are only two strongly rigid relations on a 3-element domain. I found that

  1. On a 4-element domain {0,1,2,3}, the following binary relation is possibly a strongly rigid relation: {(0,1), (0,2), (0,3), (1,0), (1,2), (2,0), (2,1), (2,3), (3,1), (3,2)}

  2. On a 5-element domain {0,1,2,3,4}, the following relation is possibly a strongly rigid relation: {(0,2), (0,3), (0,4), (1,0), (1,3), (1,4), (2,0), (2,1), (2,4), (3,0), (3,1), (3,2), (3,4), (4,0), (4,1), (4,2), (4,3)}.

    Could you let me know if there is an easy way to prove the above statements? This could be an algebraic proof, or by using a computer program.

Thanks a lot, Qinghe

How to prove that a binary relation is a strongly rigid relation? i.e. Polρ only contains projections.

I first quote a definition from Clone theory in Universal Algebra: A binary relation $\rho$ on a set U is strongly rigid if every universal algebra on U such that $\rho$ is a subuniverse of its square is trivial. It is known that there are only two strongly rigid relations on a 3-element domain. I found that

  1. On a 4-element domain {0,1,2,3}, the following binary relation is possibly a strongly rigid relation: {(0,1), (0,2), (0,3), (1,0), (1,2), (2,0), (2,1), (2,3), (3,1), (3,2)}

  2. On a 5-element domain {0,1,2,3,4}, the following relation is possibly a strongly rigid relation: {(0,2), (0,3), (0,4), (1,0), (1,3), (1,4), (2,0), (2,1), (2,4), (3,0), (3,1), (3,2), (3,4), (4,0), (4,1), (4,2), (4,3)}.

    Could you let me know if there is an easy way to prove the above statements? This could be an algebraic proof, or by using a computer program.

Thanks a lot, Qinghe

How to prove that a binary relation is a strongly rigid relation? i.e. Polρ only contains projections

I first quote a definition from Clone theory in Universal Algebra: A binary relation $\rho$ on a set U is strongly rigid if every universal algebra on U such that $\rho$ is a subuniverse of its square is trivial, i.e., the clone preserving ρ has only projections. It is known that there are only two strongly rigid relations on a 3-element domain. I found that

  1. On a 4-element domain {0,1,2,3}, the following binary relation is possibly a strongly rigid relation: {(0,1), (0,2), (0,3), (1,0), (1,2), (2,0), (2,1), (2,3), (3,1), (3,2)}

  2. On a 5-element domain {0,1,2,3,4}, the following relation is possibly a strongly rigid relation: {(0,2), (0,3), (0,4), (1,0), (1,3), (1,4), (2,0), (2,1), (2,4), (3,0), (3,1), (3,2), (3,4), (4,0), (4,1), (4,2), (4,3)}.

    Could you let me know if there is an easy way to prove the above statements? This could be an algebraic proof, or by using a computer program.

Thanks a lot, Qinghe

Source Link

How to prove that a binary relation is a strongly rigid relation? i.e. Polρ only contains projections.

I first quote a definition from Clone theory in Universal Algebra: A binary relation $\rho$ on a set U is strongly rigid if every universal algebra on U such that $\rho$ is a subuniverse of its square is trivial. It is known that there are only two strongly rigid relations on a 3-element domain. I found that

  1. On a 4-element domain {0,1,2,3}, the following binary relation is possibly a strongly rigid relation: {(0,1), (0,2), (0,3), (1,0), (1,2), (2,0), (2,1), (2,3), (3,1), (3,2)}

  2. On a 5-element domain {0,1,2,3,4}, the following relation is possibly a strongly rigid relation: {(0,2), (0,3), (0,4), (1,0), (1,3), (1,4), (2,0), (2,1), (2,4), (3,0), (3,1), (3,2), (3,4), (4,0), (4,1), (4,2), (4,3)}.

    Could you let me know if there is an easy way to prove the above statements? This could be an algebraic proof, or by using a computer program.

Thanks a lot, Qinghe