Question 21193: One Image Alone Is Not a Whole-Orbit Certificate

On this page

Original question and givens
Definition and scope
Step-by-step derivation
Reverse checks
Result
This question review and source binding

← Question derivation index · Original question batch

R0041-21193 · q-20261014-advance-20261108-r01-finite-group-orbit-0093

Original question and givens

Use complete group table=[[0, 1, 2, 3], [1, 2, 3, 0], [2, 3, 0, 1], [3, 0, 1, 2]], declared identity=0, point carrier Fin(7)={0,…,6} and total action_table=[[0, 1, 2, 3, 4, 5, 6], [1, 2, 3, 0, 4, 5, 6], [2, 3, 0, 1, 4, 5, 6], [3, 0, 1, 2, 4, 5, 6]]. Row g/column h gives g*h, and row g/column x of the action table gives g*x. The complete group and both action axioms must qualify before computing orbits; every group element is used. Given group element=1, point=3. Give (group_element, point, image, orbit, orbit_size, single_image_alone_claim, boundary).

G001 — Use complete group table=[[0, 1, 2, 3], [1, 2, 3, 0], [2, 3, 0, 1], [3, 0, 1, 2]], declared identity=0, point carrier Fin(7)={0,…,6} and total action_table=[[0, 1, 2, 3, 4, 5, 6], [1, 2, 3, 0, 4, 5, 6], [2, 3, 0, 1, 4, 5, 6], [3, 0, 1, 2, 4, 5, 6]]. Row g/column h gives g*h, and row g/column x of the action table gives g*x. The complete group and both action axioms must qualify before computing orbits; every group element is used. Given group element=1, point=3. Give (group_element, point, image, orbit, orbit_size, single_image_alone_claim, boundary).

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

mko-finite-group-orbit

Step-by-step derivation

S001 · implies

Before

source operation=orbit-single-step-boundary;original snapshot and mathematics retained

After

explicit ordered source output fields=[group_element, point, image, orbit, orbit_size, single_image_alone_claim, boundary]

Conditions: none

Retain the historical interface marker while listing ordered output fields without JavaScript.Fields and tags are not extra mathematical evidence;fixed No markers retain their claim scope.

Step identifiers and dependencies

Rule: source_ordered_interface_explicit_without_javascript · Uses: G001

S002 · implies

Before

ORIGINAL complete group-label carrier Fin(4);declared identity label=0;Cayley table row g,column h gives g*h=[[0, 1, 2, 3], [1, 2, 3, 0], [2, 3, 0, 1], [3, 0, 1, 2]]

After

ORIGINAL complete point carrier Fin(7);TOTAL action table row g,column x gives g*x=[[0, 1, 2, 3, 4, 5, 6], [1, 2, 3, 0, 4, 5, 6], [2, 3, 0, 1, 4, 5, 6], [3, 0, 1, 2, 4, 5, 6]];all entries in range,so structural closure/totality checked;GROUP AXIOMS not assumed from shape

Conditions: none

The two tables have different column roles:group label h versus action point x.Complete in-range tables establish closure/totality only.A candidate group may fail its axioms;its table name does not certify them.

Step identifiers and dependencies

Rule: groupaction_two_table_roles_complete_candidate_not_group_assumption · Uses: G001, S001

S003 · implies

Before

ORIGINAL closed Cayley table=[[0, 1, 2, 3], [1, 2, 3, 0], [2, 3, 0, 1], [3, 0, 1, 2]];ACTUAL declared group identity=0

After

ALL [g,e*g,g*e,both_equal_g] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes]];two-sided group identity=Yes

Conditions: none

Both e*g and g*e in the group table must equal g.This is not certified by an identity-action row on points.

Step identifiers and dependencies

Rule: groupaction_group_identity_both_sides_not_action_identity · Uses: G001, S002

S004 · implies

Before

ORIGINAL group pair(g,h)=[0, 0];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S003

S005 · implies

Before

ORIGINAL group pair(g,h)=[0, 1];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S004

S006 · implies

Before

ORIGINAL group pair(g,h)=[0, 2];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S005

S007 · implies

Before

ORIGINAL group pair(g,h)=[0, 3];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S006

S008 · implies

Before

ORIGINAL group pair(g,h)=[1, 0];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S007

S009 · implies

Before

ORIGINAL group pair(g,h)=[1, 1];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S008

S010 · implies

Before

ORIGINAL group pair(g,h)=[1, 2];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S009

S011 · implies

Before

ORIGINAL group pair(g,h)=[1, 3];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S010

S012 · implies

Before

ORIGINAL group pair(g,h)=[2, 0];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S011

S013 · implies

Before

ORIGINAL group pair(g,h)=[2, 1];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S012

S014 · implies

Before

ORIGINAL group pair(g,h)=[2, 2];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S013

S015 · implies

Before

ORIGINAL group pair(g,h)=[2, 3];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S014

S016 · implies

Before

ORIGINAL group pair(g,h)=[3, 0];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S015

S017 · implies

Before

ORIGINAL group pair(g,h)=[3, 1];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S016

S018 · implies

Before

ORIGINAL group pair(g,h)=[3, 2];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S017

S019 · implies

Before

ORIGINAL group pair(g,h)=[3, 3];check ALL k in Fin(4)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S018

S020 · implies

Before

ORIGINAL group element g=0;DECLARED identity=0;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 0, 0, Yes], [1, 1, 1, No], [2, 2, 2, No], [3, 3, 3, No]]

After

first actual two-sided inverse witness=0;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S019

S021 · implies

Before

ORIGINAL group element g=1;DECLARED identity=0;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 1, 1, No], [1, 2, 2, No], [2, 3, 3, No], [3, 0, 0, Yes]]

After

first actual two-sided inverse witness=3;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S020

S022 · implies

Before

ORIGINAL group element g=2;DECLARED identity=0;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 2, 2, No], [1, 3, 3, No], [2, 0, 0, Yes], [3, 1, 1, No]]

After

first actual two-sided inverse witness=2;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S021

S023 · implies

Before

ORIGINAL group element g=3;DECLARED identity=0;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 3, 3, No], [1, 0, 0, Yes], [2, 1, 1, No], [3, 2, 2, No]]

After

first actual two-sided inverse witness=1;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S022

S024 · implies

Before

structurally closed COMPLETE group candidate;two-sided identity=Yes;ALL-triple associativity=Yes;ALL-element inverses=Yes

After

group_valid=Yes is the CONJUNCTION;False remains a reported candidate result,not a silent repair

Conditions: none

Group qualification is the conjunction of these complete obligations.A permutation-looking action table cannot repair a bad group table;do not replace the identity or modify the table.

Step identifiers and dependencies

Rule: groupaction_group_axiom_conjunction_candidate_may_fail · Uses: G001, S023

S025 · implies

Before

ACTUAL declared identity label=0;ORIGINAL identity action row=[0, 1, 2, 3, 4, 5, 6];complete point carrier Fin(7)

After

ALL ordered [point,identity_image,equality] rows=[[0, 0, Yes], [1, 1, Yes], [2, 2, Yes], [3, 3, Yes], [4, 4, Yes], [5, 5, Yes], [6, 6, Yes]];identity-action axiom=Yes

Conditions: none

Check e*x=x at every action point,using the actual declared identity label rather than assuming0.This action axiom is distinct from the two-sided identity law in the group table.

Step identifiers and dependencies

Rule: groupaction_every_point_identity_action_not_group_identity · Uses: G001, S024

S026 · implies

Before

ORIGINAL ordered group pair(g,h)=[0, 0];actual group product=0;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

For the left side compute the group product before acting;for the right act by h and then g,without interchanging them.Check every point for every ordered pair and retain the first lexicographic g,h,x failure.

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S025

S027 · implies

Before

ORIGINAL ordered group pair(g,h)=[0, 1];actual group product=1;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 0, 0, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S026

S028 · implies

Before

ORIGINAL ordered group pair(g,h)=[0, 2];actual group product=2;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S027

S029 · implies

Before

ORIGINAL ordered group pair(g,h)=[0, 3];actual group product=3;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 3, 3, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S028

S030 · implies

Before

ORIGINAL ordered group pair(g,h)=[1, 0];actual group product=1;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 0, 0, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S029

S031 · implies

Before

ORIGINAL ordered group pair(g,h)=[1, 1];actual group product=2;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S030

S032 · implies

Before

ORIGINAL ordered group pair(g,h)=[1, 2];actual group product=3;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 3, 3, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S031

S033 · implies

Before

ORIGINAL ordered group pair(g,h)=[1, 3];actual group product=0;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S032

S034 · implies

Before

ORIGINAL ordered group pair(g,h)=[2, 0];actual group product=2;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S033

S035 · implies

Before

ORIGINAL ordered group pair(g,h)=[2, 1];actual group product=3;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 3, 3, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S034

S036 · implies

Before

ORIGINAL ordered group pair(g,h)=[2, 2];actual group product=0;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S035

S037 · implies

Before

ORIGINAL ordered group pair(g,h)=[2, 3];actual group product=1;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 0, 0, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S036

S038 · implies

Before

ORIGINAL ordered group pair(g,h)=[3, 0];actual group product=3;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 3, 3, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S037

S039 · implies

Before

ORIGINAL ordered group pair(g,h)=[3, 1];actual group product=0;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S038

S040 · implies

Before

ORIGINAL ordered group pair(g,h)=[3, 2];actual group product=1;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 0, 0, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S039

S041 · implies

Before

ORIGINAL ordered group pair(g,h)=[3, 3];actual group product=2;action table roles unchanged

After

ALL ordered [point,(g*h)*point,g*(h*point),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes]];earliest failure retained,not overwritten

Conditions: none

Step identifiers and dependencies

Rule: groupaction_all_ordered_compatibility_triples_not_samples · Uses: G001, S040

S042 · calculation

Before

group action ordered group-pair count := mul(4, 4)

After

group action ordered group-pair count = 16

Conditions: none

Substitute original roles and established intermediates exactly,retaining indices,signs,denominators and the proof's applicability conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S041

S043 · calculation

Before

group action complete triple-domain count := mul(16, 7)

After

group action complete triple-domain count = 112

Conditions: none

Substitute original roles and established intermediates exactly,retaining indices,signs,denominators and the proof's applicability conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S042

S044 · implies

Before

COMPLETE triple domain order^2*point_count=112;this derivation ACTUALLY checked all112 triples

After

compatibility=Yes;FIRST source-order failure[g,h,x,left,right]=null;null means NO failure anywhere

Conditions: none

The triple_count is the complete quantified domain size,not a measurement of an early-stopping prototype.This derivation actually checks every point for every g,h pair,so null certifies full compatibility and a first failure retains exact source data/order.

Step identifiers and dependencies

Rule: groupaction_full_domain_count_first_failure_not_early_stop_measurement · Uses: G001, S043

S045 · implies

Before

ORIGINAL group-row label=0;ORIGINAL point-indexed action row=[0, 1, 2, 3, 4, 5, 6]

After

sorted image MULTISET=[0, 1, 2, 3, 4, 5, 6];equals full point carrier=Yes;original row NOT reordered

Conditions: none

Sort only to test whether the image multiset covers the full carrier exactly once;do not reorder the original point-indexed row.Even all-permutation rows alone do not establish an action without the group and both action axioms.

Step identifiers and dependencies

Rule: groupaction_every_row_permutation_actual_images_not_validity_converse · Uses: G001, S044

S046 · implies

Before

ORIGINAL group-row label=1;ORIGINAL point-indexed action row=[1, 2, 3, 0, 4, 5, 6]

After

sorted image MULTISET=[0, 1, 2, 3, 4, 5, 6];equals full point carrier=Yes;original row NOT reordered

Conditions: none

Step identifiers and dependencies

Rule: groupaction_every_row_permutation_actual_images_not_validity_converse · Uses: G001, S045

S047 · implies

Before

ORIGINAL group-row label=2;ORIGINAL point-indexed action row=[2, 3, 0, 1, 4, 5, 6]

After

sorted image MULTISET=[0, 1, 2, 3, 4, 5, 6];equals full point carrier=Yes;original row NOT reordered

Conditions: none

Step identifiers and dependencies

Rule: groupaction_every_row_permutation_actual_images_not_validity_converse · Uses: G001, S046

S048 · implies

Before

ORIGINAL group-row label=3;ORIGINAL point-indexed action row=[3, 0, 1, 2, 4, 5, 6]

After

sorted image MULTISET=[0, 1, 2, 3, 4, 5, 6];equals full point carrier=Yes;original row NOT reordered

Conditions: none

Step identifiers and dependencies

Rule: groupaction_every_row_permutation_actual_images_not_validity_converse · Uses: G001, S047

S049 · implies

Before

CURRENT original group/action qualified:group=Yes,identity_action=Yes,compatibility=Yes,permutations=Yes;actual inverses=[0, 3, 2, 1]

After

only NOW use the action axioms;row permutations ALONE are insufficient;invalid group/action data are rejected,not reported as an orbit

Conditions: none

Qualify the actual group and both action axioms before using orbits.Permutation rows alone are insufficient.Reused frozen pure helpers receive this question's full tables and trace,not a link to an old derivation.

Step identifiers and dependencies

Rule: orbit_reject_unqualified_tables_before_orbit_claims · Uses: G001, S048

S050 · implies

Before

CURRENT identity=0;full inverses=[0, 3, 2, 1];action table=[[0, 1, 2, 3, 4, 5, 6], [1, 2, 3, 0, 4, 5, 6], [2, 3, 0, 1, 4, 5, 6], [3, 0, 1, 2, 4, 5, 6]]

After

reflexive:e*x=x;symmetric:y=g*x gives x=g_inverse*y;transitive:y=g*x,z=h*y gives z=(h*g)*x;therefore related iff the two full orbits are equal,and distinct orbits are disjoint

Conditions: none

Symmetry uses the actual inverse and action compatibility.Transitivity acts by g and then h,so the product is h*g,without assuming commutativity.If two orbits share a point,symmetry and transitivity give both inclusions;otherwise they are disjoint.

Step identifiers and dependencies

Rule: orbit_equivalence_reflexive_symmetric_transitive_hg_order · Uses: G001, S049

S051 · calculation

Before

orbit point3 distinct image count := sum(1, 1, 1, 1)

After

orbit point3 distinct image count = 4

Conditions: none

Substitute the original roles and established intermediates exactly,retaining order,signs and quantified conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S050

S052 · implies

Before

ORIGINAL point=3;images in ALL group-index order=[3, 0, 1, 2];group order=4

After

full orbit sorted and deduplicated=[0, 1, 2, 3];orbit cardinality=4;group enumeration count=4;these counts need NOT agree

Conditions: none

Take images under every group element,not a single g,generator reachability or a stabilizer.Multiple elements may have the same image;keep group order distinct from orbit size.

Step identifiers and dependencies

Rule: orbit_all_original_group_rows_not_single_generator · Uses: G001, S051

S053 · implies

Before

ORIGINAL single group element=1,point=3,image=0;full orbit=[0, 1, 2, 3]

After

fixed No WITHHOLDS a general identification of one image with the full orbit;does NOT deny singleton orbit special cases

Conditions: none

A single step gives one image;the full orbit uses every g.The fixed No withholds a general identification without denying a special singleton orbit.

Step identifiers and dependencies

Rule: orbit_single_step_nonclaim_not_singleton_orbit_negation · Uses: G001, S052

Reverse checks

S053 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S052 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S051 · premise_and_result_audit — Recompute orbit point3 distinct image count with exact rational arithmetic, not rounded decimals.
S050 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S049 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S048 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S047 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S046 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S045 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S044 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S043 · premise_and_result_audit — Recompute group action complete triple-domain count with exact rational arithmetic, not rounded decimals.
S042 · premise_and_result_audit — Recompute group action ordered group-pair count with exact rational arithmetic, not rounded decimals.
S041 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S040 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S039 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S038 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S037 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S036 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S035 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S034 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S033 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S032 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S031 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S030 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S029 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S028 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S027 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S026 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S025 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S024 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S023 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S022 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S021 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S020 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S019 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S018 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S017 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S016 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S015 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S014 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S013 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S012 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

(1, 3, 0, [0, 1, 2, 3], 4, No, single_action_image_not_the_whole_orbit)

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts

input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
original question SHA-256: 6d5bb38bedd99eff0befbda6ff49ae3ace981de8dffb21a297178e40bad5f78c
candidate record SHA-256: 7c58e25dff6278a94c91cd5020f2414c83ef88380fca8fbbe16558c80f4b316e
semantic review receipt SHA-256: 8f134403487694af4c70d2e00ec84bab542043ef4b3c54517c04f3c409c0262a
question-first witness SHA-256: ad772845088ed8e99f87f90d4264b05ea97be35775305a02011af5ee35f0f4ce
Lean: NOT_RUN · human review: NOT_PERFORMED

Same-source full JSON