In a finite graph that may have cycles, the transitive reduction is not uniquely defined: there may be more than one graph on the same vertex set that has a minimal number of edges and has the same reachability relation as the given graph.
The edges of the transitive reduction that correspond to condensation edges can always be chosen to be a subgraph of the given graph G.